Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Highly efficient gang scheduling implementation
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed 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
Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
IEEE Transactions on Parallel and Distributed Systems
Characterization of Backfilling Strategies for Parallel Job Scheduling
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Gang Scheduling with Lightweight User-Level Communication
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
IEEE Transactions on Parallel and Distributed Systems
Coscheduling in Clusters: Is It a Viable Alternative?
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
The portable batch scheduler and the maui scheduler on linux clusters
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Performance evaluation of bag of gangs scheduling in a heterogeneous distributed system
Journal of Systems and Software
Future Generation Computer Systems
The Journal of Supercomputing
| Hi-index | 0.00 |
Despite growing popularity of small-scale clusters built out of off-the-shelf components, there has been little research on how these small-scale clusters behave under different scheduling policies. Batch scheduling policies with backfilling provide excellent space-sharing strategy for parallel jobs. However, as the performances of uniprocessor and symmetric multiprocessor have improved with timesharing scheduling strategies, it is intuitive that the performance of a cluster of PCs with distributed memory may also improve with time-sharing strategies, or a combination of time-sharing and space-sharing strategies. Apart from the batch scheduling policies, this research explores the possibilities of using synchronized time-sharing scheduling algorithms for clusters. This paper describes simulation of the Gang scheduling policies on top of an existing batch scheme. The simulation results indicate that time-sharing scheduler for clusters could exhibit superior performance over a batch policy.