(Enter summary)
Abstract: Contents
1 Preface - A Case for Studying Parallel Algorithms 4
1.1 Summary : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4
1.2 More background and detail : : : : : : : : : : : : : : : : : : : : : : : : : 6
2 Introduction 8
2.1 The PRAM Model : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8
2.1.1 Example of a PRAM algorithm : : : : : : : : : : : : : : : : : : : 9
2.2 Data-Parallel presentation of algorithms : : : : : : : : : : : : : : : : : : 11
2.3 Goals... (Update)
Context of citations to this paper: More
.... Parallel algorithmics has undergone major developments in the last few years (for brevity, we reference here only [Ja] and [Vi94]) So parallel algorithms and techniques for many problems already exist. In any case, the development of a new parallel algorithm is of...
Cited by: More
Can Parallel Algorithms Enhance Serial Implementation? (Extended.. - Vishkin (1996)
(Correct)
Active bibliography (related documents): More All
1.7: Structural Parallel Algorithmics - Vishkin (1991)
(Correct)
1.1: On Parallel Hashing and Integer Sorting - Matias, Vishkin (1991)
(Correct)
0.5: Two Computer Systems Paradoxes: Serialize-to-Parallelize, and.. - Orni, Vishkin (1995)
(Correct)
Similar documents based on text: More All
0.3: Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994)
(Correct)
0.3: Optimal Doubly Logarithmic Parallel Algorithms Based On .. - Berkman, Schieber.. (1993)
(Correct)
0.3: Converting High Probability into Nearly-Constant Time - with.. - Matias, Vishkin (1991)
(Correct)
BibTeX entry: (Update)
U. Vishkin. Thinking in Parallel: Some Basic DataParallel Algorithms and Techniques. Monograph, in preparation. http://citeseer.ist.psu.edu/vishkin02thinking.html More
@misc{ vishkin-thinking,
author = "U. Vishkin",
title = "Thinking in Parallel: Some Basic DataParallel Algorithms and Techniques",
text = "U. Vishkin. Thinking in Parallel: Some Basic DataParallel Algorithms and
Techniques. Monograph, in preparation.",
url = "citeseer.ist.psu.edu/vishkin02thinking.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
268
Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
227
Parallel merge sort (context) - Cole - 1988
218
Parallelism in random access machines (context) - Fortune, Wyllie - 1978
206
Vector Models for Data-Parallel Computing (context) - Blelloch - 1991
201
Parallel prefix computation (context) - Ladner, Fischer - 1980
200
Data parallel algorithms (context) - Hillis, Steele - 1986
174
The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
159
The NYU Ultracomputer - designing an MIMD shared memory para.. (context) - Gottlieb, Grishman et al. - 1983
141
Synthesis of Parallel Algorithms (context) - Reif - 1993
135
Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
130
Implementation of a portable nested data-parallel language
- Blelloch, Chatterjee et al. - 1972
125
On uniform circuit complexity (context) - Ruzzo - 1981
112
Randomized and deterministic simulations of PRAMs by paralle.. (context) - Mehlhorn, Vishkin - 1984
79
Parallelism in comparison problems (context) - Valiant - 1975
77
parallel connectivity algorithm (context) - Shiloach, Vishkin et al. - 1982
77
Oxford University Press (context) - Metcalf, Reid et al. - 1990
75
Deterministic coin tossing with applications to optimal para.. (context) - Cole, Vishkin - 1986
70
A simple parallel tree contraction algorithm (context) - Abrahamson, Dadoun et al. - 1989
56
Towards a theory of nearly constant time parallel algorithms (context) - Gil, Matias et al. - 1991
47
Parallel symmetry-breaking in sparse graphs
- Goldberg, Plotkin et al. - 1987
47
Part I: the basic technique with applications to optimal par.. (context) - Cole, Vishkin et al. - 1988
47
The Complexity of Parallel Computations (context) - Wyllie - 1979
45
Optimal and sublogarithmic time randomized parallel sorting ..
- Rajasekaran, Reif - 1989
44
Optimal parallel evaluation of treestructured computations b.. (context) - Kosaraju, Delcher - 1988
40
Faster optimal parallel prefix sums and list ranking (context) - Cole, Vishkin - 1989
38
Finding biconnected components and computing tree functions .. (context) - Tarjan, Vishkin - 1985
38
Simulation of parallel random access machines by circuits (context) - Stockmeyer, Vishkin - 1984
36
Efficient parallel algorithms for some graph problems (context) - Chin, Lam et al. - 1982
31
Computing connected components on parallel computers (context) - Hirschberg, Chandra et al. - 1979
31
Parallel dictionaries on 2-3 trees (context) - Paul, Vishkin et al. - 1983
30
Parallel algorithmic techniques for combinatorial computatio..
- Eppstein, Galil - 1988
27
New connectivity and MSF algorithms for Ultracomputer and PR.. (context) - Awerbuch, Shiloach - 1987
27
parallel max-flow algorithm (context) - Shiloach, Vishkin et al. - 1982
26
Radix sort of vector multiprocessors
- Zagha, Blelloch - 1991
26
The accelerated centroid decomposition technique for optimal..
- Cole, Vishkin - 1988
25
and sorting in a parallel computation model (context) - Shiloach, Vishkin et al. - 1981
24
Using approximation algorithms to design parallel algorithms.. (context) - Goodrich - 1991
23
Optimal doubly logarithmic parallel algorithms based on find..
- Berkman, Schieber et al. - 1993
23
ACM Transactions on Programming Languages and Systems (context) - Schwartz - 1980
20
A unified approach to models of synchronous parallel machine.. (context) - Goldschlager - 1978
18
Randomized speed-ups in parallel computations (context) - Vishkin - 1984
17
Parallel Complexity Theory (context) - Parberry - 1987
17
A parallel-design distributed-implementation (context) - Vishkin - 1984
16
A fast probabilistic parallel sorting algorithm (context) - Reischuk - 1981
13
and sorting in parallel computation (context) - Kruskal, merging - 1983
11
An optimal parallel dictionary (context) - Dietzfelbinger, auf - 1989
11
Structural parallel algorithmics
- Vishkin - 1991
10
Parallel algorithms for the transitive closure and the conne.. (context) - Hirschberg - 1976
10
Parallel tridiagonal equation solvers (context) - Stone - 1975
10
Parallel tree contraction part 1: fundamentals (context) - Miller, Reif - 1989
7
Optimal parallel algorithms for list ranking (context) - Anderson, Miller - 1988
5
Computer and System Sciences (context) - Borodin, Hopcroft et al. - 1985
4
Parallel minimax search for a maximum (context) - Karp, Miranker - 1968
3
An optimal parallel connectivity algorithm (context) - Vishkin - 1984
3
the evaluation of certain arithmetic expressions (context) - Winograd - 1975
2
and algorithm (context) - Hoare, partition - 1961
2
Parallel Processing Using Depth-First Search and BreadthFirs.. (context) - Eckstein - 1977
2
On choice of a model of parallel computation (context) - Vishkin - 1983
1
Datalogforeningen (context) - Vishkin, computation et al. - 1987
1
Deterministic coin tossing and accelating cascades: micro an.. (context) - Cole, Vishkin - 1986
1
An optimal algorithm for selection (context) - Vishkin - 1987
1
A Study of Parallelism in Graph Theory (context) - Arjomandi - 1975
Documents on the same site (http://www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/papers.html): More
From Algorithm Parallelism to Instruction-Level Parallelism: An.. - Vishkin (1997)
(Correct)
Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994)
(Correct)
Two Computer Systems Paradoxes: Serialize-to-Parallelize, and.. - Orni, Vishkin (1995)
(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