Show simple item record

dc.contributor.authorMoggridge, Paul
dc.contributor.authorHelian, Na
dc.contributor.authorSun, Yi
dc.contributor.authorLilley, Mariana
dc.contributor.authorVeneziano, Vito
dc.contributor.authorEaves, Martin
dc.date.accessioned2019-11-08T01:15:40Z
dc.date.available2019-11-08T01:15:40Z
dc.date.issued2019-08-09
dc.identifier.citationMoggridge , P , Helian , N , Sun , Y , Lilley , M , Veneziano , V & Eaves , M 2019 , ' Improving the MXFT Scheduling Algorithm for a Cloud Computing Context ' , International Journal of Grid and Utility Computing , vol. 10 , no. 6 , pp. 618 - 638 . https://doi.org/10.1504/IJGUC.2019.102711
dc.identifier.issn1741-847X
dc.identifier.otherPURE: 13769980
dc.identifier.otherPURE UUID: a7ed097e-6a87-4d29-81c6-5de15831aa5e
dc.identifier.otherORCID: /0000-0001-6687-0306/work/64327268
dc.identifier.otherScopus: 85073386490
dc.identifier.urihttp://hdl.handle.net/2299/21859
dc.description© 2019 Inderscience Enterprises Ltd.
dc.description.abstractIn 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.en
dc.format.extent21
dc.language.isoeng
dc.relation.ispartofInternational Journal of Grid and Utility Computing
dc.subjectCloud computing
dc.subjectMax-min
dc.subjectScheduling algorithms
dc.subjectManagement Information Systems
dc.subjectComputer Science Applications
dc.subjectApplied Mathematics
dc.titleImproving the MXFT Scheduling Algorithm for a Cloud Computing Contexten
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85073386490&partnerID=8YFLogxK
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1504/IJGUC.2019.102711
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record