Sciweavers

588 search results - page 73 / 118
» Reducibility and Completeness in Private Computations
Sort
View
ICPPW
2005
IEEE
15 years 11 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...
EUROPAR
2005
Springer
15 years 11 months ago
Tolerating Message Latency Through the Early Release of Blocked Receives
Large message latencies often lead to poor performance of parallel applications. In this paper, we investigate a latency-tolerating technique that immediately releases all blocking...
Jian Ke, Martin Burtscher, William Evan Speight
WMPI
2004
ACM
15 years 11 months ago
A case for multi-level main memory
Current trends suggest that the number of memory chips per processor chip will increase at least a factor of ten in seven years. This will make DRAM cost, the space and the power i...
Magnus Ekman, Per Stenström
EGH
2004
Springer
15 years 11 months ago
A hierarchical shadow volume algorithm
The shadow volume algorithm is a popular technique for real-time shadow generation using graphics hardware. Its major disadvantage is that it is inherently fillrate-limited, as t...
Timo Aila, Tomas Akenine-Möller
DOCENG
2003
ACM
15 years 11 months ago
Lazy XSL transformations
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
Steffen Schott, Markus L. Noga