University of Hertfordshire

By the same authors

Revising Max-min for Scheduling in a Cloud Computing Context

Research output: Research - peer-reviewPaper


View graph of relations
Original languageEnglish
StatePublished - 18 Aug 2017
EventThe 26th IEEE International Cnference on Enable Technologies: Infrastructure for Collaborative Enerprises - Poznan University of Economics and Business, Poznan , Poland
Duration: 21 Jun 201723 Jun 2017


ConferenceThe 26th IEEE International Cnference on Enable Technologies: Infrastructure for Collaborative Enerprises
Abbreviated titleWETICE 2017
Internet address


Adoption of Cloud Computing is on the rise[1]
and many datacenter operators adhere to strict energy efficiency
guidelines[2]. In this paper a novel approach to scheduling in
a Cloud Computing context is proposed. The algorithm Maxmin
Fast Track (MXFT) revises the Max-min algorithm to better
support smaller tasks with stricter Service Level Agreements
(SLAs), which makes it more relevant to Cloud Computing.
MXFT is inspired by queuing in supermarkets, where there
is a fast lane for customers with a smaller number of items.
The algorithm outperforms Max-min in task execution times and
outperforms Min-min in overall makespan. A by-product of investigating
this algorithm was the development of simulator called
“ScheduleSim”[3] which makes it simpler to prove a scheduling
algorithm before committing to a specific scheduling problem in
Cloud Computing and therefore might be a useful precursor to
experiments using the established simulator CloudSim[4].


Paper presented at the 2017 IEEE 26th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE), Poznan, Poland, 21-23 June 2017. © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

ID: 12067384