234 search results - page 9 / 47 » Sorting and Selection on Distributed Memory Bus Computers |
111
click to vote
HPCA
1998
IEEE
15 years 6 months ago
1998
IEEE
The explosive growth in the performance of microprocessors and networks has created a new opportunity to reduce the latency of fine-grain communication. Microprocessor clock speed...
162
click to vote
SPAA
1996
ACM
15 years 6 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
120
click to vote
SPAA
1995
ACM
15 years 6 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
DAC
2000
ACM
16 years 3 months ago
2000
ACM
In this paper, we presen t the design and use of a comprehensiv e framework, SimplePower, for evaluating the e ect of high-level algorithmic, architectural, and compilation tradeo...
151
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
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...