Distributed resources co-allocation in grid computing

Sid Ahmed Makhlouf, Belabbas Yagoubi
{"title":"Distributed resources co-allocation in grid computing","authors":"Sid Ahmed Makhlouf, Belabbas Yagoubi","doi":"10.1109/ICMWI.2010.5647973","DOIUrl":null,"url":null,"abstract":"Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids and gives a certain Quality of Service (QoS) for grid users is the efficient co-allocation of jobs. Due to the lack of centralized control and the dynamic nature of resource availability, any successful co-allocation mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have an co-allocation mechanism that does not rely on the availability of coherent global information. This work addresses those problems by describing and evaluating a grid distributed resources co-allocation mechanism using resources providers offers and the advance reservations. In our policy, a set of co-allocators agents receives and schedule a job to one or more resources agents based on a offers/demand mechanism. Offers act as a mechanism in which resources agents expose their interest in executing an entire job or only part of it. Each co-allocator agent selects computational resources based on best offers provided by the resources agents and distributes a job among various resources agents in order to speed up the job execution. The resources agents offers and use advance reservation mechanism to reserves the offers. We have introduced a regulator agent that intervenes to solve the conflicts of offers between one or more co-allocators agents. The main aims of our policy is to minimize the total time to execute all jobs (Makespen), minimize the waiting time of the users and maximize the resources utilization rate. The proposed policy has been verified through an extension of GridSim simulation toolkit and the simulation results confirm that the proposed approach allow us to achieve the most of our goals.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Machine and Web Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMWI.2010.5647973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids and gives a certain Quality of Service (QoS) for grid users is the efficient co-allocation of jobs. Due to the lack of centralized control and the dynamic nature of resource availability, any successful co-allocation mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have an co-allocation mechanism that does not rely on the availability of coherent global information. This work addresses those problems by describing and evaluating a grid distributed resources co-allocation mechanism using resources providers offers and the advance reservations. In our policy, a set of co-allocators agents receives and schedule a job to one or more resources agents based on a offers/demand mechanism. Offers act as a mechanism in which resources agents expose their interest in executing an entire job or only part of it. Each co-allocator agent selects computational resources based on best offers provided by the resources agents and distributes a job among various resources agents in order to speed up the job execution. The resources agents offers and use advance reservation mechanism to reserves the offers. We have introduced a regulator agent that intervenes to solve the conflicts of offers between one or more co-allocators agents. The main aims of our policy is to minimize the total time to execute all jobs (Makespen), minimize the waiting time of the users and maximize the resources utilization rate. The proposed policy has been verified through an extension of GridSim simulation toolkit and the simulation results confirm that the proposed approach allow us to achieve the most of our goals.
网格计算中的分布式资源协同分配
计算网格具有利用异构和地理分布资源解决大规模科学问题的潜力。然而,在实现这一潜力之前,必须克服一些主要的技术障碍。有效地利用计算网格并为网格用户提供一定的服务质量(QoS)的关键问题之一是作业的有效协同分配。由于缺乏集中控制和资源可用性的动态性,任何成功的协同分配机制都应该是高度分布式的,并且对网格环境中的变化具有鲁棒性。此外,希望有一种不依赖于连贯全局信息的可用性的共同分配机制。本文通过描述和评估网格分布式资源协同分配机制来解决这些问题,该机制使用资源提供者提供的资源和预先预订。在我们的策略中,一组共同分配器代理根据提供/需求机制接收作业并将作业调度到一个或多个资源代理。提供充当一种机制,在这种机制中,资源代理显示它们对执行整个作业或部分作业的兴趣。每个协同分配器代理根据资源代理提供的最佳报价选择计算资源,并在各个资源代理之间分配作业,以加快作业的执行速度。资源代理提供资源,并使用提前预订机制来保留这些资源。我们引入了一个监管代理,它干预解决一个或多个共同分配代理之间的报价冲突。我们的策略的主要目标是最小化执行所有作业的总时间(Makespen),最小化用户的等待时间,最大化资源利用率。通过GridSim仿真工具包的扩展验证了所提出的策略,仿真结果证实了所提出的方法使我们能够实现大部分目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信