A Symbolic Approachto Modeling Cellular Behavior
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Selective Reservation Strategies for Backfill Job Scheduling
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters
The Journal of Supercomputing
Effectively Utilizing Global Cluster Memory for Large Data-Intensive Parallel Programs
IEEE Transactions on Parallel and Distributed Systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Simulation of job scheduling for small scale clusters
Proceedings of the 38th conference on Winter simulation
Scientific Programming - AxGrids 2004
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
Xen and the Art of Cluster Scheduling
VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Selective preemption strategies for parallel job scheduling
International Journal of High Performance Computing and Networking
Co-allocation with Communication Considerations in Multi-cluster Systems
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Consistent Application Performance at the Exascale
International Journal of High Performance Computing Applications
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
Hierarchical scheduling mechanism for grid systems
IMSA '07 Proceedings of the Eleventh IASTED International Conference on Internet and Multimedia Systems and Applications
Moldable parallel job scheduling using job efficiency: an iterative approach
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
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
Using inaccurate estimates accurately
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
On/off-line prediction applied to job scheduling on non-dedicated NOWs
Journal of Computer Science and Technology - Special issue on natural language processing
Are user runtime estimates inherently inaccurate?
JSSPP'04 Proceedings of the 10th 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
An enhanced grid scheduling with job priority and equitable interval job distribution
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.01 |
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 e.g., should conservative backfilling be used or the more aggressive EASY backfilling scheme; should a First-Come First-Served (FCFS) queue-priority policy be used, or some other such as Shortest job First (SF) or eXpansion Factor (XF); In this paper, we use trace-based simulation to address these questions and glean new insights into the characteristics of backfilling strategies for job scheduling. We show that by viewing performance in terms of slowdowns and turnaround times of jobs within various categories based on their width (processor requestsize), length (job duration) and accuracy of the user's estimate of run time, some consistent trends may be observed.