可重构d维网格上的令牌分布

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI:10.1109/ICAPP.1995.472203

G. Turner, H. Schroder

{"title":"可重构d维网格上的令牌分布","authors":"G. Turner, H. Schroder","doi":"10.1109/ICAPP.1995.472203","DOIUrl":null,"url":null,"abstract":"We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy /spl Delta/ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most 2n/spl Delta/(T+4d) steps.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Token distribution on reconfigurable d-dimensional meshes\",\"authors\":\"G. Turner, H. Schroder\",\"doi\":\"10.1109/ICAPP.1995.472203\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy /spl Delta/ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most 2n/spl Delta/(T+4d) steps.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472203\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

我们提出了一种算法来解决令牌分发问题，这是负载平衡问题的一个静态变体，在d维，可重构网格上，具有环面连接和边长n。在这种计算模型下没有其他算法被提出。我们表明，对于令牌大小T，每个PE的最大和最小令牌数量之间的差异/spl Delta/最多可以在2n/spl Delta/(T+4d)步中减少到1。

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

查看原文本刊更多论文

Token distribution on reconfigurable d-dimensional meshes

We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy /spl Delta/ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most 2n/spl Delta/(T+4d) steps.<>

求助全文

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

来源期刊

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing

自引率

0.00%

发文量