Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
The impact of job memory requirements on gang-scheduling performance
ACM SIGMETRICS Performance Evaluation Review
IEEE Transactions on Parallel and Distributed Systems
An infrastructure for efficient parallel job execution in Terascale computing environments
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium 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
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Implications of I/O for Gang Scheduled Workloads
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
A Historical Application Profiler for Use by Parallel Schedulers
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
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Characteristics of a Large Shared Memory Production Workload
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
STORM: lightning-fast resource management
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
IEEE Transactions on Parallel and Distributed Systems
Selective Preemption Strategies for Parallel Job Scheduling
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Journal of Parallel and Distributed Computing
Benefit of Limited Time Sharing in the Presence of Very Large Parallel Jobs
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Predicting bounds on queuing delay for batch-scheduled parallel machines
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Improving a Local Learning Technique for QueueWait Time Predictions
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
A robust packet scheduling algorithm for proportional delay differentiation services
Computer Communications
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
NCA '08 Proceedings of the 2008 Seventh IEEE International Symposium on Network Computing and Applications
Group-Based Optimizaton for Parallel Job Scheduling with Scojo-PECT-O
HPCS '08 Proceedings of the 2008 22nd International Symposium on High Performance Computing Systems and Applications
ICPPW '10 Proceedings of the 2010 39th International Conference on Parallel Processing Workshops
Co-scheduling with user-settable reservations
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Unfairness metrics for space-sharing parallel job schedulers
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Coarse-grain time slicing with resource-share control in parallel-job scheduling
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Performance analysis of preemption-aware scheduling in multi-cluster grid environments
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
User satisfaction and scheduling on grids makes predictability of response times and quality-of-service highly desirable. However, existing approaches for response-time prediction still show significant prediction errors, mostly due to problems in dynamic arrival of jobs with potentially higher priority and hard-to-anticipate packing and backfilling effects. The same problems imply that quality-of-service cannot be solved with standard approaches from communication systems. Thus, this paper presents a scheduling approach which provides a more suitable framework for service guarantees and predictability. The approach is based on coarse-grain preemption, combined with an innovative separation of job classes. Resource shares can be determined as necessary to meet target service levels. A further extension permits limited dynamic resource allocation to adapt to variations in machine load and job mixes. The feasibility of service control is demonstrated with various workloads.