Task assignment with unknown duration
Journal of the ACM (JACM)
Job placement with unknown duration and no preemption
ACM SIGMETRICS Performance Evaluation Review
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Understanding the slowdown of large jobs in an M/GI/1 system
ACM SIGMETRICS Performance Evaluation Review
A Model for Moldable Supercomputer Jobs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Gang Scheduling with a Queue for Large Jobs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Comparing Logs and Models of Parallel Workloads Using the Co-plot Method
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
Resource Allocation Schemes for Gang Scheduling
IPDPS '00/JSSPP '00 Proceedings of the Workshop on 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
Metrics for Parallel Job Scheduling and Their Convergence
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
On the Development of an Efficient Coscheduling System
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
The Forgotten Factor: Facts on Performance Evaluation and Its Dependence on Workloads
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Workload Modeling for Performance Evaluation
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Journal of Parallel and Distributed Computing
Design and implementation of a feedback controller for slowdown differentiation on internet servers
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
What is worth learning from parallel workloads?: a user and session based analysis
Proceedings of the 19th annual international conference on Supercomputing
A Co-Plot analysis of logs and models of parallel workloads
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A multicriteria approach to two-level hierarchy scheduling in grids
Journal of Scheduling
Idle regulation in non-clairvoyant scheduling of parallel jobs
Discrete Applied Mathematics
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Proceedings of the 6th ACM conference on Computing frontiers
A job self-scheduling policy for HPC infrastructures
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Modeling user runtime estimates
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Runtime resource allocation for software pipelines
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
| Hi-index | 0.02 |
We develop a workload model based on observations of parallel computers at the San Diego Supercomputer Center and the Cornell Theory Center. This model gives us insight into the performance of strategies for scheduling moldable jobs on space-sharing parallel computers. We find that Adaptive Static Partitioning (ASP), which has been reported to work well for other workloads, does not perform as well as strategies that adapt better to system load. The best of the strategies we consider is one that explicitly reduces allocations when load is high (a variation of Sevcik's A+ strategy (1989)).