A Comparison Study on the Performance of Population-based Meta-Heuristics for Independent Batch Scheduling in Grid Systems

F. Xhafa, J. Kolodziej, Bernat Duran, Marcin Bogdański, L. Barolli
{"title":"A Comparison Study on the Performance of Population-based Meta-Heuristics for Independent Batch Scheduling in Grid Systems","authors":"F. Xhafa, J. Kolodziej, Bernat Duran, Marcin Bogdański, L. Barolli","doi":"10.1109/CISIS.2011.27","DOIUrl":null,"url":null,"abstract":"There has been a lot of research recently devoted to scheduling and resource allocation in Grid systems. Research efforts have been done in particular to the use of heuristic and meta-heuristic approaches in the design of efficient Grid schedulers. In this paper we present a comprehensive study on the performance of different population-based heuristic methods, namely Genetic Algorithms, Memetic Algorithms and Cellular Memetic Algorithms for the problem. The aim is to shed light on the advantages and limitations of different population based methods as well as their hybridization with local search methods, such as Tabu Search, when solving the multi-objective version of the problem under execution time restrictions of Grid schedulers. We considered a set of scenarios that represent a high variation regarding the size of entries and static/dynamic features aiming to judge on the robustness with regard to the quality of the solutions obtained by the considered methods. These scenarios are divided into static, which provides a single set of tasks and resources for each entry, and dynamic, using a grid simulator used to observe the behavior of heuristics in Grid environments in real time.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIS.2011.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

There has been a lot of research recently devoted to scheduling and resource allocation in Grid systems. Research efforts have been done in particular to the use of heuristic and meta-heuristic approaches in the design of efficient Grid schedulers. In this paper we present a comprehensive study on the performance of different population-based heuristic methods, namely Genetic Algorithms, Memetic Algorithms and Cellular Memetic Algorithms for the problem. The aim is to shed light on the advantages and limitations of different population based methods as well as their hybridization with local search methods, such as Tabu Search, when solving the multi-objective version of the problem under execution time restrictions of Grid schedulers. We considered a set of scenarios that represent a high variation regarding the size of entries and static/dynamic features aiming to judge on the robustness with regard to the quality of the solutions obtained by the considered methods. These scenarios are divided into static, which provides a single set of tasks and resources for each entry, and dynamic, using a grid simulator used to observe the behavior of heuristics in Grid environments in real time.
网格系统中基于种群的独立批次调度元搜索引擎性能比较研究
最近有很多研究致力于网格系统中的调度和资源分配。在设计高效的网格调度器时,人们尤其致力于使用启发式和元启发式方法。在本文中,我们对基于群体的不同启发式方法(即遗传算法、记忆算法和细胞记忆算法)的性能进行了全面研究。目的是阐明在解决网格调度器执行时间限制下的多目标版本问题时,不同基于种群的方法的优势和局限性,以及它们与局部搜索方法(如 Tabu 搜索)的混合。我们考虑了一组在条目大小和静态/动态特征方面变化较大的场景,旨在判断所考虑的方法在求解质量方面的鲁棒性。这些场景分为静态场景和动态场景,静态场景为每个条目提供一组任务和资源,动态场景则使用网格模拟器来实时观察启发式方法在网格环境中的行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信