Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Application scheduling and processor allocation in multiprogrammed parallel processing systems
Performance Evaluation - Special issue: performance modeling of parallel processing systems
Randomization, speculation, and adaptation in batch schedulers
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The ANL/IBM SP Scheduling System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Selective Reservation Strategies for Backfill Job Scheduling
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Developments from a June 1996 seminar on Online algorithms: the state of the art
Job-Length Estimation and Performance in Backfilling Schedulers
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Predictive Application-Performance Modeling in a Computational Grid Environment
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A resource-allocation queueing fairness measure
Proceedings of the joint international conference on Measurement and modeling of computer systems
Job Fairness in Non-Preemptive Job Scheduling
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Experimental Analysis of the Root Causes of Performance Evaluation Results: A Backfilling Case Study
IEEE Transactions on Parallel and Distributed Systems
Contention-sensitive static performance prediction for parallel distributed applications
Performance Evaluation
Backfilling with lookahead to optimize the packing of parallel jobs
Journal of Parallel and Distributed Computing
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
Precise and realistic utility functions for user-centric performance analysis of schedulers
Proceedings of the 16th international symposium on High performance distributed computing
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
SQF: A slowdown queueing fairness measure
Performance Evaluation
Performance prediction of large-scale parallell system and application using macro-level simulation
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Quantifying fairness in queuing systems: Principles, approaches, and applicability
Probability in the Engineering and Informational Sciences
On Simulation and Design of Parallel-Systems Schedulers: Are We Doing the Right Thing?
IEEE Transactions on Parallel and Distributed Systems
Quincy: fair scheduling for distributed computing clusters
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Predicting the execution time of grid workflow applications through local learning
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Evaluating the impact of inaccurate information in utility-based scheduling
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
The Resource Usage Aware Backfilling
Job Scheduling Strategies for Parallel Processing
Scheduling Restartable Jobs with Short Test Runs
Job Scheduling Strategies for Parallel Processing
Are user runtime estimates inherently inaccurate?
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Toward balanced and sustainable job scheduling for production supercomputers
Parallel Computing
Hi-index | 0.00 |
As the most widely used parallel job scheduling strategy in production schedulers, EASY has achieved great success, not only because it can balance fairness and performance, but also because it is universally applicable to most HPC systems. However, unfairness still exists in EASY. For real workloads used in this work, our simulation shows that a blocked job can be delayed by later jobs for more than 90 hours. In addition, EASY cannot directly employ parallel job runtime prediction techniques, because this would lead to a serious situation called reservation violation. In this paper, we aim at guaranteeing strict fairness (no job is delayed by any jobs of lower priority) while achieving attractive performance, and employing prediction without causing reservation violation in parallel job scheduling. We propose two novel strategies, shadow load preemption (SLP) and venture backfilling (VB), which are together integrated into EASY to construct a preemptive venture EASY backfilling (PV-EASY) strategy. Experimental results on three workloads of real HPC systems demonstrate that: First, PV-EASY guarantees strict fairness, in addition to avoiding reservation violation when employing job runtime prediction techniques in scheduling; Second, PV-EASY achieves the same performance as EASY, and outperforms prediction employed EASY; Third, the preemption in PV-EASY is not resource costly and simple enough to be implemented in all HPC systems where EASY works. These advantages make PV-EASY more attractive than EASY in parallel job scheduling, both from academic and industry perspectives.