(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. Utilizing a new graph-theoretic model of multithreaded computation,
execution efficiency is quantified by three important measures: T 1 is the time required for executing
the computation on 1 processor, T1 is the time required by an infinite number of processors, and
S 1 is the space... (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):
68.4%: Space-Efficient Scheduling of Multithreaded Computations - Blumofe, Leiserson (1998)
(Correct)
37.2%: Space-Efficient Scheduling of Multithreaded Computations.. - Blumofe, Leiserson (1993)
(Correct)
32.1%: Managing Storage for Multithreaded Computations - Robert Blumofe (1992)
(Correct)
Active bibliography (related documents): More All
0.3: The Cilk System for Parallel Multithreaded Computing - Joerg (1996)
(Correct)
0.2: Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994)
(Correct)
0.2: Fine-grain Parallelism with Minimal Hardware.. - Culler, Sah.. (1991)
(Correct)
Similar documents based on text: More All
0.2: Provably Efficient Scheduling for Languages with.. - Blelloch, Gibbons.. (1995)
(Correct)
0.2: A new competitive analysis of randomized caching (Extended.. - Law, Leiserson
(Correct)
0.2: Thread Scheduling for Multiprogrammed Multiprocessors - Arora, Blumofe, Plaxton (2001)
(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
234
Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
230
Cilk: An efficient multithreaded runtime system
- Blumofe, Joerg et al. - 1995
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
173
Lazy task creation: A technique for increasing the granulari..
- Mohr, Kranz et al. - 1991
170
Bounds for certain multiprocessing anomalies (context) - Graham - 1966
149
Multicomputers: Message-passing concurrent computers (context) - Athas, Seitz - 1988
127
A multithreaded massively parallel architecture (context) - Nikhil, Papadopoulos - 1992
72
MASA: A multithreaded processor architecture for parallel sy.. (context) - Halstead, Fujita - 1988
65
von Neumann hybrid architecture (context) - Iannucci, dataflow - 1988
61
Department of Electrical Engineering and Computer Science (context) - Blumofe, for et al. - 1992
58
WorkCrews: An abstraction for controlling parallelism (context) - Vandevoorde, Roberts - 1988
53
Processor coupling: Integrating compile time and runtime sch..
- Keckler, Dally - 1992
52
A simple load balancing scheme for task allocation in parall..
- Rudolph, Slivkin-Allalouf et al. - 1991
49
Can dataflow subsume von Neumann computing (context) - Nikhil - 1989
49
Resource requirements of dataflow programs (context) - Culler - 1988
49
A randomized parallel branch-and-bound procedure (context) - Karp, Zhang - 1988
46
Architecture of a message-driven processor (context) - Dally, Chao et al. - 1987
45
Multithreading: A revisionist view of dataflow architectures
- Papadopoulos, Traub - 1991
43
Scheduling large-scale parallel computations on networks of ..
- Blumofe, Park - 1994
38
Optimal speedup for backtrack search on a butterfly network (context) - Ranade - 1991
36
Executing functional programs on a virtual tree of processor.. (context) - Burton, Sleep - 1981
36
Space-efficient scheduling of multithreaded computations
- Blumofe, Leiserson - 1993
35
Improved multithreading techniques for hiding communication .. (context) - Boothe, Ranade - 1992
32
Branch-and-bound and backtrack search on mesh-connected arra..
- Kaklamanis, Persiano - 1992
28
Sequential Implementation of Lenient Programming Languages (context) - Traub - 1988
26
Dynamic tree embeddings in butterflies and hypercubes (context) - Leighton, Newman et al. - 1989
25
Concurrent Smalltalk on the message-driven processor (context) - Horwat - 1991
23
Game tree search on a massively parallel system
- Feldmann, Mysliwietz et al. - 1993
22
Control of parallelism in the Manchester dataflow machine (context) - Ruggiero, Sargeant - 1987
21
A customizable substrate for concurrent languages
- Jagannathan, Philbin - 1992
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
15
Department of Electrical Engineering and Computer Science (context) - Kuszmaul, Computing et al. - 1994
12
Tight bounds for on-line tree embeddings
- Bhatt, Greenberg 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
4
SIAM Journal on Applied Mathematics (context) - multiprocessing, anomalies - 1969
1
Department of Electrical Engineering and Computer Science (context) - Parallelism, Scientific et al. - 1990
1
Department of Electrical Engineering and Computer Science (context) - Programs, PhD - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/multi/papers.html): More
Executing Multithreaded Programs Efficiently - Blumofe (1995)
(Correct)
Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994)
(Correct)
Cilk: An Efficient Multithreaded Runtime System - Blumofe, Joerg, Kuszmaul.. (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