{"title":"云环境下基于蜜蜂行为的高效负载均衡","authors":"Y. Sheeja, S. Jayalekshmi","doi":"10.1109/COMPSC.2014.7032650","DOIUrl":null,"url":null,"abstract":"In cloud computing environment, the load balancing of non pre-emptive independent tasks is an important aspect of task scheduling. The tasks are executed on Virtual Machines (VMs) and these VMs are run in parallel so that the load has to be well balanced across all VMs. Since the cloud user pay for the service he/she is interested in reducing the execution time of task as well as the cost of using VM instances (CPU, Memory, Bandwidth etc). The proposed algorithm balance the load across VMs effectively by mapping tasks to under loaded or idle VMs based on the foraging behaviour of honey bees and if there is more than one under loaded VMs, it also selects cost efficient one using Pareto dominance strategy. The experimental results show that the algorithm is effective when compared with existing algorithms and it also reduces the cost of using VM instances.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Cost effective load balancing based on honey bee behaviour in cloud environment\",\"authors\":\"Y. Sheeja, S. Jayalekshmi\",\"doi\":\"10.1109/COMPSC.2014.7032650\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cloud computing environment, the load balancing of non pre-emptive independent tasks is an important aspect of task scheduling. The tasks are executed on Virtual Machines (VMs) and these VMs are run in parallel so that the load has to be well balanced across all VMs. Since the cloud user pay for the service he/she is interested in reducing the execution time of task as well as the cost of using VM instances (CPU, Memory, Bandwidth etc). The proposed algorithm balance the load across VMs effectively by mapping tasks to under loaded or idle VMs based on the foraging behaviour of honey bees and if there is more than one under loaded VMs, it also selects cost efficient one using Pareto dominance strategy. The experimental results show that the algorithm is effective when compared with existing algorithms and it also reduces the cost of using VM instances.\",\"PeriodicalId\":388270,\"journal\":{\"name\":\"2014 First International Conference on Computational Systems and Communications (ICCSC)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 First International Conference on Computational Systems and Communications (ICCSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPSC.2014.7032650\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 First International Conference on Computational Systems and Communications (ICCSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSC.2014.7032650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cost effective load balancing based on honey bee behaviour in cloud environment
In cloud computing environment, the load balancing of non pre-emptive independent tasks is an important aspect of task scheduling. The tasks are executed on Virtual Machines (VMs) and these VMs are run in parallel so that the load has to be well balanced across all VMs. Since the cloud user pay for the service he/she is interested in reducing the execution time of task as well as the cost of using VM instances (CPU, Memory, Bandwidth etc). The proposed algorithm balance the load across VMs effectively by mapping tasks to under loaded or idle VMs based on the foraging behaviour of honey bees and if there is more than one under loaded VMs, it also selects cost efficient one using Pareto dominance strategy. The experimental results show that the algorithm is effective when compared with existing algorithms and it also reduces the cost of using VM instances.