金字塔结构中的路由分析

Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993 Pub Date : 1993-05-24 DOI:10.1109/NAECON.1993.290835

T. Mzaik, S. Chandra, D. Panda, J. Jagadeesh

{"title":"金字塔结构中的路由分析","authors":"T. Mzaik, S. Chandra, D. Panda, J. Jagadeesh","doi":"10.1109/NAECON.1993.290835","DOIUrl":null,"url":null,"abstract":"Pyramid machines are massively parallel systems motivated by image processing applications. The architecture consists of several layers of mesh connected nodes of decreasing dimensions. In this paper, we investigate general node-to-node routing in pyramids. We propose two routing algorithms neighbor-tree (NT) and neighbor-descedent-tree (NDT). For each routing algorithm, we find the average and maximum message latency for each of the three flow control schemes: packet switching, circuit switching, and wormhole routing. The performance of the proposed algorithms is evaluated using a discrete event simulation library (SMPL) and is compared with pyramid mesh and tree routing.<<ETX>>","PeriodicalId":183796,"journal":{"name":"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of routing in pyramid architectures\",\"authors\":\"T. Mzaik, S. Chandra, D. Panda, J. Jagadeesh\",\"doi\":\"10.1109/NAECON.1993.290835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pyramid machines are massively parallel systems motivated by image processing applications. The architecture consists of several layers of mesh connected nodes of decreasing dimensions. In this paper, we investigate general node-to-node routing in pyramids. We propose two routing algorithms neighbor-tree (NT) and neighbor-descedent-tree (NDT). For each routing algorithm, we find the average and maximum message latency for each of the three flow control schemes: packet switching, circuit switching, and wormhole routing. The performance of the proposed algorithms is evaluated using a discrete event simulation library (SMPL) and is compared with pyramid mesh and tree routing.<<ETX>>\",\"PeriodicalId\":183796,\"journal\":{\"name\":\"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAECON.1993.290835\",\"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 of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON.1993.290835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

金字塔机是由图像处理应用驱动的大规模并行系统。该体系结构由数层网格连接的节点组成，节点的维数递减。本文研究金字塔中一般的节点到节点路由。提出了邻居树(NT)和邻居后裔树(NDT)两种路由算法。对于每种路由算法，我们找到了三种流控制方案(分组交换、电路交换和虫洞路由)的平均和最大消息延迟。利用离散事件模拟库(SMPL)对所提算法的性能进行了评估，并与金字塔网格和树路由进行了比较

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

查看原文本刊更多论文

Analysis of routing in pyramid architectures

Pyramid machines are massively parallel systems motivated by image processing applications. The architecture consists of several layers of mesh connected nodes of decreasing dimensions. In this paper, we investigate general node-to-node routing in pyramids. We propose two routing algorithms neighbor-tree (NT) and neighbor-descedent-tree (NDT). For each routing algorithm, we find the average and maximum message latency for each of the three flow control schemes: packet switching, circuit switching, and wormhole routing. The performance of the proposed algorithms is evaluated using a discrete event simulation library (SMPL) and is compared with pyramid mesh and tree routing.<>

求助全文

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

来源期刊

Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993

自引率

0.00%

发文量