Girija J. Narlikar  Home/Search
Context Related
| cmu.edu/~scandal/pa...CMUCS99121.pdf 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: cmu.edu/~scandal/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The running time and memory requirement of a parallel program with dynamic, lightweight threads depends heavily on the underlying thread scheduler. In this paper, we present a simple, asynchronous, space-efficient scheduling algorithm for shared memory machines that combines the low scheduling overheads and good locality of work stealing with the low space requirements of depth-first schedulers. For a nested-parallel program with depth and serial space requirement , we show that the... (Update)
Context of citations to this paper: More
.... Narlikar showed that work stealing improves the performance of space efficient multithreaded applications by increasing the data locality [29]. None of this previous work, however, has studied upper or lower bounds on the data locality of multithreaded computations executed...
.... a well known and extremely effective way of understanding the performance of parallel programs [BL94, BJK 95, BJK 96, BGM95, NB97, Nar99] 1.4 Contributions The principal contributions of our work are as follows. ffl We propose a technique for achieving efficient execution...
Cited by: More
Effectively Sharing a Cache Among Threads - Guy Blelloch Carnegie (Correct)
The Data Locality of Work Stealing - Acar, Blelloch, Blumofe (2000) (Correct)
Low-Contention Depth-First Scheduling of Parallel Computations.. - Fatourou (2001) (Correct)
Similar documents (at the sentence level):
59.5%: Scheduling Threads for Low Space Requirement and Good Locality - Narlikar (1999) (Correct)
Active bibliography (related documents): More All
0.8: Pthreads for Dynamic and Irregular Parallelism - Narlikar, Blelloch (1998) (Correct)
0.8: Pthreads for Dynamic Parallelism - Narlikar, Blelloch (1998) (Correct)
0.4: Space-Efficient Scheduling of Nested Parallelism - Narlikar, Blelloch (1999) (Correct)
Similar documents based on text: More All
0.0: BOS is Boss: A Case for Bulk-Synchronous Object Systems - Goudreau, Lang, Narlikar, Rao (Correct)
0.0: Protium, an Infrastructure for Partitioned Applications - Young, Y.N., Szymanski.. (2001) (Correct)
0.0: A Framework for Space and Time Efficient Scheduling of.. - Narlikar, Blelloch (1996) (Correct)
Related documents from co-citation: More All
6: Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
5: Provably efficient scheduling for languages with fine-grained parallelism - BLELLOCH, GIBBONS et al. - 1995
5: An analysis of dag-consistent distributed shared-memory algorithms - Blumofe, Frigo et al. - 1996
BibTeX entry: (Update)
G. J. Narlikar. Scheduling threads for low space requirement and good locality. Technical Report CMU-CS-99-121, Computer Science Department, Carnegie Mellon University, 1999. http://citeseer.ist.psu.edu/article/narlikar99scheduling.html More
@inproceedings{ narlikar99scheduling,
author = "Girija J. Narlikar",
title = "Scheduling Threads for Low Space Requirement and Good Locality",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "83-95",
year = "1999",
url = "citeseer.ist.psu.edu/article/narlikar99scheduling.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1992
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
835 High performance fortran language specification vertion - Fortran - 1993
230 Cilk: An efficient multithreaded runtime system - Blumofe, Joerg et al. - 1996
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. - 1990
168 A taxonomy of problems with fast parallel algorithms (context) - Cook - 1985
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
130 Implementation of a portable nested data-parallel language - Blelloch, Chatterjee et al. - 1994
122 Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
120 The performance implications of thread management alternativ.. (context) - Anderson, Lazowska et al. - 1989
81 The implementation of the Cilk-5 multithreaded language - Frigo, Leiserson et al. - 1998
67 compositional parallel programming (context) - Chandy, Kesselman - 1992
66 A High-Performance Parallel Lisp (context) - Kranz, Halstead et al. - 1989
64 SunOS multi-thread architecture - Powell, Kleiman et al. - 1991
62 An analysis of dag-consistent distributed shared-memory algo.. - Blumofe, Frigo et al. - 1996
58 WorkCrews: an abstraction for controlling parallelism (context) - Vandevoorde, Roberts - 1988
51 Data locality and load balancing in COOL - Chandra, Gupta et al. - 1993
49 Resource requirements of dataflow programs (context) - Culler, Arvind - 1988
49 A randomized parallel branchand -bound procedure (context) - Karp, Zhang - 1988
45 Thread scheduling for multiprogrammed multiprocessors - Arora, Blumofe et al. - 1998
43 Parallel visualization algorithms: Performance and architect.. (context) - Singh, Gupta et al. - 1994
43 Implementing lightweight threads - Stein, Shah - 1992
39 Provably efficient scheduling for languages with fine-graine.. - Blelloch, Gibbons et al. - 1995
37 Prototyping parallel and distributed programs in Proteus - Mills, Nyland et al. - 1990
36 Executing functional programs on a virtual tree of processor.. (context) - Burton, Sleep - 1981
31 Thread scheduling for cache locality - Philbin, Anshus et al. - 1996
26 Massachusetts Institute of Technology (context) - Frigo, Johnson et al. - 1997
22 Control of parallelism in the manchester dataflow machine (context) - Ruggiero, Sargeant - 1987
21 Filaments: Efficient support for fine-grain parallelism - Engler, Andrews et al. - 1993
20 Enabling primitives for compiling parallel languages - Goldstein, Schauser et al. - 1995
19 Space-efficient scheduling of parallelism with synchronizati.. - Blelloch, Gibbons et al. - 1997
18 Spark98: Sparse matrix kernels for shared memory and message.. - O'Hallaron - 1997
16 The SPLASH-2 programs: Characteriation and methodological co.. (context) - Woo, Ohara et al. - 1995
16 Runtime mechanisms for efficient dynamic multithreading - Karamcheti, Plevyak et al. - 1996
16 Space-efficient implementation of nested parallelism - Narlikar, Blelloch - 1997
15 Space efficient execution of deterministic parallel programs (context) - Simpson, Burton - 1999
14 The performance implications of locality information usage i.. - Bellosa, Steckermeier - 1996
14 Studying overheads in massively parallel min/max-tree evalua.. (context) - Feldmann, Mysliwietz et al. - 1994
9 Locality-based scheduling in shared-memory multiprocessors - Markatos, LeBlanc - 1993
9 Pthreads for dynamic and irregular parallelism - Narlikar, Blelloch - 1998
9 Localitybased scheduling in shared-memory multiprocessors - Markatos, LeBlanc - 1993
8 Performance counters and state sharing annotations: a unifie.. (context) - Weissman - 1998
5 user-level thread library with parallelism and portability (context) - Miyazaki, Sakamoto et al. - 1994
4 Space-Efficient Scheduling for Parallel (context) - Narlikar - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~scandal/papers/): More
Collection-Oriented Languages - Sipelstein (1991) (Correct)
Cvl: A C Vector Library - Manual Version 2 - Blelloch, Chatterjee, Hardwick, .. (1993) (Correct)
A Provable Time and Space Efficient Implementation of NESL - Blelloch, Greiner (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