This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Linked List Prefix Algorithm on a Local Memory Computer
October 1991 (vol. 40 no. 10)
pp. 1149-1153

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.

[1] R. J. Anderson and G. L. Miller, "Optimal parallel algorithms for the list ranking problem," U.S.C. Tech Rep. 1986.
[2] R. J. Anderson and G. L. Miller, "Deterministic parallel list ranking," inLecture Notes in Computer Science 319, VLSI Algorithms and Architectures, J. Reif, Ed., 3rd Aegean Workshop on Computing, 81-90, June-July, 1988.
[3] R. A. Borodin and J. E. Hopcroft, "Routing, merging and sorting on parallel models of computation," inProc. 14th ACM Symp. Theory Comput., San Francisco, CA, Apr. 1982, pp. 338-344.
[4] R. Cole and U. Vishkin, "Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms," inProc. 18th ACM Symp. Theory Comput., 1986, pp. 206-219.
[5] R. Cole and U. Vishkin, "Approximate and exact parallel scheduling with applications to list, tree and graph problems," inProc. 27th Symp. Foundations Comput. Sci., IEEE, 1986, pp. 478-491.
[6] A. Gottlieb, C. P. Kruskal, "Complexity results for permuting data and other computations on parallel processors,"J. ACM, vol. 31, no. 2, pp. 193-209, Apr. 1984.
[7] Y. Han, "Designing fast and efficient parallel algorithms," Ph.D. dissertation. Dep. Computer Sci., Duke Univ., 1987.
[8] Y. Han, "Parallel algorithms for computing linked list prefix,"J. Parallel Distributed Comput., vol. 6, pp. 537-557, 1989.
[9] C. P. Kruskal, T. Madej, and L. Rudolph, "Parallel prefix on fully connected direct connection maching," inProc. 1986 Int. Conf. Parallel Processing, pp. 278-284.
[10] C. P. Kruskal, L. Rudolph, and M. Snir, "The power of parallel prefix,"IEEE Trans. Comput., vol. C-34, no. 10, pp. 965-968, Oct. 1985.
[11] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C-34, no. 4, pp. 344-354, Apr. 1985.
[12] G. L. Miller, and J. H. Reif, "Parallel tree contraction and its application," inProc. 26th Symp. Foundations Comput. Sci., IEEE, 1985, pp. 478-489.
[13] G. F. Pfister and V. A. Norton, "Hot spot contention and combining in multistage interconnection networks,"IEEE Trans. Comput., vol. C-34, no. 10, pp. 934-948, Oct. 1985.
[14] J. H. Reif, "An optimal parallel algorithm for integer sorting, inProc. 26th Symp. Foundations Comput. Sci., IEEE, 1985 pp. 291-298.
[15] J. H. Reif, "Probabilistic parallel prefix computation," inProc. 1984 Int. Conf. Parallel Processing, Aug. 1984.
[16] M. Snir, "On parallel searching,"SIAM J. Comput., vol. 14, no. 3, pp. 688-708, Aug. 1985.
[17] R. A. Wagner and Y. Han, "Parallel algorithms for bucket sorting and the data dependent prefix problem," inProc. 1986 Int. Conf. Parallel Processing, pp. 924-930.
[18] J. C. Wyllie, "The complexity of parallel computation," TR 79-387, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.

Index Terms:
linked list prefix algorithm; local memory computer; deterministic parallel algorithm; input list; local memory PRAM model; processors; shared memory cells; computational complexity; data structures; list processing; parallel algorithms.
Citation:
Y. Han, "An Optimal Linked List Prefix Algorithm on a Local Memory Computer," IEEE Transactions on Computers, vol. 40, no. 10, pp. 1149-1153, Oct. 1991, doi:10.1109/12.93747
Usage of this product signifies your acceptance of the Terms of Use.