可变切换时间任务的智能多机调度

Fei Lei, Y. Zou, Feng Zeng
{"title":"可变切换时间任务的智能多机调度","authors":"Fei Lei, Y. Zou, Feng Zeng","doi":"10.1109/WCICA.2004.1343058","DOIUrl":null,"url":null,"abstract":"To find an optimal multi-machine schedule for a set of tasks with variable switch time, an optimal model was proposed, and a new intelligent algorithm with an adaptive structure was designed for less delay time and higher quality of service. If the server is under low average load, it used genetic algorithm and advanced greedy algorithm jointly to achieve a minimum task abandon ratio and a maximum task value, or else only advanced greedy algorithm was used to minimize delay time. The scheduler adopted runtime incremental parallel scheduling (RIPS) strategy, which combines the advantages of static and dynamic scheduling. The several simulation experiments show that the proposed schedule algorithm is valid and feasible.","PeriodicalId":331407,"journal":{"name":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intelligent multi-machine scheduling on tasks with variable switch time\",\"authors\":\"Fei Lei, Y. Zou, Feng Zeng\",\"doi\":\"10.1109/WCICA.2004.1343058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To find an optimal multi-machine schedule for a set of tasks with variable switch time, an optimal model was proposed, and a new intelligent algorithm with an adaptive structure was designed for less delay time and higher quality of service. If the server is under low average load, it used genetic algorithm and advanced greedy algorithm jointly to achieve a minimum task abandon ratio and a maximum task value, or else only advanced greedy algorithm was used to minimize delay time. The scheduler adopted runtime incremental parallel scheduling (RIPS) strategy, which combines the advantages of static and dynamic scheduling. The several simulation experiments show that the proposed schedule algorithm is valid and feasible.\",\"PeriodicalId\":331407,\"journal\":{\"name\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2004.1343058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2004.1343058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了寻找具有可变切换时间的任务组的最优多机调度,提出了最优模型,并设计了一种具有自适应结构的智能算法,以实现更小的延迟时间和更高的服务质量。当服务器平均负载较低时,采用遗传算法和高级贪心算法联合实现最小任务放弃率和最大任务值,否则仅采用高级贪心算法实现最小延迟时间。该调度程序采用运行时增量并行调度(RIPS)策略,结合了静态调度和动态调度的优点。仿真实验表明,该调度算法是有效可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Intelligent multi-machine scheduling on tasks with variable switch time
To find an optimal multi-machine schedule for a set of tasks with variable switch time, an optimal model was proposed, and a new intelligent algorithm with an adaptive structure was designed for less delay time and higher quality of service. If the server is under low average load, it used genetic algorithm and advanced greedy algorithm jointly to achieve a minimum task abandon ratio and a maximum task value, or else only advanced greedy algorithm was used to minimize delay time. The scheduler adopted runtime incremental parallel scheduling (RIPS) strategy, which combines the advantages of static and dynamic scheduling. The several simulation experiments show that the proposed schedule algorithm is valid and feasible.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信