University of Hertfordshire

By the same authors

Improving the MXFT Scheduling Algorithm for a Cloud Computing Context

Research output: Contribution to journalArticle

View graph of relations
Original languageEnglish
Number of pages21
JournalInternational Journal of Grid and Utility Computing
Journal publication date9 Mar 2018
Volume9
Issue2
Publication statusAccepted/In press - 9 Mar 2018

Abstract

In this paper the Max-min Fast Track (MXFT) scheduling algorithm is improved and compared against a selection of popular algorithms. The improved versions of MXFT are called Min-min Max-min Fast Track (MMMXFT) and Clustering Min-min Max-min Fast Track (CMMMXFT). The key dierence is using Min-min for the fast track. Experimentation revealed that despite Min-min's characteristic of prioritising small tasks at the expense of overall makespan, the overall makespan was not adversely eected and the benets of prioritising small tasks were identied in MMMXFT. Experiments were conducted using a simulator with the exception of one real world experiment. The real world experiment identied challenges faced by algorithms which rely on accurate execution time prediction.

ID: 13769980