用生成树来平衡多处理器的动态负载

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI:10.1109/DMCC.1991.633134

R. Melhem, K. Pruhs, T. Znati

{"title":"用生成树来平衡多处理器的动态负载","authors":"R. Melhem, K. Pruhs, T. Znati","doi":"10.1109/DMCC.1991.633134","DOIUrl":null,"url":null,"abstract":"We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Using Spanning-Trees for Balancing Dynamic Load on Multiprocessors\",\"authors\":\"R. Melhem, K. Pruhs, T. Znati\",\"doi\":\"10.1109/DMCC.1991.633134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.\",\"PeriodicalId\":313314,\"journal\":{\"name\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1991.633134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们考虑负载平衡问题，以最小化动态计算的成本，包括迁移的成本。我们分析了几种常见架构下基于扩散的算法的相关成本。我们介绍了Ripple负载平衡范式，它比扩散方法有几个优点，包括灵活性和更快的收敛性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Using Spanning-Trees for Balancing Dynamic Load on Multiprocessors

We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The Sixth Distributed Memory Computing Conference, 1991. Proceedings

自引率

0.00%

发文量