121 search results - page 7 / 25 » Load-Balanced Parallel Merge Sort on Distributed Memory Para... |
JEA
1998
13 years 8 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
IPPS
1998
IEEE
14 years 26 days ago
1998
IEEE
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
IPPS
1997
IEEE
14 years 24 days ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
ICPP
1995
IEEE
14 years 5 days ago
1995
IEEE
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Uintah is a highly parallel and adaptive multiphysics framework created by the Center for Simulation of Accidental Fires and Explosions in Utah. Uintah, which is built up...