Abstract
Scheduling jobs with deadlines, each of which defines the latest
time that a job must be completed, can be challenging
on the cloud due to incurred costs and unpredictable performance.
This problem is further complicated when there
is not enough information to effectively schedule a job such
that its deadline is satisfied, and the cost is minimised. In
this paper, we present an approach to schedule jobs, whose
performance are unknown before execution, with deadlines
on the cloud. By performing a sampling phase to collect
the necessary information about those jobs, our approach
delivers the scheduling decision within 10% cost and 16%
violation rate when compared to the ideal setting, which has
complete knowledge about each of the jobs from the beginning.
It is noted that our proposed algorithm outperforms
existing approaches, which use a fixed amount of resources
by reducing the violation cost by at least two times.
Original language | English |
---|---|
Title of host publication | DIDC '16 Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing, in conjunction with the 25th International ACM Symposium on High Performance Parallel and Distributed Computing (HPDC) |
Publisher | Association for Computing Machinery |
Number of pages | 8 |
ISBN (Print) | 978-1-4503-2138-9 |
DOIs | |
Publication status | Published - Jun 2016 |
Event | 25th International Symposium on High-Performance Parallel and Distributed Computing - Kyoto, Japan Duration: 31 May 2016 → 04 Jun 2016 http://www.hpdc.org/2016/ |
Conference
Conference | 25th International Symposium on High-Performance Parallel and Distributed Computing |
---|---|
Country/Territory | Japan |
City | Kyoto |
Period | 31/05/2016 → 04/06/2016 |
Internet address |