
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y. Han, "An Optimal Linked List Prefix Algorithm on a Local Memory Computer," IEEE Transactions on Computers, vol. 40, no. 10, pp. 11491153, October, 1991.  
BibTex  x  
@article{ 10.1109/12.93747, author = {Y. Han}, title = {An Optimal Linked List Prefix Algorithm on a Local Memory Computer}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {10}, issn = {00189340}, year = {1991}, pages = {11491153}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.93747}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Optimal Linked List Prefix Algorithm on a Local Memory Computer IS  10 SN  00189340 SP1149 EP1153 EPD  11491153 A1  Y. Han, PY  1991 KW  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. VL  40 JA  IEEE Transactions on Computers ER   
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, 8190, JuneJuly, 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. 338344.
[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. 206219.
[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. 478491.
[6] A. Gottlieb, C. P. Kruskal, "Complexity results for permuting data and other computations on parallel processors,"J. ACM, vol. 31, no. 2, pp. 193209, 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. 537557, 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. 278284.
[10] C. P. Kruskal, L. Rudolph, and M. Snir, "The power of parallel prefix,"IEEE Trans. Comput., vol. C34, no. 10, pp. 965968, Oct. 1985.
[11] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C34, no. 4, pp. 344354, 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. 478489.
[13] G. F. Pfister and V. A. Norton, "Hot spot contention and combining in multistage interconnection networks,"IEEE Trans. Comput., vol. C34, no. 10, pp. 934948, Oct. 1985.
[14] J. H. Reif, "An optimal parallel algorithm for integer sorting, inProc. 26th Symp. Foundations Comput. Sci., IEEE, 1985 pp. 291298.
[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. 688708, 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. 924930.
[18] J. C. Wyllie, "The complexity of parallel computation," TR 79387, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.