(Enter summary)
Abstract: High performance applications on shared memory machines have been typically written
in a coarse grained style, with one heavyweight thread per processor. In comparison,
programming with a large number of lightweight, parallel threads has several advantages,
including simpler coding for programs with irregular and dynamic parallelism, and better
adaptability to a changing number of processors. The programmer can express a new
thread to execute each individual parallel task; the... (Update)
Context of citations to this paper: More
.... [11, 8, 27] The automatic construction of threads of appropriate granularity is currently being investigated by several researchers [26, 19]. In Fig. 4(c) we show a decomposition of the total work into four parallel threads T 1 ; T 4 . In this decomposition the body of the...
.... switch time (of a thread) is approximately 8 microseconds, scaled for a 200 megahertz SPARC processor from the results by Narlikar [8]. The checkpoint time and the context switch time have roughly the same order of magnitude. 7.6. Establishing Checkpoints 1. timer...
Cited by: More
Low-Contention Depth-First Scheduling of Parallel Computations.. - Fatourou (2001)
(Correct)
Scheduling Threads for Low Space Requirement and Good Locality - Narlikar (1999)
(Correct)
Pthread Benefits and Annoyances experiencied parallelizing a Sparse .. - May (1999)
(Correct)
Similar documents (at the sentence level):
41.2%: Pthreads for Dynamic Parallelism - Narlikar, Blelloch (1998)
(Correct)
Active bibliography (related documents): More All
0.7: Space-Efficient Scheduling of Nested Parallelism - Narlikar, Blelloch (1999)
(Correct)
0.5: Space-Efficient Implementation of Nested Parallelism - Narlikar, Blelloch (1996)
(Correct)
0.5: An Overview of Multimedia Content Protection in Consumer.. - Eskicioglu, Delp (2000)
(Correct)
Similar documents based on text: More All
0.4: LegoSim: Simulation of Embedded Kernels over Pthreads - Röblitz, Bühn, Mueller
(Correct)
0.2: Space-Efficient Scheduling of Parallelism with.. - Blelloch, Gibbons, .. (1997)
(Correct)
0.2: Provably Efficient Scheduling for Languages with.. - Blelloch, Gibbons.. (1995)
(Correct)
Related documents from co-citation: More All
7: Provably efficient scheduling for languages with fine-grained parallelism
- BLELLOCH, GIBBONS et al. - 1995
6: Implementation of a portable nested data-parallel language
- Blelloch, Chatterjee et al. - 1994
6: Resource requirements of dataflow programs (context) - Culler - 1988
BibTeX entry: (Update)
G. J. Narlikar and G. E. Blelloch. Pthreads for dynamic and irregular parallelism. In Proc. of Supercomputing'98, November 1998. http://citeseer.ist.psu.edu/narlikar98pthreads.html More
@inproceedings{ narlikar98pthreads,
author = "Girija J. Narlikar",
title = "{Pthreads} for Dynamic and Irregular Parallelism",
pages = "??--??",
year = "1998",
url = "citeseer.ist.psu.edu/narlikar98pthreads.html" }
Citations (may not include all citations):
2177
Programs for Machine Learning (context) - Quinlan - 1993
1359
Induction of decision trees (context) - Quinlan - 1986
304
Scheduler activations: effective kernel support for the user..
- Anderson, Bershad et al. - 1991
257
force calculation algorithm (context) - Barnes, Hut et al. - 1986
230
Cilk: An efficient multithreaded runtime system
- Blumofe, Joerg et al. - 1996
191
The rapid evaluation of potential fields in particle systems (context) - Greengard - 1987
190
Process control and scheduling issues for multiprogrammed sh.. (context) - Tucker, Gupta - 1989
173
Lazy task creation: A technique for increasing the granulari..
- Mohr, Kranz et al. - 1990
141
PRESTO : A system for object-oriented parallel programming (context) - Bershad, Lazowska et al. - 1988
122
Multilisp: A language for concurrent symbolic computation (context) - Halstead - 1985
115
First-class user-level threads
- Marsh, Scott et al. - 1991
64
SunOS multi-thread architecture
- Powell, Kleiman et al. - 1991
64
An algorithm for the machine computation of complex fourier .. (context) - Cooley, Tukey - 1965
58
WorkCrews: an abstraction for controlling parallelism (context) - Vandevoorde, Roberts - 1988
52
A simple load balancing scheme for task allocation in parall..
- Rudolph, Slivkin-Allalouf et al. - 1991
51
Data locality and load balancing in COOL
- Chandra, Gupta et al. - 1993
49
Resource requirements of dataflow programs (context) - Culler, Arvind - 1988
45
Parallel data mining for association rules on shared-memory ..
- Zaki, Ogihara et al. - 1996
43
Implementing lightweight threads
- Stein, Shah - 1992
42
Auto-blocking matrix-multiplication or tracking BLAS3 perfor..
- Frens, Wise - 1997
39
Provably efficient scheduling for languages with fine-graine..
- Blelloch, Gibbons et al. - 1995
31
Thread scheduling for cache locality
- Philbin, Edler et al. - 1996
28
Parallel visualization algorithms: Performance and architect.. (context) - Singh, Gupta et al. - 1994
26
Massachusetts Institute of Technology (context) - Frigo, Johnson et al. - 1997
24
Large-scale Simulation of Elastic Wave Propagation in Hetero.. (context) - Bao, Bielak et al. - 1998
22
Control of parallelism in the manchester dataflow machine (context) - Ruggiero, Sargeant - 1987
21
Earthquake Ground Motion Modeling on Parallel Computers
- Bao, Bielak et al. - 1996
21
A customizable substrate for concurrent languages
- Jagannathan, Philbin - 1992
20
Enabling primitives for compiling parallel languages
- Goldstein, Schauser et al. - 1995
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
Space-efficient implementation of nested parallelism
- Narlikar, Blelloch - 1997
15
Space efficient execution of deterministic parallel programs (context) - Burton, Simpson - 1994
14
Storage management in virtual tree machines (context) - Burton - 1988
14
locality management in sharedmemory multiprocessor (context) - Markatos, Blanc et al. - 1992
14
The performance implications of locality information usage i..
- Bellosa, Steckermeier - 1996
11
A practical comparison of n-body algorithms
- Blelloch, Narlikar - 1997
11
Whole-program optimization for time and space efficient thre..
- Grunwald, Neves - 1996
9
The performance of work stealing in multiprogrammed environm..
- Blumofe, Papadopoulos - 1997
9
Experiments in information retrieval from spoken documents
- Hauptmann, Jones et al. - 1998
9
Load balancing and data locality in adaptive hierarchical N-.. (context) - Singh, Holt et al. - 1995
5
user-level thread library with parallelism and portability (context) - Miyazaki, Sakamoto et al. - 1994
5
Parallel breadth-first BDD construction
- Yang, O'Hallaron - 1997
5
Efficient support for finegrain parallelism on shared memory..
- Lowenthal, Freeh et al. - 1996
4
Parallel programming based on continuationpassing thread (context) - Halbherr, Zhou et al. - 1994
4
A framework for space and time efficient scheduling of paral..
- Narlikar, Blelloch - 1996
4
Numerical methods for the study of star cluster dynamics (context) - Aarseth, Henon et al. - 1974
4
Piecewise execution of nested dataparallel programs
- Palmer, Prins et al. - 1996
3
Molecular dynamics simulation of large-scale carbon nanotube.. (context) - Srivastava, Barnard - 1997
3
Strands: An efficient and extensible thread management archi..
- Sirer, Pardyak et al. - 1997
2
Parallel hierarchical molecular structure estimation
- Chen, Singh et al. - 1996
2
available at http://www (context) - Corporation, decthreads - 1997
1
Pthreads for dynamic parallelism
- Narlikar, Blelloch - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucsb.edu/~tyang/class/240b99f/refer.html):
The Globus Project: A Status Report - Foster, Kesselman (1998)
(Correct)
Scheduling with Implicit Information in Distributed.. - Arpaci-Dusseau, Culler.. (1998)
(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