Properties of delay-cost scheduling in time-sharing systems
IBM Journal of Research and Development
Randomization, speculation, and adaptation in batch schedulers
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
The Concurrent Supercomputing Consortium: Year 1
IEEE Parallel & Distributed Technology: Systems & Technology
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems
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
A Microeconomic Scheduler for Parallel Computers
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A framework for performance modeling and prediction
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Job-Length Estimation and Performance in Backfilling Schedulers
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Characterization of Backfilling Strategies for Parallel Job Scheduling
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Market-based cluster resource management
Market-based cluster resource management
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Precise and realistic utility functions for user-centric performance analysis of schedulers
Proceedings of the 16th international symposium on High performance distributed computing
Efficient auction-based grid reservations using dynamic programming
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
SLA-Based Advance Reservations with Flexible and Adaptive Time QoS Parameters
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Eliciting honest value information in a batch-queue environment
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Energy aware scheduling on desktop grid environment with static performance prediction
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Evaluating the impact of inaccurate information in utility-based scheduling
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
An Evaluation of the Benefits of Fine-Grained Value-Based Scheduling on General Purpose Clusters
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
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
An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters
Future Generation Computer Systems
An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters
Future Generation Computer Systems
Scheduling and planning job execution of loosely coupled applications
The Journal of Supercomputing
Towards autonomic detection of SLA violations in Cloud infrastructures
Future Generation Computer Systems
Coordinated rescheduling of Bag-of-Tasks for executions on multiple resource providers
Concurrency and Computation: Practice & Experience
Utility-aware deferred load balancing in the cloud driven by dynamic pricing of electricity
Proceedings of the Conference on Design, Automation and Test in Europe
Non-monetary fair scheduling: a cooperative game theory approach
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheuling outcome from both parties' perspectives. In a grid or stand-alone high-performance computing (HPC) enviroment, this communication typically takes the form of a user-provided job script containing essential configuration information, including processors/resources required, a requested runtime, and a priority. Users' requested runtimes are notoriously inaccurate as a predictor of actual runimes. This study examines whether users can improve their runtime estimates if a tangible reward is provided for accuracy. We show that under these conditions, about half of users provide an improved estimate, but there is not a substantial improvement in the overall average accracy. Priority, as implemented in many production scheduers, is a very crude approximation of the value users may attach to timely job completion. We show users are capble of providing richer utility functions than most schedulers elicit. Thus we explore two elements of the user-scheuler dialogue to understand if accuracy and completeness of information conveyed could be improved.