The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SimPack: getting started with simulation programming in C and C++
WSC '92 Proceedings of the 24th conference on Winter simulation
Evaluation of design choices for gang scheduling using distributed hierarchical control
Journal of Parallel and Distributed Computing
Stochastic analysis of gang scheduling in parallel and distributed systems
Performance Evaluation
Simulation Model Design and Execution: Building Digital Worlds
Simulation Model Design and Execution: Building Digital Worlds
A Scalable Multi-Discipline, Multiple-Processor Scheduling Framework for IRIX
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Workload Evolution on the Cornell Theory Center IBM SP2
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic vs. Static Quantum-Based Parallel Processor Allocation
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Performance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Overhead Analysis of Preemptive Gang Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Expanding Symmetric Multiprocessor Capability Through Gang Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Metrics and Benchmarking for Parallel Job Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Improving First-Come-First-Serve Job Scheduling by Gang Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic Coscheduling on Workstation Clusters
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Implementation of Gang-Scheduling on Workstation Cluster
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Extensible Resource Management For Cluster Computing
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
| Hi-index | 0.00 |
Gang scheduling is an effective scheduling policy for multiprocessing workloads with significant interprocess synchronization and is in common use in real installations. In this paper we show that signigicant improvement in the job slowdown metric can be achieved simply by allocating a different number of quanta to different rows (control groups) depending on the number of processes belonging to jobs in a given row. Specifically, we show that allocating the number of quanta inversely proportionally to the number of processes per job in that row results in 20 - 50% smaller slowdowns without significantly affecting mean job response time. Incorporating these suggestions in to real schedulers would require the addition of only a few lines of simple code, hence this work should have an immediate practical impact.