Show simple item record

dc.contributor.authorLane, Peter
dc.contributor.authorHelian, Na
dc.contributor.authorBodla, Muhammad Haad
dc.contributor.authorZheng, Minghua
dc.contributor.authorMoggridge, Paul
dc.date.accessioned2022-04-27T16:00:01Z
dc.date.available2022-04-27T16:00:01Z
dc.date.issued2022-04-15
dc.identifier.citationLane , P , Helian , N , Bodla , M H , Zheng , M & Moggridge , P 2022 , Dynamic Hierarchical Structure Optimisation for Cloud Computing Job Scheduling . in Dynamic Hierarchical Structure Optimisation for Cloud Computing Job Scheduling . Part of the Lecture Notes in Computer Science book series , vol. 13224 , Springer , pp. 301-316 , International Conference on the Applications of Evolutionary Computation , Spain , 20/04/22 . https://doi.org/10.1007/978-3-031-02462-7_20
dc.identifier.citationconference
dc.identifier.isbn978-3-031-02461-0
dc.identifier.isbn978-3-031-02462-7
dc.identifier.otherPURE: 27243358
dc.identifier.otherPURE UUID: 9b3d306d-6aa5-490f-92c9-130ef675e064
dc.identifier.otherORCID: /0000-0001-6687-0306/work/112292269
dc.identifier.urihttp://hdl.handle.net/2299/25501
dc.description© 2022 Springer Nature Switzerland AG. This is the accepted manuscript version of a conference paper that been published in final form at https://doi.org/10.1007/978-3-031-02462-7_20
dc.description.abstractThe performance of cloud computing depends in part on job-scheduling algorithms, but also on the connection structure. Previous work on this structure has mostly looked at fixed and static connections. However, we argue that such static structures cannot be optimal in all situations. We introduce a dynamic hierarchical connection system of sub-schedulers between the scheduler and servers, and use artificial intelligence search algorithms to optimise this structure. Due to its dynamic and flexible nature, this design enables the system to adaptively accommodate heterogeneous jobs and resources to make the most use of resources. Experimental results compare genetic algorithms and simulating annealing for optimising the structure, and demonstrate that a dynamic hierarchical structure can significantly reduce the total makespan (max processing time for given jobs) of the heterogeneous tasks allocated to heterogeneous resources, compared with a one-layer structure. This reduction is particularly pronounced when resources are scarce.en
dc.format.extent16
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofDynamic Hierarchical Structure Optimisation for Cloud Computing Job Scheduling
dc.relation.ispartofseriesPart of the Lecture Notes in Computer Science book series
dc.titleDynamic Hierarchical Structure Optimisation for Cloud Computing Job Schedulingen
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.contributor.institutionSchool of Physics, Engineering & Computer Science
dc.contributor.institutionDepartment of Computer Science
dc.date.embargoedUntil2024-04-15
dc.relation.schoolSchool of Physics, Engineering & Computer Science
dcterms.dateAccepted2022-04-15
rioxxterms.versionAM
rioxxterms.versionofrecordhttps://doi.org/10.1007/978-3-031-02462-7_20
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record