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 difference 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 affected and the benefits of prioritising small tasks were identified in MMMXFT. Experiments were conducted by using a simulator with the exception of one real-world experiment. The real-world experiment identified challenges faced by algorithms which rely on accurate execution time prediction.
|Pages (from-to)||618 - 638|
|Number of pages||21|
|Journal||International Journal of Grid and Utility Computing (IJGUC)|
|Early online date||9 Aug 2019|
|Publication status||E-pub ahead of print - 9 Aug 2019|
- Cloud computing
- Scheduling algorithms