A simulation model of backfilling and I/O scheduling in a partitionable parallel system
Proceedings of the 32nd conference on Winter simulation
Task scheduling performance in distributed systems with time varying workload
Neural, Parallel & Scientific Computations
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Job Scheduling for the BlueGene/L System
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of Migration on Parallel Job Scheduling for Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Parallel Job Scheduling in Distributed Systems
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Idle regulation in non-clairvoyant scheduling of parallel jobs
Discrete Applied Mathematics
A new technique of switch & feedback job scheduling mechanism in a distributed system
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
| Hi-index | 0.00 |
In distributed systems job scheduling is a difficult problem. In this work we study a special type of scheduling called gang scheduling under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors.The performance of various gang scheduling schemes is studied and compared for a variety of workloads. The main objective of the processor schedulers is to achieve high overall system throughput while at the same time providing some guarantee for the performance of individual jobs in the system.