(Enter summary)
Abstract: This paper considers the problem of scheduling dynamic parallel
computations to achieve linear speedup without using
significantly more space per processor than that required
for a single-processor execution. We develop a formal graphtheoretic
model of multithreaded computation and give three
important measures of time and space: T1 is the time required
for executing the computation on 1 processor, T1 is
the time required by an infinite number of processors, and
S1 is the space required to... (Update)
Context of citations to this paper: More
.... Computer Science, Amherst, MA 01003, USA, rsnbrg cs.umass.edu) gorithm designer from the details of specific architectures; cf. [12, 14, 23, 27]. The further difficulties caused by NOWs asynchrony and loose coupling has led to yet more insulating models; cf. 13, 15] for...
...PRAM algorithms with dynamic pipelines. 218 G. E. Blelloch and M. Reid Miller 2. The Model As with the work of Blumofe and Leiserson [12], 13] we model a computation as a set of threads and the cost as the size of the computation DAG. Threads can fork new threads using a...
Cited by: More
Parallel Natural Language Parsing: From Analysis to Speedup - van Lohuizen
(Correct)
Executing Multithreaded Programs Efficiently - Blumofe (1995)
(Correct)
Athapascan-1: Parallel Programming with Asynchronous Tasks - Cavalheiro.. (1998)
(Correct)
Similar documents (at the sentence level):
52.7%: Space-Efficient Scheduling of Multithreaded Computations - Blumofe, Leiserson (1993)
(Correct)
43.9%: Managing Storage for Multithreaded Computations - Robert Blumofe (1992)
(Correct)
Active bibliography (related documents): More All
0.3: Benchmarking Object Databases: Past, Present & Future - Chaudhri, Revell
(Correct)
0.3: Noise Stability of SIS Receivers - Kooi, Chattopadhyay, Thielman.. (2000)
(Correct)
0.2: Dynamic Load Balancing Issues In The Earth Runtime System - Kakulavarapu (1999)
(Correct)
Similar documents based on text: More All
0.2: Space-Efficient Scheduling of Nested Parallelism - Narlikar, Blelloch (1999)
(Correct)
0.2: Provably Efficient Scheduling for Languages with.. - Blelloch, Gibbons.. (1995)
(Correct)
0.1: Analyses of Load Stealing Models Based on Differential Equations - Mitzenmacher (1998)
(Correct)
Related documents from co-citation: More All
20: Scheduling multithreaded computations by work stealing
- Blumofe, Leiserson - 1994
17: Department of Electrical Engineering and Computer Science (context) - Blumofe, Programs et al. - 1995
14: Cilk: An Efficient Multithreaded Runtime System
- Blumofe, Joerg et al. - 1995
BibTeX entry: (Update)
Robert D. Blumofe and Charles E. Leiserson. Spaceefficient scheduling of multithreaded computations. In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing, pages 362--371, San Diego, California, May 1993. http://citeseer.ist.psu.edu/article/blumofe93spaceefficient.html More
@inproceedings{ blumofe93spaceefficient,
author = "Robert D. Blumofe and Charles E. Leiserson",
title = "Space-efficient scheduling of multithreaded computations",
pages = "362--371",
year = "1993",
url = "citeseer.ist.psu.edu/article/blumofe93spaceefficient.html" }
Citations (may not include all citations):
735
A bridging model for parallel computation (context) - Valiant - 1990
595
Active messages: a mechanism for integrated communication an..
- von Eicken, Culler et al. - 1992
218
Probabilistic construction of deterministic algorithms: Appr.. (context) - Raghavan - 1988
212
APRIL: A processor architecture for multiprocessing
- Agarwal, Lim et al. - 1990
174
The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
122
Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
65
von Neumann hybrid architecture (context) - Iannucci, dataflow - 1988
61
Department of Electrical Engineering and Computer Science (context) - Blumofe, for et al. - 1992
52
A simple load balancing scheme for task allocation in parall..
- Rudolph, Slivkin-Allalouf et al. - 1991
49
A randomized parallel branch-and-bound procedure (context) - Karp, Zhang - 1988
49
Resource requirements of dataflow programs (context) - Culler - 1988
46
Architecture of a message-driven processor (context) - Dally, Chao et al. - 1987
38
Optimal speedup for backtrack search on a butterfly network (context) - Ranade - 1991
32
Branchand -bound and backtrack search on mesh-connected arra..
- Kaklamanis, Persiano - 1992
26
Dynamic tree embeddings in butterflies and hypercubes (context) - Leighton, Newman et al. - 1989
22
Control of parallelism in the Manchester dataflow machine (context) - Ruggiero, Sargeant - 1987
21
Thread-based programming for the EM-4 hybrid dataflow machin.. (context) - Sato, Kodama et al. - 1992
18
Parallel Algorithms for Combinatorial Search Problems (context) - Zhang - 1989
12
Tight bounds for on-line tree embeddings
- Bhatt, Greenberg et al. - 1991
10
A fully distributed chess program
- Feldmann, Mysliwietz et al. - 1991
8
Resource management for the tagged token dataflow architectu..
- Culler - 1980
8
The Epsilon-2 hybrid dataflow architecture (context) - Grafe, Hoch - 1990
7
Improved multithreading techniques for hiding communication .. (context) - Boothe, Ranade - 1992
3
Private communication (context) - Kuszmaul - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~runako/papers.html): More
Cilk 3.0 (Alpha 1) Reference Manual - Mit (1995)
(Correct)
Efficient Detection of Determinacy Races in Cilk Programs - Feng, Leiserson (1997)
(Correct)
Cilk-4.1 (Beta 1) Reference Manual - Supercomputing Technologies
(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