An optimal linked list prefix algorithms on a local memory computer

Authors:
Y. Han
Affiliations:
Department of Computer Science, University of Kentucky, Lexlngton, KY
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 7
Cited 3

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
Parallel symmetry-breaking in sparse graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees

Information Processing Letters
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
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
The Complexity of Parallel Computations

The Complexity of Parallel Computations

Matching partition a linked list and its optimization

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
More efficient parallel integer sorting

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a deterministic parallel algorithm for the linked list prefix problem. It computes linked list prefix 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. We also show that a maximal matching for a linked list can be computed in O(logG(n)) time with n processors and n shared cells.