网格连接计算机上的路由算法

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234863

Q. Gu, J. Gu

{"title":"网格连接计算机上的路由算法","authors":"Q. Gu, J. Gu","doi":"10.1109/FMPC.1992.234863","DOIUrl":null,"url":null,"abstract":"The authors present two algorithms for the 1-1 routing problems on a mesh-connected computer. The first algorithm, with a queue size of 28, solves the 1-1 routing problem on an n*n mesh-connected computer in 2n+O(1) steps. This improves the previous result of queue size 75. The second algorithm solves the problem in 2n-2 steps with queue size 12t/sub s//s where t/sub s/ is the time for sorting an s*s mesh into a row major order for all s>or=1. This result improves the previous result of size 18.67 t/sub s//s. Both algorithms have important applications in reducing the hardware cost on a mesh-connected computer.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Routing algorithms on a mesh-connected computer\",\"authors\":\"Q. Gu, J. Gu\",\"doi\":\"10.1109/FMPC.1992.234863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present two algorithms for the 1-1 routing problems on a mesh-connected computer. The first algorithm, with a queue size of 28, solves the 1-1 routing problem on an n*n mesh-connected computer in 2n+O(1) steps. This improves the previous result of queue size 75. The second algorithm solves the problem in 2n-2 steps with queue size 12t/sub s//s where t/sub s/ is the time for sorting an s*s mesh into a row major order for all s>or=1. This result improves the previous result of size 18.67 t/sub s//s. Both algorithms have important applications in reducing the hardware cost on a mesh-connected computer.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234863\",\"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 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了在网格连接计算机上求解1-1路由问题的两种算法。第一个算法，队列大小为28，在一个n*n网格连接的计算机上，用2n+O(1)步解决1-1路由问题。这改进了之前队列大小为75的结果。第二种算法以2n-2步解决问题，队列大小为12t/sub s//s，其中t/sub s/是将s*s网格排序为所有s>或=1的行主顺序的时间。这个结果改进了之前尺寸为18.67 t/sub /s //s的结果。这两种算法在降低网格连接计算机的硬件成本方面都有重要的应用。

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

查看原文本刊更多论文

Routing algorithms on a mesh-connected computer

The authors present two algorithms for the 1-1 routing problems on a mesh-connected computer. The first algorithm, with a queue size of 28, solves the 1-1 routing problem on an n*n mesh-connected computer in 2n+O(1) steps. This improves the previous result of queue size 75. The second algorithm solves the problem in 2n-2 steps with queue size 12t/sub s//s where t/sub s/ is the time for sorting an s*s mesh into a row major order for all s>or=1. This result improves the previous result of size 18.67 t/sub s//s. Both algorithms have important applications in reducing the hardware cost on a mesh-connected computer.<>

求助全文

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

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量