Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Journal of Parallel and Distributed Computing
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Effective distributed scheduling of parallel workloads
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Analysis of Non-Work-Conserving Processor Partitioning Policies
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
ESP: a system utilization benchmark
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Highly efficient gang scheduling implementation
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Improving Parallel Job Scheduling Using Runtime Measurements
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Coscheduling in Clusters: Is It a Viable Alternative?
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A runtime resolution scheme for priority boost conflict in implicit coscheduling
The Journal of Supercomputing
A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters
The Journal of Supercomputing
GridRod: a dynamic runtime scheduler for grid workflows
Proceedings of the 21st annual international conference on Supercomputing
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Fuzzy expert system for load balancing in symmetric multiprocessor systems
Expert Systems with Applications: An International Journal
Reuse distance based performance modeling and workload mapping
Proceedings of the 9th conference on Computing Frontiers
Static and dynamic job scheduling with communication aware policy in cluster computing
Computers and Electrical Engineering
| Hi-index | 0.00 |
Gang scheduling provides both space-slicing and time-slicing of computer resources for parallel programs. Each thread of execution from a parallel job is concurrently scheduled on an independent processor in order to achieve an optimal level of program performance. Time-slicing of parallel jobs provides for better overall system responsiveness and utilization than otherwise possible. Lawrence Livermore National Laboratory has deployed three generations of its gang scheduler on a variety of computing platforms. Results indicate the potential benefits of this technology to parallel processing are no less significant than time-sharing was in the 1960's.