(Enter summary)
Abstract: this paper
investigates several design choices and their performance
implications. Processor fragmentation could potentially
negate all the benefits of gang scheduling. That is,
because gang scheduling demands that no thread execute
unless all other gang member threads execute, then some
processors may be idle even when there are threads waiting
to be run. Our results show that no more than 5 to 25%
of the processing power is lost to fragmentation. This result
means that neither optimal packing ... (Update)
Context of citations to this paper: More
...long jobs benefit substantially from this approach, but only at the cost of longer response times for short jobs. Feitelson and Rudolph [23] and Hori et al. 36] analyze a more flexible policy in which there is time slicing among multiple active sets of partitions. Lee et al....
...time. Subsequent work has generalized and refined the coscheduling (now often called gang scheduling) concept [5, 6, 8, 9, 11, 14, 15, 19, 23, 24, 25, 26]. Gang scheduling schemes are a practical result of the multiprocessor scheduling community and have been adapted for...
Cited by: More
Reconfigurable Gang Scheduling Algorithm - Goes, Martins
(Correct)
Improving Gang Scheduling through - Job Performance Analysis (2001)
(Correct)
The Effect of Correlating Quantum Allocation and Job Size.. - Ghare, Leutenegger (1999)
(Correct)
Similar documents (at the sentence level):
79.1%: Evaluation of Design Choices for Gang Scheduling using.. - Feitelson, Rudolph (1996)
(Correct)
Active bibliography (related documents): More All
0.7: Job Scheduling in Multiprogrammed Parallel Systems - Feitelson (1997)
(Correct)
0.3: Coscheduling Based on Run-Time Identification of Activity.. - Feitelson, Rudolph
(Correct)
0.2: Packing Schemes for Gang Scheduling - Feitelson (1996)
(Correct)
Similar documents based on text: More All
0.7: Paired Gang Scheduling - Wiseman, Feitelson (2001)
(Correct)
0.6: Efficient Parallel Job Scheduling Using Gang Service - Silva
(Correct)
0.6: Concurrent Gang: Towards a Flexible and Scalable Gang.. - Fabricio Alves Barbosa
(Correct)
Related documents from co-citation: More All
20: Scheduling Techniques for Concurrent Systems (context) - Ousterhout - 1982
18: Gang scheduling performance benefits for fine-grain synchronization (context) - Feitelson, Rudolph - 1992
17: Distributed Hierarchical Control for Parallel Processing (context) - Feitelson, Rudolph - 1990
BibTeX entry: (Update)
D. G. Feitelson and L. Rudolph, "Evaluation of design choices for gang scheduling using distributed hierarchical control". J. Parallel & Distributed Comput. 35(1), pp. 18--34, May 1996. http://citeseer.ist.psu.edu/feitelson96evaluation.html More
@article{ feitelson96evaluation,
author = "Dror G. Feitelson and Larry Rudolph",
title = "Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control",
journal = "Journal of Parallel and Distributed Computing",
volume = "35",
number = "1",
pages = "18--34",
year = "1996",
url = "citeseer.ist.psu.edu/feitelson96evaluation.html" }
Citations (may not include all citations):
266
Adaptive load sharing in homogeneous distributed systems (context) - Eager, Lazowska et al. - 1986
157
How to write parallel programs: a guide to the perplexed (context) - Carriero, Gelernter - 1989
120
Speedup versus efficiency in parallel systems (context) - Eager, Zahorjan et al. - 1989
115
Reevaluating Amdahl's law (context) - Gustafson - 1988
106
Job characteristics of a production parallel scientific work..
- Feitelson, Nitzberg - 1995
99
Gang scheduling performance benefits for fine-grain synchron.. (context) - Feitelson, Rudolph - 1992
83
Distributed hierarchical control for parallel processing (context) - Feitelson, Rudolph - 1990
67
Approximation algorithms for bin-packing---An updated survey (context) - Coffman, Jr et al. - 1984
61
A tightly coupled processor-network interface
- Henry, Joerg - 1992
41
frameworks and refinement (context) - Campbell, Islam et al. - 1992
39
A survey of scheduling in multiprogrammed parallel systems (context) - Feitelson
18
multipleprocessor scheduling framework for IRIX (context) - Barton, Bitar - 1995
18
Mapping and scheduling in a shared parallel environment usin.. (context) - Feitelson, Rudolph - 1990
16
Time sharing massively parallel machines (context) - Gorda, Wolski - 1995
14
Wasted resources in gang scheduling (context) - Feitelson, Rudolph - 1990
12
Bin packing with divisible item sizes (context) - Coffman, Jr et al. - 1987
9
A scalable time-sharing scheduling for partitionable (context) - Hori, Ishikawa et al.
9
The Xylem operating system (context) - Emrath, Anderson et al. - 1991
8
NETRA:A hierarchical and partitionable architecture for comp.. (context) - Choudhary, Patel et al. - 1993
7
An analysis of response ratio scheduling (context) - Hansen - 1971
5
Time sharing in hypercube multiprocessors (context) - Filho, Barbosa - 1992
5
An introduction to combinatorial models of dynamic storage a.. (context) - Coffman - 1983
2
A tightly coupled and hierarchical multiprocessor architectu.. (context) - ndler, Bode et al. - 1985
1
Scheduling multiprocessor tasks to minimize schedule length (context) - az, Drabowski et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/~feit/pub.html): More
Communicators: Object-Based Multiparty Interactions for Parallel .. - Feitelson (1991)
(Correct)
The BoW Project - Feitelson
(Correct)
Limitations on Optical Free-Space Crossbar-Like.. - Feitelson, Rudolph.. (1990)
(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