Parallel algorithms for computing linked list prefix

Journal Article · Thu Jun 01 00:00:00 EDT 1989 · Journal of Parallel and Distributed Computing; (USA)

DOI:https://doi.org/10.1016/0743-7315(89)90005-1· OSTI ID:5242836

Han, Y ^[1]

---

1. Kentucky Univ., Lexington, KY (USA)

Given a linked list chi/sub 1/, chi/sub 2/, ....chi/sub n/ with chi/sub i/ following chi/sub i-1/ in the list and an associative operation O, the linked list prefix problem is to compute all prefixes O/sup j//sub i=1/chi/sub 1/, j=1,2,...,n. In this paper the authors study the linked list prefix problem on parallel computation models. A deterministic algorithm for computing a linked list prefix on a completely connected parallel computation model is obtained by applying vector balancing techniques. The time complexity of the algorithm is O(n/rho + rho log rho), where n is the number of elements in the linked list and rho is the number of processors used. Therefore their algorithm is optimal when n {ge}rho/sup 2/logrho. A PRAM linked list prefix algorithm is also presented. This PRAM algorithm has time complexity O(n/rho + log rho) with small multiplicative constant. It is optimal when n {ge}rho log rho.

• OSTI ID: 5242836
• Journal Information: Journal of Parallel and Distributed Computing; (USA), Vol. 6:3; ISSN 0743-7315
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
COMPUTERIZED SIMULATION
VECTOR PROCESSING
ALGORITHMS
P CODES
COMPUTER CODES
MATHEMATICAL LOGIC
PROGRAMMING
SIMULATION
990200* - Mathematics & Computers