2609 search results - page 433 / 522 » Optimizing for parallelism and data locality |
113
click to vote
IEEEPACT
2005
IEEE
15 years 6 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
120
Voted
GRID
2006
Springer
15 years 18 days ago
2006
Springer
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
95
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
119
click to vote
SC
2009
ACM
15 years 7 months ago
2009
ACM
Scientific workflow tools allow users to specify complex computational experiments and provide a good framework for robust science and engineering. Workflows consist of pipelines ...
112
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...