Sciweavers

281 search results - page 5 / 57
» Implementations of Randomized Sorting on Large Parallel Mach...
Sort
View
IPPS
1998
IEEE
14 years 2 days ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
TC
2008
13 years 7 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
IPPS
2003
IEEE
14 years 1 months ago
A Divided-Screenwise Hierarchical Compositing for Sort-Last Parallel Volume Rendering
In this work, to render at least 5123 voxel volumes in real-time, we have developed a sort-last parallel volume rendering method for distributed memory multiprocessors. Our sort-l...
Fumihiko Ino, Tomomitsu Sasaki, Akira Takeuchi, Ke...
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 2 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
MST
1998
91views more  MST 1998»
13 years 7 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson