分布式负载均衡的实时优化

E. Haddad
{"title":"分布式负载均衡的实时优化","authors":"E. Haddad","doi":"10.1109/WPDRTS.1994.365650","DOIUrl":null,"url":null,"abstract":"The problem of optimizing the balancing of processing load originating at the various sites of a bus-interconnected set of heterogeneous processors is examined. The distributed load is assumed to be arbitrarily divisible with no particular affinity to any of the processing sites. Minimization of processing completion time is the objective of load redistribution via the limited communication capacity of the bus. The optimal amounts of load exchange among the sending and receiving processors are derived. Load transfer across the bus proceeds concurrently with load execution at the various sites. Absolute optimality can be achieved only if synchronization delay is eliminated through proper real-time delivery of communicated load. The optimal load transmission and delivery time-schedule is formulated in terms of the load transfer rates pertaining to each sending and receiving site. The available communication rate of the bus is partitioned among the site rates, which are found to be piece-wise constant functions of time.<<ETX>>","PeriodicalId":275053,"journal":{"name":"Second Workshop on Parallel and Distributed Real-Time Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Real-time optimization of distributed load balancing\",\"authors\":\"E. Haddad\",\"doi\":\"10.1109/WPDRTS.1994.365650\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of optimizing the balancing of processing load originating at the various sites of a bus-interconnected set of heterogeneous processors is examined. The distributed load is assumed to be arbitrarily divisible with no particular affinity to any of the processing sites. Minimization of processing completion time is the objective of load redistribution via the limited communication capacity of the bus. The optimal amounts of load exchange among the sending and receiving processors are derived. Load transfer across the bus proceeds concurrently with load execution at the various sites. Absolute optimality can be achieved only if synchronization delay is eliminated through proper real-time delivery of communicated load. The optimal load transmission and delivery time-schedule is formulated in terms of the load transfer rates pertaining to each sending and receiving site. The available communication rate of the bus is partitioned among the site rates, which are found to be piece-wise constant functions of time.<<ETX>>\",\"PeriodicalId\":275053,\"journal\":{\"name\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1994.365650\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1994.365650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

研究了在总线互连的异构处理器集合的各个站点上产生的处理负载的优化平衡问题。假定分布式负载是任意可分的,与任何处理站点没有特定的关联。最小化处理完成时间是通过总线有限的通信容量进行负载重新分配的目标。导出了发送和接收处理器之间负载交换的最佳量。总线上的负载传输与各个站点上的负载执行同时进行。只有通过适当的实时传输通信负载来消除同步延迟,才能实现绝对的最优性。根据与每个发送点和接收点有关的负载转移率,制定了最佳负载传输和交付时间表。总线的可用通信速率在站点速率之间进行划分,站点速率是时间的分段常数函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Real-time optimization of distributed load balancing
The problem of optimizing the balancing of processing load originating at the various sites of a bus-interconnected set of heterogeneous processors is examined. The distributed load is assumed to be arbitrarily divisible with no particular affinity to any of the processing sites. Minimization of processing completion time is the objective of load redistribution via the limited communication capacity of the bus. The optimal amounts of load exchange among the sending and receiving processors are derived. Load transfer across the bus proceeds concurrently with load execution at the various sites. Absolute optimality can be achieved only if synchronization delay is eliminated through proper real-time delivery of communicated load. The optimal load transmission and delivery time-schedule is formulated in terms of the load transfer rates pertaining to each sending and receiving site. The available communication rate of the bus is partitioned among the site rates, which are found to be piece-wise constant functions of time.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Real-time optimization of distributed load balancing Issues in integrating reusable Ada 9X objects into distributed real-time systems Use of concurrency enhancement in off-line schedule construction The advanced distributed ramp metering system (ARMS) Real-time issues in distributed multimedia systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1