Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Coscheduling based on runtime identification of activity working sets
International Journal of Parallel Programming
The impact of I/O on program behavior and parallel scheduling
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A methodology and an evaluation of the SGI Origin2000
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Scheduling issues in high-performance computing
ACM SIGMETRICS Performance Evaluation Review
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Trace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers
ICPP '97 Proceedings of the international Conference on Parallel Processing
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Parallel Job Scheduling: Issues and Approaches
IPPS '95 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
Scheduling Issues in a Partitionable Parallel System
Proceedings of the 16th European Simulation Multiconference on Modelling and Simulation 2002
A Simulation - Based Performance Analysis of Gang Scheduling in a Distributed System
SS '99 Proceedings of the Thirty-Second Annual Simulation Symposium
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Multi-Site Allocation Policies on a Grid and Local Level
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A special type of scheduling called backfilling is presented using a parallel system upon which multiple jobs can be executed simultaneously. Jobs consist of parallel tasks scheduled to execute concurrently on processor partitions, where each task starts at the same time and computes at the same pace. The impact of I/O scheduling on system performance is also examined. The goal is to achieve high system performance and maintain fairness in terms of individual job execution. The performance of different backfilling schemes and different I/O scheduling strategies is compared over various processor service time coefficients of variation and for various degrees of multiprogramming. Simulation results demonstrate that backfilling improves system performance while preserving job sequencing. Also, the results show that when there is contention for the disk resources, trends in system can differ from those appearing in the research literature if I/O behavior is negligible or it is not explicitly considered.