Proceedings ArticleDOI
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
R. Cypher,C. G. Plaxton +1 more
- Vol. 47, Iss: 3, pp 193-203
Reads0
Chats0
TLDR
A deterministic sorting algorithm, called Sharesort, is presented that sorts n records on an n -processor hypercube, shuffle-exchange, or cube-connected cycles in O (log n (log log n ) 2 ) time in the worst case.Abstract:
This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor hypercube, shuffle-exchange, or cube-connected cycles in O (log n (log log n ) 2 ) time in the worst case. The algorithm requires only a constant amount of storage at each processor. The fastest previous deterministic algorithm for this problem was Batcher's bitonic sort, which runs in O (log 2 n ) time.read more
Citations
More filters
Journal ArticleDOI
External memory algorithms and data structures: dealing with massive data
TL;DR: The state of the art in the design and analysis of external memory algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs is surveyed.
General Purpose Parallel Architectures.
TL;DR: The results suggest that the XPRAM might turn out to be an appropriate aspiration for the parallel computer architect much as the von Neumann model is in the sequential case.
Proceedings ArticleDOI
A comparison of sorting algorithms for the connection machine CM-2
Guy E. Blelloch,Charles E. Leiserson,Bruce M. Maggs,C. Greg Plaxton,Stephen J. Smith,Marco Zagha +5 more
TL;DR: A fast sorting algorithm for the Connection Machine Supercomputer model CM-2 is developed and it is shown that any U(lg n)-depth family of sorting networks can be used to sort n numbers in U( lg n) time in the bounded-degree fixed interconnection network domain.
Book
Models of Computation: Exploring the Power of Computing
TL;DR: In Models of Computation, John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages.
Book
Algorithms and Data Structures for External Memory
TL;DR: The state of the art in the design and analysis of algorithms and data structures for external memory (or EM for short), where the goal is to exploit locality and parallelism in order to reduce the I/O costs is surveyed.
References
More filters
Proceedings ArticleDOI
Sorting networks and their applications
TL;DR: To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.
Journal ArticleDOI
Parallel Processing with the Perfect Shuffle
TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Journal ArticleDOI
The cube-connected cycles: a versatile network for parallel computation
TL;DR: This work describes in detail how to program the cube-connected cycles for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.
Proceedings ArticleDOI
An 0(n log n) sorting network
TL;DR: A sorting network of size 0(n log n) and depth 0(log n) is described, and a derived procedure (&egr;-nearsort) are described below, and the sorting network will be centered around these elementary steps.
Journal ArticleDOI
Sorting in c log n parallel steps
TL;DR: A sorting network withcn logn comparisons where in thei-th step of the algorithm the contents of registersRj, andRk, wherej, k are absolute constants then change their contents or not according to the result of the comparison.