多级互联网络的冲突分析

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 1994-01-31 DOI:10.1109/MASCOT.1994.284435

Yashovardhan R. Potlapalli, D. Agrawal

{"title":"多级互联网络的冲突分析","authors":"Yashovardhan R. Potlapalli, D. Agrawal","doi":"10.1109/MASCOT.1994.284435","DOIUrl":null,"url":null,"abstract":"In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Conflict analysis of multistage interconnection networks\",\"authors\":\"Yashovardhan R. Potlapalli, D. Agrawal\",\"doi\":\"10.1109/MASCOT.1994.284435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<<ETX>>\",\"PeriodicalId\":288344,\"journal\":{\"name\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.1994.284435\",\"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 International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在大多数应用程序中，一些排列比其他排列使用得更频繁。因此，有必要确定各种min实现常用置换集的效率。众所周知，确定实现排列的准确次数的问题是np完全的。我们提出了一种有效的算法，通过首先找到一个用于冲突检测的O(NlogN)算法来确定传递次数的上限。

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

查看原文本刊更多论文

Conflict analysis of multistage interconnection networks

In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<>

求助全文

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

来源期刊

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

自引率

0.00%

发文量