榕树-超立方体网络上的分区

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI:10.1109/FMPC.1990.89480

A. Bellaachia, A. Youssef

{"title":"榕树-超立方体网络上的分区","authors":"A. Bellaachia, A. Youssef","doi":"10.1109/FMPC.1990.89480","DOIUrl":null,"url":null,"abstract":"Partitioning strategies, as well as data structures for partitioning, are proposed and studied. Simulation results of internal, external, and total fragmentations for uniform and exponential distributions of request sizes are presented and discussed. The buddy system strategy of partitioning the hypercube is also simulated for comparison purposes. It is shown that the banyan-hypercube (BH) exhibits a better internal fragmentation than the hypercube, and for large request sizes the total fragmentation of the two networks is comparable. It is also shown that the internal fragmentation in BH decreases as the number of levels of BH increases.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Partitioning on the banyan-hypercube networks\",\"authors\":\"A. Bellaachia, A. Youssef\",\"doi\":\"10.1109/FMPC.1990.89480\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partitioning strategies, as well as data structures for partitioning, are proposed and studied. Simulation results of internal, external, and total fragmentations for uniform and exponential distributions of request sizes are presented and discussed. The buddy system strategy of partitioning the hypercube is also simulated for comparison purposes. It is shown that the banyan-hypercube (BH) exhibits a better internal fragmentation than the hypercube, and for large request sizes the total fragmentation of the two networks is comparable. It is also shown that the internal fragmentation in BH decreases as the number of levels of BH increases.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89480\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

提出并研究了分区策略以及分区的数据结构。给出并讨论了请求大小均匀分布和指数分布的内部、外部和总碎片的仿真结果。为了进行比较，还模拟了分区超立方体的伙伴系统策略。结果表明，榕树-超立方体(BH)比超立方体具有更好的内部碎片性，并且对于大请求大小，两种网络的总碎片性相当。结果还表明，随着黑洞层数的增加，黑洞内部破碎度减小。

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

查看原文本刊更多论文

Partitioning on the banyan-hypercube networks

Partitioning strategies, as well as data structures for partitioning, are proposed and studied. Simulation results of internal, external, and total fragmentations for uniform and exponential distributions of request sizes are presented and discussed. The buddy system strategy of partitioning the hypercube is also simulated for comparison purposes. It is shown that the banyan-hypercube (BH) exhibits a better internal fragmentation than the hypercube, and for large request sizes the total fragmentation of the two networks is comparable. It is also shown that the internal fragmentation in BH decreases as the number of levels of BH increases.<>

求助全文

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

来源期刊

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量