Guy E. Blelloch, Phillip B. Gibbons  Home/Search
Context Related
| math.tau.ac.il/~matias/p...BGM98jacm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~matias/recent (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. A common concern in executing such programs is to schedule tasks to processors dynamically so as to minimize not only the execution time, but also the amount of space (memory) needed. Without careful... (Update)
Context of citations to this paper: More
...in parallel, and it can synchronize with other currently executing threads. In most of the work in the literature [1, 4, 5, 6, 7, 9, 15, 16, 24, 25, 26, 27], a multithreaded computation is modeled as a directed acyclic graph (see Figure 1(a) Of much concern is how a...
...threads. Since creating n threads could take more than constant time on p processors, they are created lazily using a stub as described in [8] threads are expanded when taken from S instead of when inserted. For each block of p or less threads that are scheduled from the set...
Cited by: More
Thread Scheduling for Multiprogrammed Multiprocessors - Arora, Blumofe, Plaxton (2001) (Correct)
SUDS: Automatic Parallelization for Raw Processors - Frank (2003) (Correct)
Athapascan-1: Parallel Programming with Asynchronous Tasks - Cavalheiro.. (1998) (Correct)
Similar documents (at the sentence level):
67.2%: Provably Efficient Scheduling for Languages with.. - Blelloch, Gibbons.. (1995) (Correct)
Active bibliography (related documents): More All
0.6: An Effective Load Balancing Policy for Geometric Decaying.. - Gil, Matias (1996) (Correct)
0.5: Efficient Low-Contention Parallel Algorithms - Gibbons (1994) (Correct)
0.5: Minimizing Redundant Dependencies and Interprocessor.. - Chao, Harper (1994) (Correct)
Similar documents based on text: More All
0.6: Effectively Sharing a Cache Among Threads - Guy Blelloch Carnegie (Correct)
0.4: Distributed Streams Algorithms for Sliding Windows - Gibbons, Tirthapura (2002) (Correct)
0.4: Space-Efficient Scheduling of Parallelism with.. - Blelloch, Gibbons, .. (1997) (Correct)
Related documents from co-citation: More All
25: Cilk: An Efficient Multithreaded Runtime System - Blumofe, Joerg et al. - 1995
20: Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
16: Programming Parallel Algorithms - Blelloch - 1996
BibTeX entry: (Update)
BLELLOCH, G. E., GIBBONS, P. B., AND MATIAS, Y. Provably efficient scheduling for languages with fine-grained parallelism. In Proceedings of the 1995 ACM Symposium on Parallel Algorithms and Architectures (Santa Barbara, July 1995), pp. 420--430. http://citeseer.ist.psu.edu/article/blelloch95provably.html More
@inproceedings{ blelloch95provably,
author = "Guy E. Blelloch and Phillip B. Gibbons and Yossi Matias",
title = "Provably Efficient Scheduling for Languages with Fine-Grained Parallelism",
booktitle = "Proc. 7th Annual {ACM} Symposium on Parallel Algorithms and Architectures {SPAA}'95",
address = "Santa Barbara, California",
pages = "1--12",
year = "1995",
url = "citeseer.ist.psu.edu/article/blelloch95provably.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
835 High Performance Fortran Language Specification - Fortran - 1993
234 Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
234 General purpose parallel architectures (context) - Valiant - 1990
230 CILK: An efficient multithreaded runtime system - Blumofe, Joerg et al. - 1995
219 Bounds on multiprocessing timing anomalies (context) - Graham - 1969
206 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
196 How to emulate shared memory (context) - Ranade - 1991
174 The parallel evaluation of general arithmetic expressions (context) - Brent - 1974
170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
141 A Synthesis of Parallel Algorithms (context) - Reif - 1993
130 Implementation of a portable nested data-parallel language - Blelloch, Chatterjee et al. - 1994
116 Towards an architecture-independent analysis of parallel alg.. (context) - Papadimitriou, Yannakakis - 1988
115 Scans as primitive parallel operations - Blelloch - 1989
111 Computer and Job-Shop Scheduling Theory (context) - Coffman - 1976
90 Randomized routing and sorting on fixed-connection networks - Leighton, Maggs et al. - 1994
78 An overview of the PTRAN analysis system for multiprocessing (context) - Allen, Burke et al. - 1988
62 An analysis of dag-consistent distributed shared-memory algo.. - Blumofe, Frigo et al. - 1996
56 The Paralation Model: Architecture-Independent Parallel Prog.. (context) - Sabot - 1988
56 Towards a theory of nearly constant time parallel algorithms (context) - Gil, Matias et al. - 1991
49 Resource requirements of dataflow programs (context) - Culler - 1988
47 Converting high probability into nearly-constant time---with.. - Matias, Vishkin - 1991
37 Prototyping parallel and distributed programs in Proteus - Mills, Nyland et al. - 1990
36 Spaceefficient scheduling of multithreaded computations - Blumofe, Leiserson - 1993
36 Executing functional programs on a virtual tree of processor.. (context) - Burton, Sleep - 1981
31 The incremental garbage collection of processes - Baker, Hewitt - 1977
31 Parallel dictionaries on 2-3 trees (context) - Paul, Vishkin et al. - 1983
30 A communication-time tradeoff (context) - Papadimitriou, Ullman - 1987
28 Low-overhead scheduling of nested parallelism (context) - Hummel, Schonberg - 1991
24 Using approximation algorithms to design parallel algorithms.. (context) - Goodrich - 1991
22 Control of parallelism in the Manchester dataflow machine (context) - Ruggiero, Sargeant - 1987
22 Dynamic processor self-scheduling for general parallel neste.. (context) - Fang, Tang et al. - 1990
20 Optimal deterministic approximate parallel prefix sums and t.. - Goldberg, Zwick - 1995
19 Space-efficient scheduling of parallelism with synchronizati.. - Blelloch, Gibbons et al. - 1997
19 A provable time and space efficient implementation of NESL - Blelloch, Greiner - 1996
19 Istructures: Data structures for parallel computing (context) - Arvind, Nikhil - 1989
19 Fast deterministic processor allocation (context) - Hagerup - 1993
18 Portable parallel programming in HPC (context) - Beckman, Gannon et al. - 1996
18 On time versus space (context) - Hopcroft, Paul et al. - 1977
18 Fast hashing on a PRAM---designing by expectation (context) - Gil, Matias - 1991
16 Spaceefficient implementation of nested parallelism - Narlikar, Blelloch - 1997
15 Space efficient execution of deterministic parallel programs (context) - Burton, Simpson - 1994
14 Parallelism in sequential functional languages - Blelloch, Greiner - 1995
14 Storage management in virtual tree machines (context) - Burton - 1988
14 Fast parallel space allocation (context) - Hagerup - 1991
14 Highly Parallel Randomized Algorithmics (context) - Matias - 1992
11 A foundation for an efficient multi-threaded Scheme system (context) - Jagannathan, Philbin - 1992
11 Optimal parallel approximation algorithms for prefix sums an.. - Goodrich, Matias et al. - 1994
10 Efficient compilation of high-level data parallel algorithms - Suciu, Tannen - 1994
8 Parallelism in spacetime tradeoffs (context) - Savage, Vitter - 1984
7 A new pebble game that characterizes parallel complexity cla.. (context) - Venkateswaran, Tompa - 1989
4 Guaranteeing good memory bounds for parallel programs (context) - Burton - 1996
4 An effective load balancing policy for geometric decaying al.. - Gil, Matias - 1996
3 Renaming and dispersing: Techniques for fast load balancing (context) - Gil - 1994
3 of Parallel and Distributed Computing (context) - Feo, Cann et al. - 1990
2 Applications of uet scheduling theory to the implementation .. (context) - Burton, McKeown et al. - 1990
2 PREFACE-2: Supporting nested parallelism in Fortran (context) - Bernstein - 1988
1 PCF programming model and FORTRAN bindings (context) - Leasure - 1989
1 Speedups of deterministic machines by synchronous parallel m.. (context) - Venkateswaran, Tompa - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~matias/recent.html): More
Triply-Logarithmic Parallel Upper and Lower Bounds for.. - Berkman, Matias, Ragde (1998) (Correct)
[MPS92] C. Martel, A. Park, and R. Subramonian. Work-optimal.. - Siam Journal (Correct)
An Effective Load Balancing Policy for Geometric Decaying.. - Gil, Matias (1996) (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