Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/68779
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorWang, JV-
dc.creatorGanganath, N-
dc.creatorCheng, CT-
dc.creatorTse, CK-
dc.date.accessioned2017-10-04T02:28:00Z-
dc.date.available2017-10-04T02:28:00Z-
dc.identifier.isbn978-1-4673-6853-7 (electronic)-
dc.identifier.isbn978-1-5090-1427-9 (Print on Demand(PoD))-
dc.identifier.urihttp://hdl.handle.net/10397/68779-
dc.language.isoen-
dc.publisherInstitute of Electrical and Electronics Engineers-
dc.rights© 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.-
dc.rightsThe following publication J. V. Wang, N. Ganganath, C. T. Cheng and C. K. Tse, "A heuristics-based VM allocation mechanism for cloud data centers," 2017 IEEE International Symposium on Circuits and Systems (ISCAS), Baltimore, MD, USA, 2017, pp. 1-4 is available at http://dx.doi.org/10.1109/ISCAS.2017.8050470-
dc.subjectVM allocation-
dc.subjectMultiple correlation-
dc.subjectCPU utilization-
dc.subjectHeuristics-
dc.subjectCloud computing-
dc.titleA heuristics-based VM allocation mechanism for cloud data centers-
dc.typeConference Paper-
dc.identifier.spage1-
dc.identifier.epage4-
dc.identifier.doi10.1109/ISCAS.2017.8050470-
dcterms.abstractLive migration, which allows virtual machines (VMs) to move across distinct physical hosts, is widely adopted for realizing energy saving and load balancing in modern Cloud data centers. However, putting VMs with high correlations on their CPU utilization patterns onto the same host is very likely to trigger overloading incidents and commit Service Level Agreements (SLA) violations, even when the host has not yet reached its critical limits. To avoid such SLA violations and to maintain a low energy consumption, this work proposes a heuristics-based VM allocation mechanism. Under the proposed mechanism, VMs showing high CPU utilization correlations to other co-located peers and hosts with extreme utilization values are both assigned with high heuristic values. VMs with high heuristic values are therefore less preferred to be co-located onto a host that has a high heuristic value. Performance of the proposed mechanism was evaluated using CloudSim with real-world workload data. Simulation results show that when comparing with other existing mechanisms, the proposed idea can further reduce both energy consumption and SLA violations.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2017 IEEE International Symposium on Circuits and Systems (ISCAS’2017), Baltimore, MD, USA, 28-31 May 2017, p. 1-4-
dcterms.issued2017-
dc.identifier.scopus2-s2.0-85032681698-
dc.identifier.ros2016005621-
dc.relation.conferenceIEEE International Symposium on Circuits and Systems [ISCAS]-
dc.source.typecp-
dc.identifier.artn8050470-
dc.identifier.rosgroupid2016005370-
dc.description.ros2016-2017 > Academic research: refereed > Refereed conference paper-
dc.description.validate201803_a bcwh-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0123-n02, a0124-n01en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
PID4698023.pdfPre-Published version2.13 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

266
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

210
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Apr 19, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.