2016 International Conference on Advanced Computing and Applications (ACOMP)最新文献

筛选

英文中文

Minimizing Total Busy Time with Application to Energy-Efficient Scheduling of Virtual Machines in IaaS Clouds 基于IaaS云的虚拟机节能调度最小化总忙时间

2016 International Conference on Advanced Computing and Applications (ACOMP) Pub Date : 2016-09-19 DOI: 10.1109/ACOMP.2016.029

Nguyen Quang-Hung, N. Thoai

{"title":"Minimizing Total Busy Time with Application to Energy-Efficient Scheduling of Virtual Machines in IaaS Clouds","authors":"Nguyen Quang-Hung, N. Thoai","doi":"10.1109/ACOMP.2016.029","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.029","url":null,"abstract":"This paper investigates the energy-efficient virtual machine scheduling problems in IaaS clouds where users request multiple resources in fixed intervals and non-preemption for processing their virtual machines (VMs) and physical machines have bounded capacity resources. Many previous works are based on migration techniques to move on-line VMs from low utilization hosts and turn these hosts off to reduce energy consumption. However, the techniques for migration of VMs could not use in our case. The scheduling problem is NP-hard. Instead of minimizing the number used physical machines, we propose a scheduling algorithm EMinTRE-LFT to minimize the sum of total busy time of all physical machines that is equivalent to minimize total energy consumption. Our extensive simulations using parallel workload models in Parallel Workload Archive show that the proposed algorithm could reduce the total energy consumption compared with state-of-the-art algorithms including Tian's Modified First Fit Decreasing Earliest, Beloglazov's Power-Aware Best Fit Decreasing and vector binpacking norm-based greedy.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123336263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

G-Strongly Positive Scripts and Critical Configurations of Chip Firing Games on Digraphs 有向图上掷片博弈的g -强正脚本和临界构型

2016 International Conference on Advanced Computing and Applications (ACOMP) Pub Date : 2014-12-03 DOI: 10.1109/ACOMP.2016.030

Tran Thi Thu Huong

引用次数: 1

首页上一页