Randomization, speculation, and adaptation in batch schedulers
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Attacking the bottlenecks of backfilling schedulers
Cluster Computing
On Job Scheduling for HPC-Clusters and the dynP Scheduler
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
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
The EASY - LoadLeveler API Project
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the 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
On the Design and Evaluation of Job Scheduling Algorithms
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Effect of Job Size Characteristics on Job Scheduling Performance
IPDPS '00/JSSPP '00 Proceedings of the Workshop on 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
Characterization of Backfilling Strategies for Parallel Job Scheduling
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
DIRAC: A Scalable Lightweight Architecture for High Throughput Computing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Experimental Analysis of the Root Causes of Performance Evaluation Results: A Backfilling Case Study
IEEE Transactions on Parallel and Distributed Systems
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
Adaptive Parallel Job Scheduling with Flexible Coscheduling
IEEE Transactions on Parallel and Distributed Systems
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
Selective preemption strategies for parallel job scheduling
International Journal of High Performance Computing and Networking
Robust scheduling of moldable parallel jobs
International Journal of High Performance Computing and Networking
A job scheduling framework for large computing farms
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Co-allocation with Communication Considerations in Multi-cluster Systems
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Resource co-allocation for large-scale distributed environments
Proceedings of the 18th ACM international symposium on High performance distributed computing
Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters
Proceedings of the 18th ACM international symposium on High performance distributed computing
Performance, fairness and effectiveness in space-slicing multi-cluster schedulers
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Group-wise performance evaluation of processor co-allocation in multi-cluster systems
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Optimal job packing, a backfill scheduling optimization for a cluster of workstations
The Journal of Supercomputing
A moldable online scheduling algorithm and its application to parallel short sequence mapping
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
The importance of complete data sets for job scheduling simulations
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
An Analysis of Power Consumption Logs from a Monitored Grid Site
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Towards a profound analysis of bags-of-tasks in parallel systems and their performance impact
Proceedings of the 20th international symposium on High performance distributed computing
Backfilling with guarantees granted upon job submission
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
Failure-aware resource provisioning for hybrid Cloud infrastructure
Journal of Parallel and Distributed Computing
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
Enhancing performance of failure-prone clusters by adaptive provisioning of cloud resources
The Journal of Supercomputing
Journal of Parallel and Distributed Computing
Exploring portfolio scheduling for long-term execution of scientific workloads in IaaS clouds
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Toward balanced and sustainable job scheduling for production supercomputers
Parallel Computing
| Hi-index | 0.00 |
Although there is wide agreement that backfilling produces significant benefits in scheduling of parallel jobs, there is no clear consensus on which backfilling strategy is preferable - should conservative backfilling be used or the more aggressive EASY backfilling scheme. Using trace-based simulation, we show that if performance is viewed within various job categories based on their width (processor request size) and length (job duration), some consistent trends may be observed. Using insights gleaned by the characterization, we develop a selective reservation strategy for backfill scheduling. We demonstrate that the new scheme is better than both conservative and aggressive backfilling.We also consider the issue of fairness in job scheduling and develop a new quantitative approach to its characterization. We show that the newly proposed schemes are also comparable or better than aggressive backfilling with respect to the fairness criterion.