(Enter summary)
Abstract: 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 + log n) on a local memory
PRAM model using p processors and p shared memory cells. (Update)
Context of citations to this paper: More
...embedding of G. The computation takes O(log n) time and n= log n processors, using optimal parallel algorithms for list ranking [5] 9] [13], prefix computation [24] 23] tree contraction [26] 1] 8] 22] 11] 10] and planar connectivity [12] 3. Strongly connected...
Cited by: More
Parallel Integer Sorting Is More Efficient than Parallel.. - Han, Shen (1999)
(Correct)
Parallel Algorithm for Linked List and Beyond - Han (1990)
(Correct)
Matching Partition a Linked List and Its Optimization - Han (1989)
(Correct)
Active bibliography (related documents): More All
0.9: An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1989)
(Correct)
0.5: Parallel Algorithms for Computing Linked List Prefix - Han (1989)
(Correct)
0.2: Regular Versus Irregular Problems and Algorithms. - Gautier, Roch, Villard (1995)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Polymorphic Type Inference and Semi-Unification - Henglein (1989)
(Correct)
0.1: Parallel Algorithms for Bucket Sorting and the Data Dependent.. - Wagner, Han (1986)
(Correct)
0.1: An Improvement on Parallel Computation of a Maximal Matching - Han
(Correct)
Related documents from co-citation: More All
4: Deterministic parallel list ranking (context) - Anderson, Miller - 1991
3: Parallel tree contraction and its application (context) - Miller, Reif - 1985
3: The Complexity of Parallel Computations (context) - Wyllie - 1979
BibTeX entry: (Update)
Y. Han, An optimal linked list prefix algorithm on a local memory computer, IEEE Transactions on Computers, 40 (1991), pp. 1149--1153. http://citeseer.ist.psu.edu/article/han91optimal.html More
@inproceedings{ han89optimal,
author = "Y. Han",
title = "An Optimal Linked List Prefix Algorithms on a Local Memory Computer",
booktitle = "{ACM} Conference on Computer Science",
pages = "278-286",
year = "1989",
url = "citeseer.ist.psu.edu/article/han91optimal.html" }
Citations (may not include all citations):
173
Hot Spot contention and combining in multistage interconnect.. (context) - Pfister, Norton - 1985
159
Tight bounds on the complexity of parallel sorting (context) - Leighton - 1985
122
Parallel tree contraction and its application (context) - Miller, Reif - 1985
47
The complexity of parallel computation (context) - Wyllie
40
Deterministic coin tossing and accelerating cascades: Micro .. (context) - Cole, Vishkin - 1986
33
The power of parallel prefix (context) - Kruskal, Rudolph et al. - 1985
31
On parallel searching (context) - Snir - 1985
25
Routing, merging and sorting on parallel models of computati.. (context) - Borodin, Hopcroft - 1982
21
An optimal parallel algorithm for integer sorting (context) - Reif - 1985
14
Parallel algorithms for bucket sorting and the data dependen..
- Wagner, Han - 1986
12
Complexity results for permuting data and other computations.. (context) - Gottlieb, Kruskal - 1984
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
3
Optimal parallel algorithms for the list ranking problem (context) - Anderson, Miller - 1986
1
rd Aegean Workshop on Computing (context) - Deterministic, ranking et al. - 1988
1
Parallel Distributed Comput (context) - Parallel, computing et al. - 1989
1
tree and graph problems (context) - Approximate, scheduling et al. - 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)
Storing Shortest Paths for a Polyhedron - Jindong Chen And (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