Open Access
Power of parallel prefix.
Clyde P. Kruskal,Larry Rudolph,Marc Snir,Marc Snir +3 more
- pp 180-185
About:
The article was published on 1985-12-01 and is currently open access. It has received 242 citations till now. The article focuses on the topics: Exabit & Yottabyte.read more
Citations
More filters
Book
The design and analysis of parallel algorithms
TL;DR: Kurskod av teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskapskap Huvudområden och successiv fördjupning.
Book
Vector models for data-parallel computing
TL;DR: A model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based is described, and it is argued that data-parallel models are not only practical and can be applied to a surprisingly wide variety of problems, they are also well suited for very-high-level languages and lead to a concise and clear description of algorithms and their complexity.
Journal ArticleDOI
Scans as primitive parallel operations
TL;DR: A study of the effects of adding two scan primitives as unit-time primitives to PRAM (parallel random access machine) models is presented and it is shown that the primitives improve the asymptotic running time of many algorithms by an O(log n) factor, greatly simplifying the description of many technologies.
Book
Limits to Parallel Computation: P-Completeness Theory
TL;DR: In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.
Book
Hacker's Delight
TL;DR: The term "hacker" in the title is meant in the originalsense of an aficionado of computerssomeone who enjoys making computers do new things, or do old things in a new and clever way.
References
More filters
Journal ArticleDOI
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
Peter M. Kogge,Harold S. Stone +1 more
TL;DR: This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Iliac IV.
Journal ArticleDOI
A fast parallel algorithm for routing in permutation networks
TL;DR: An algorithm is given for routing in permutation networks-that is, for computing the switch settings that implement a given permutation.
The Complexity of Parallel Computations
TL;DR: This thesis describes an algorithm for the off-line MIN that organizes its computation in the form of a complete binary tree that relies on redundancy in its representation of the input graph, and introduces three techniques that permit the design of parallel algorithms that are efficient in terms of both their time and processor requirements.
Proceedings Article
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)
Robert E. Tarjan,Uzi Vishkin +1 more
TL;DR: A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced, which typically requires 0(log n) time using 0(n) space on an exclusive-read exclusive-write parallel RAM.
Book
On parallel searching
Marc Snir,Marc Snir +1 more
TL;DR: Lower bounds are first proven for comparison-based algorithms; it is next shown that comparison- based algorithms are as pow...