See this document in CiteSeerX!

Parallel Algorithms for Computing Linked List Prefix (1989)  (Make Corrections)  (3 citations)
Yijie Han
Journal of Parallel and Distributed Computing



  Home/Search   Context   Related

 
View or download:
umkc.edu/~hanyij/research/prefix.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umkc.edu/~hanyij/research...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we 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=p + p log p), where n is the number of elements in the linked list and p is the number of processors used. Therefore our algorithm is optimal when n p log p. A PRAM linked list prefix algorithm... (Update)

Similar documents based on text:   More   All
0.3:   An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991)   (Correct)
0.3:   Parallel Algorithm for Linked List and Beyond - Han (1990)   (Correct)
0.2:   Matching Partition a Linked List and Its Optimization - Han (1989)   (Correct)

Related documents from co-citation:   More   All
2:   Designing Fast and efficient Parallel Algorithms (context) - Han - 1987
2:   Parallel tree contraction and its application (context) - Miller, Reif - 1985
2:   Deterministic parallel list ranking (context) - Anderson, Miller - 1991

BibTeX entry:   (Update)

. Y. Han. Parallel algorithms for computing linked list prefix. J. of Parallel and Distributed Computing 6, 537-557(1989). http://citeseer.ist.psu.edu/han89parallel.html   More

@article{ han89parallel,
    author = "Y. Han",
    title = "Parallel Algorithms for Computing Linked List Prefix",
    journal = "Journal of Parallel and Distributed Computing",
    volume = "6",
    number = "3",
    publisher = "Academic Press",
    address = "San Diego, New York, Boston, London, Syndey, Tokyo, Toronto",
    pages = "537--557",
    year = "1989",
    url = "citeseer.ist.psu.edu/han89parallel.html" }
Citations (may not include all citations):
322   Sorting networks and their applications (context) - Batcher - 1968
159   Tight bounds on the complexity of parallel sorting (context) - Leighton - 1985
134   Computational Aspects of VLSI (context) - Ullman - 1984
122   Parallel tree contraction and its application (context) - Miller, Reif - 1985
64   How to share memory in a distributed system (context) - Upfal, Wigderson - 1984
47   The complexity of parallel computation (context) - Wyllie
41   Efficient parallel algorithms for graph problems (context) - Kruskal, Rudolph et al. - 1986
40   Deterministic coin tossing and accelerating cascade: Micro a.. (context) - Cole, Vishkin - 1986
38   merging and sorting on parallel models of computation (context) - Borodin, Hopcroft - 1982
38   Finding biconnected components and computing tree functions .. (context) - Tarjan, Vishkin - 1984
33   The power of parallel prefix (context) - Kruskal, Rudolph et al. - 1985
32   contention and combining in multistage interconnection netwo.. (context) - Pfister, Norton - 1985
31   On parallel searching (context) - Snir - 1985
21   An optimal parallel algorithm for integer sorting (context) - Reif - 1985
14   Parallel algorithms for bucket sorting and the data dependen.. - Wagner, Han - 1986
10   Probabilistic parallel prefix computation - Reif
8   Designing fast and efficient parallel algorithms (context) - Han - 1987
5   Parallel prefix on fully connected direct connection machine (context) - Kruskal, Madej et al. - 1986
1   Approxiamate and exact parallel scheduling with applications.. (context) - Cole, Vishkin - 1986

Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm):   More
Matching Partition a Linked List and Its Optimization - Han (1989)   (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990)   (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC