Distributed and multiprocessor scheduling
ACM Computing Surveys (CSUR)
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
A Comparison of Multiprocessor Scheduling Heuristics
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Dynamic self-scheduling for parallel applications with task dependencies
Proceedings of the 6th international workshop on Middleware for grid computing
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Generational scheduling for dynamic task management in heterogeneous computing systems
Information Sciences: an International Journal
Reducing complexity in tree-like computer interconnection networks
Parallel Computing
High level QoS-driven model for Grid applications in a simulated environment
Future Generation Computer Systems
Performance analysis of HPC applications in the cloud
Future Generation Computer Systems
| Hi-index | 0.00 |
This paper considers the dynamic scheduling of parallel, dependent tasks onto a static, distributed computing platform, with the intention of delivering fairness and quality of service (QoS) to users. The key QoS requirement is that responsiveness is maintained for workloads with a wide range of execution times (minutes to months) even under transient periods of overload. A survey of schedule QoS metrics is presented, classified into those dealing with responsiveness, fairness and utilisation. These metrics are evaluated as to their ability to detect undesirable features of schedules. The Schedule Length Ratio (SLR) metric is shown to be the most helpful for measuring responsiveness in the presence of dependencies. A novel list scheduling policy called Projected-SLR is presented that delivers good responsiveness and fairness by using the SLR metric in its scheduling decisions. Projected-SLR is found to perform equally as well in responsiveness, fairness and utilisation as the best of the other scheduling policies evaluated (Shortest Remaining Time First/SRTF), using synthetic workloads and an industrial trace. However, Projected-SLR does this with a guarantee of starvation-free behaviour, unlike SRTF.