洗牌交换网络的可重排性

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

H. Çam, J. Fortes

{"title":"洗牌交换网络的可重排性","authors":"H. Çam, J. Fortes","doi":"10.1109/FMPC.1990.89476","DOIUrl":null,"url":null,"abstract":"A proof for the rearrangeability of (2n-1)-stage shuffle-exchange networks with N=2/sup n/ inputs is given. The proof makes use of the notion of balanced matrices for representing passable permutations through a shuffle-exchange network. Because the proof is not constructive, it does not lead to a routing algorithm directly. Therefore, a heuristic algorithm is provided for routing arbitrary permutations on the (2n-1)-stage shuffle-exchange network. A new proof for the rearrangeability of the (2n-1) stage reduced Omega /sub N/ Omega /sub N//sup -1/ network is also given, and a routing algorithm using precomputed digit-controlled routing tags is presented.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Rearrangeability of shuffle-exchange networks\",\"authors\":\"H. Çam, J. Fortes\",\"doi\":\"10.1109/FMPC.1990.89476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A proof for the rearrangeability of (2n-1)-stage shuffle-exchange networks with N=2/sup n/ inputs is given. The proof makes use of the notion of balanced matrices for representing passable permutations through a shuffle-exchange network. Because the proof is not constructive, it does not lead to a routing algorithm directly. Therefore, a heuristic algorithm is provided for routing arbitrary permutations on the (2n-1)-stage shuffle-exchange network. A new proof for the rearrangeability of the (2n-1) stage reduced Omega /sub N/ Omega /sub N//sup -1/ network is also given, and a routing algorithm using precomputed digit-controlled routing tags is presented.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"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.89476\",\"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.89476","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

给出了N=2/sup N /输入的(2n-1)阶洗牌交换网络的可重排性证明。证明利用平衡矩阵的概念来表示通过洗牌交换网络的可通过置换。由于该证明不具有建设性，因此它不会直接导致路由算法。因此，提出了一种用于(2n-1)级洗牌交换网络上任意排列路由的启发式算法。给出了(2n-1)阶简化的Omega /sub N/ Omega /sub N//sup -1/网络的可重排性的新证明，并提出了一种使用预计算的数字控制路由标签的路由算法。

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

查看原文本刊更多论文

Rearrangeability of shuffle-exchange networks

A proof for the rearrangeability of (2n-1)-stage shuffle-exchange networks with N=2/sup n/ inputs is given. The proof makes use of the notion of balanced matrices for representing passable permutations through a shuffle-exchange network. Because the proof is not constructive, it does not lead to a routing algorithm directly. Therefore, a heuristic algorithm is provided for routing arbitrary permutations on the (2n-1)-stage shuffle-exchange network. A new proof for the rearrangeability of the (2n-1) stage reduced Omega /sub N/ Omega /sub N//sup -1/ network is also given, and a routing algorithm using precomputed digit-controlled routing tags is presented.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量