{"title":"A Hybrid Discrete Grey Wolf Optimization Algorithm Imbalance-ness Aware for Solving Two-dimensional Bin-packing Problems","authors":"Saeed Kosari, Mirsaeid Hosseini Shirvani, Navid Khaledian, Danial Javaheri","doi":"10.1007/s10723-024-09761-7","DOIUrl":null,"url":null,"abstract":"<p>In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the resource dimensions at the same time. Since the resources are typically scarce/expensive/pollutant, presenting an efficient resource allocation is a very favorable approach to reducing overall cost. On the other hand, the requirement of the applications on different dimensions of the resources is variable, usually, resource allocations have a high rate of wastage owing to the unpleasant resource skew-ness phenomenon. For instance, micro-service allocation in the Internet of Things (IoT) applications and Virtual Machine Placement (VMP) in a cloud context are challenging tasks because they diversely require imbalanced all resource dimensions such as CPU and Memory bandwidths, so inefficient resource allocation raises issues. In a special case, the problem under study associated with the two-dimensional resource allocation of distributed applications is modeled to the two-dimensional bin-packing problems which are categorized as the famous NP-Hard. Several approaches were proposed in the literature, but the majority of them are not aware of skew-ness and dimensional imbalances in the list of requested resources which incurs additional costs. To solve this combinatorial problem, a novel hybrid discrete gray wolf optimization algorithm (<i>HD</i>-<i>GWO</i>) is presented. It utilizes strong global search operators along with several novel walking-around procedures each of which is aware of resource dimensional skew-ness and explores discrete search space with efficient permutations. To verify <i>HD</i>-<i>GWO</i>, it was tested in miscellaneous conditions considering different correlation coefficients (<i>CC</i>) of resource dimensions. Simulation results prove that <i>HD</i>-<i>GWO</i> significantly outperforms other state-of-the-art in terms of relevant evaluation metrics along with a high potential of scalability.</p>","PeriodicalId":54817,"journal":{"name":"Journal of Grid Computing","volume":"309 1","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Grid Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10723-024-09761-7","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the resource dimensions at the same time. Since the resources are typically scarce/expensive/pollutant, presenting an efficient resource allocation is a very favorable approach to reducing overall cost. On the other hand, the requirement of the applications on different dimensions of the resources is variable, usually, resource allocations have a high rate of wastage owing to the unpleasant resource skew-ness phenomenon. For instance, micro-service allocation in the Internet of Things (IoT) applications and Virtual Machine Placement (VMP) in a cloud context are challenging tasks because they diversely require imbalanced all resource dimensions such as CPU and Memory bandwidths, so inefficient resource allocation raises issues. In a special case, the problem under study associated with the two-dimensional resource allocation of distributed applications is modeled to the two-dimensional bin-packing problems which are categorized as the famous NP-Hard. Several approaches were proposed in the literature, but the majority of them are not aware of skew-ness and dimensional imbalances in the list of requested resources which incurs additional costs. To solve this combinatorial problem, a novel hybrid discrete gray wolf optimization algorithm (HD-GWO) is presented. It utilizes strong global search operators along with several novel walking-around procedures each of which is aware of resource dimensional skew-ness and explores discrete search space with efficient permutations. To verify HD-GWO, it was tested in miscellaneous conditions considering different correlation coefficients (CC) of resource dimensions. Simulation results prove that HD-GWO significantly outperforms other state-of-the-art in terms of relevant evaluation metrics along with a high potential of scalability.
期刊介绍:
Grid Computing is an emerging technology that enables large-scale resource sharing and coordinated problem solving within distributed, often loosely coordinated groups-what are sometimes termed "virtual organizations. By providing scalable, secure, high-performance mechanisms for discovering and negotiating access to remote resources, Grid technologies promise to make it possible for scientific collaborations to share resources on an unprecedented scale, and for geographically distributed groups to work together in ways that were previously impossible. Similar technologies are being adopted within industry, where they serve as important building blocks for emerging service provider infrastructures.
Even though the advantages of this technology for classes of applications have been acknowledged, research in a variety of disciplines, including not only multiple domains of computer science (networking, middleware, programming, algorithms) but also application disciplines themselves, as well as such areas as sociology and economics, is needed to broaden the applicability and scope of the current body of knowledge.