分布式系统中用于负载均衡的任务迁移算法

Jea-Cheoul Ryou, Johnny S. K. Wong
{"title":"分布式系统中用于负载均衡的任务迁移算法","authors":"Jea-Cheoul Ryou, Johnny S. K. Wong","doi":"10.1109/HICSS.1989.48117","DOIUrl":null,"url":null,"abstract":"Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A task migration algorithm for load balancing in a distributed system\",\"authors\":\"Jea-Cheoul Ryou, Johnny S. K. Wong\",\"doi\":\"10.1109/HICSS.1989.48117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<<ETX>>\",\"PeriodicalId\":325958,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.48117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.48117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

任务从负载过重的处理器迁移到负载较轻或空闲的处理器是平衡所有处理器负载从而减少平均响应时间的一种方法。描述了一种基于所提出的集合策略的动态任务迁移协议,该协议用于最小化通信开销和减少每个处理器的处理开销。迁移的决定是基于处理器之间的信息交换。通过仿真验证了该算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A task migration algorithm for load balancing in a distributed system
Task migration from heavily loaded processors to lightly loaded or idle processors is one way to balance the load across all processors and thus reduce average response time. A description is given of a dynamic task migration protocol based on proposed set strategies which is used to minimize the communication cost and reduce the processing overhead at each processor. The decision to migrate is based on the information exchange between processors. The performance of the algorithm is examined by simulation.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信