Sciweavers

611 search results - page 3 / 123
» Highly scalable parallel sorting
Sort
View
SPAA
1996
ACM
15 years 1 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
CLUSTER
2007
IEEE
14 years 9 months ago
Malleable applications for scalable high performance computing
Travis J. Desell, Kaoutar El Maghraoui, Carlos A. ...
IPPS
2010
IEEE
14 years 7 months ago
Engineering a scalable high quality graph partitioner
Manuel Holtgrewe, Peter Sanders, Christian Schulz
JEA
1998
133views more  JEA 1998»
14 years 9 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
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...
David R. Helman, Joseph JáJá, David ...
SI3D
1995
ACM
15 years 29 days ago
The Sort-First Rendering Architecture for High-Performance Graphics
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
Carl Mueller