An optimal linked list prefix algorithms on a local memory computer

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.

[1]  Gary L. Miller,et al.  Deterministic Parallel List Ranking , 1988, AWOC.

[2]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[3]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[4]  Marc Snir,et al.  On Parallel Searching , 2011, SIAM J. Comput..

[5]  Yijie Han,et al.  : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem , 1986, ICPP.

[6]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[7]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Y. Han.  Designing fast and efficient parallel algorithms , 1987 .

[9]  Allan Gottlieb,et al.  Complexity Results for Permuting Data and Other Computations on Parallel Processors , 1984, JACM.

[10]  Nathan Linial,et al.  Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  Andrew V. Goldberg,et al.  Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..

[12]  Yijie Han,et al.  Parallel Algorithms for Computing Linked List Prefix , 1989, J. Parallel Distributed Comput..

[13]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[14]  Larry Rudolph,et al.  Parallel Prefix on Fully Connected Direct Connection Machines , 1986, ICPP.

[15]  Kurt Mehlhorn,et al.  Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees , 1988, Inf. Process. Lett..

[16]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[19]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.