Minimising the Execution of Unknown Bag-of-Task Jobs with Deadlines on the Cloud


Autoria(s): Thai, Long; Varghese, Blesson; Barker, Adam
Data(s)

2016

Resumo

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.

Identificador

http://pure.qub.ac.uk/portal/en/publications/minimising-the-execution-of-unknown-bagoftask-jobs-with-deadlines-on-the-cloud(e3fe4a4b-bcd2-435f-9a59-ab7d71fb26c4).html

http://dx.doi.org/10.1145/1235

Idioma(s)

eng

Publicador

Association for Computing Machinery (ACM)

Direitos

info:eu-repo/semantics/restrictedAccess

Fonte

Thai , L , Varghese , B & Barker , A 2016 , Minimising the Execution of Unknown Bag-of-Task Jobs with Deadlines on the Cloud . in 7th International Workshop on Data-intensive Distributed Computing (DIDC), in conjunction with the 25th International ACM Symposium on High Performance Parallel and Distributed Computing (HPDC) . Association for Computing Machinery (ACM) , 25th International Symposium on High-Performance Parallel and Distributed Computing , Kyoto , Japan , 31-4 June . DOI: 10.1145/1235

Tipo

contributionToPeriodical