网格连接多计算机中最优子网格分配策略研究

Geunmo Kim, H. Yoon
{"title":"网格连接多计算机中最优子网格分配策略研究","authors":"Geunmo Kim, H. Yoon","doi":"10.1142/S0129053396000094","DOIUrl":null,"url":null,"abstract":"The submesh allocation problem is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. An efficient submesh allocation strategy is required for achieving high performance on mesh multicomputers. In this paper, we propose a new best fit submesh allocation strategy. The proposed strategy maintains and uses a free submesh list to get global information for free submeshes. For an allocation request, the strategy tries to allocate a best fit submesh which causes the least amount of potential fragmentation so as to preserve the large free submeshes to be as many as possible and to prevent processor fragmentation for later requests. For this purpose, we introduce a novel function for quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the complete submesh recognition capability. Extensive simulation is carried out to compare it with the previous strategies, and experimental results indicate that it exhibits the best performance along with an about 30% average improvement over the previous best strategy.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"19 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Best Fit Submesh Allocation Strategy in Mesh-Connected Multicomputers\",\"authors\":\"Geunmo Kim, H. Yoon\",\"doi\":\"10.1142/S0129053396000094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The submesh allocation problem is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. An efficient submesh allocation strategy is required for achieving high performance on mesh multicomputers. In this paper, we propose a new best fit submesh allocation strategy. The proposed strategy maintains and uses a free submesh list to get global information for free submeshes. For an allocation request, the strategy tries to allocate a best fit submesh which causes the least amount of potential fragmentation so as to preserve the large free submeshes to be as many as possible and to prevent processor fragmentation for later requests. For this purpose, we introduce a novel function for quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the complete submesh recognition capability. Extensive simulation is carried out to compare it with the previous strategies, and experimental results indicate that it exhibits the best performance along with an about 30% average improvement over the previous best strategy.\",\"PeriodicalId\":270006,\"journal\":{\"name\":\"Int. J. High Speed Comput.\",\"volume\":\"19 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. High Speed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129053396000094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. High Speed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129053396000094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

子网格分配问题是识别和定位可以容纳指定大小的子网格请求的空闲子网格。为了在网格多计算机上实现高性能,需要一种有效的子网格分配策略。本文提出了一种新的最佳拟合子网格分配策略。该策略维护并使用一个空闲子网格列表来获取空闲子网格的全局信息。对于一个分配请求,该策略尝试分配一个最适合的子网格,它会导致最少的潜在碎片,从而尽可能多地保留大的空闲子网格,并防止处理器在以后的请求中出现碎片。为此,我们引入了一个新的函数来量化子网格的潜在碎片程度。该策略具有完整的子网格识别能力。实验结果表明,该策略表现出最佳性能,比之前的最佳策略平均提高约30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Best Fit Submesh Allocation Strategy in Mesh-Connected Multicomputers
The submesh allocation problem is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. An efficient submesh allocation strategy is required for achieving high performance on mesh multicomputers. In this paper, we propose a new best fit submesh allocation strategy. The proposed strategy maintains and uses a free submesh list to get global information for free submeshes. For an allocation request, the strategy tries to allocate a best fit submesh which causes the least amount of potential fragmentation so as to preserve the large free submeshes to be as many as possible and to prevent processor fragmentation for later requests. For this purpose, we introduce a novel function for quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the complete submesh recognition capability. Extensive simulation is carried out to compare it with the previous strategies, and experimental results indicate that it exhibits the best performance along with an about 30% average improvement over the previous best strategy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信