Practical Massively Parallel Sorting - Basic Algorithmic Ideas.
Year: 2014
Type: preprint
Abstract: . To obtain sorting algorithms that scale to the largest available machines, conventional parallel sorting algorithms cannot be used since they either have prohibitive communication volume or prohibitive critical path length for computation. We outline ideas how to combine a number of basic algorithmic techniques which overcome these bottlenecks. 1
Source: arXiv (Cornell University)
Institution: Karlsruhe Institute of Technology
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1495559815
