An Optimal Linked List Prefix Algorithm on a Local Memory Computer

Authors:
Yijie Han
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 8
Cited 0

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Designing fast and efficient parallel algorithms

Designing fast and efficient parallel algorithms
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Parallel algorithms for computing linked list prefix

Journal of Parallel and Distributed Computing
Complexity Results for Permuting Data and Other Computations on Parallel Processors

Journal of the ACM (JACM)
Deterministic Parallel List Ranking

AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Routing, merging and sorting on parallel models of computation

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Complexity of Parallel Computations

The Complexity of Parallel Computations

Quantified Score

Hi-index	14.98

Visualization

Abstract

The author presents a deterministic parallel algorithm for the linked list prefix problem. It computes linked list prefixs for an input list of n elements in time O(n/p+logn) on a local memory PRAM model using p processors and p shared memory cells.