Proceedings ArticleDOI
An 0(n log n) sorting network
Miklós Ajtai,János Komlós,Endre Szemerédi +2 more
- pp 1-9
Reads0
Chats0
TLDR
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.Abstract:
The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n). A natural way of sorting is through consecutive halvings: determine the upper and lower halves of the set, proceed similarly within the halves, and so on. Unfortunately, while one can halve a set using only 0(n) comparisons, this cannot be done in less than log n (parallel) time, and it is known that a halving network needs (½)n log n comparisons. It is possible, however, to construct a network of 0(n) comparisons which halves in constant time with high accuracy. This procedure (e-halving) and a derived procedure (e-nearsort) are described below, and our sorting network will be centered around these elementary steps.read more
Citations
More filters
Proceedings ArticleDOI
The average complexity of deterministic and randomized parallel comparison sorting algorithms
Noga Alon,Yossi Azar +1 more
TL;DR: It is shown that for p ≥ n this time is Θ (log n/log(1 + p/n), and for p ≤ n the time isΘ (n log n/p) = Θ(log n/(p/n); therefore even the average case behaviour of randomized algorithms is not more efficient than the worst case behaviourof deterministic ones.
Proceedings Article
Emulations between QSM, BSP, and LogP: a framework for general-purpose parallel algorithm design
TL;DR: QSM analysis will predict algorithm performance quite accurately for problem sizes that arise in practice, and a matching lower bound is presented that shows this algorithm to be optimal over the complete range of these parameters.
Proceedings ArticleDOI
Distributed construction of a fault-tolerant network from a tree
TL;DR: An algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (an expander graph) among themselves in a distributed and scalable way is presented.
Proceedings ArticleDOI
Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue
TL;DR: This work proposes Path Oblivious Heap, an extremely simple, practical, and optimal oblivious priority queue, and implies a practical and optimallivious sorting algorithm which it is shown that improves existing works by 1-2 orders of magnitude.
Journal ArticleDOI
On the complexity of slice functions
TL;DR: It is shown in this paper that monotone circuits for slice functions can be understood as special circuits called set circuits, here, disjunction and conjunction are replaced by set union and set intersection.
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
Space bounds for a game on graphs
TL;DR: It is shown that for each graph withn vertices and maximum in-degreed, there is a pebbling strategy which requires at mostc(d) n/logn pebbles, and this bound is tight to within a constant factor.
Proceedings ArticleDOI
Explicit constructions of linear size superconcentrators
Ofer Gabber,Zvi Galil +1 more
TL;DR: An explicit construction of an infinite family of N-superconcentrators of density 44 of the most economical previously known explicit graphs of this type is presented.
Proceedings ArticleDOI
On non-linear lower bounds in computational complexity
TL;DR: It is shown that the graph of any algorithm for any one of a number of arithmetic problems (e.g. polynomial multiplication, discrete Fourier transforms, matrix multiplication) must have properties closely related to concentration networks.