Randomized parallel speedups for list ranking

Journal Article · Mon Jun 01 00:00:00 EDT 1987 · J. Parallel Distrib. Comput.; (United States)

DOI:https://doi.org/10.1016/0743-7315(87)90040-2· OSTI ID:6225065

Vishkin, U

The following problem is considered: given a linked list of length n, compute the distance of each element of the linked list from the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(n log n)/ rho + log n) time parallel algorithm using rho processors. The authors present a randomized parallel algorithm for the problem. The algorithm is designed for an exclusive-read exclusive-write parallel random access machine (EREW PRAM). It runs almost surely in time O(n/rho + log n log* n) using rho processors. Using a recently published parallel prefix sums algorithm the list-ranking algorithm can be adapted to run on a concurrent-read concurrent-write parallel random access machine (CRCW PRAM) almost surely in time O(n/rho + log n) using rho processors.

• Research Organization: Dept. of Computer Science, School of Mathematical Sciences, Tel Aviv Univ., Tel Aviv 69 978
• OSTI ID: 6225065
• Journal Information: J. Parallel Distrib. Comput.; (United States), Vol. 4:3
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
READOUT SYSTEMS
SUPERCOMPUTERS
TIME DEPENDENCE
COMPUTERS
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)