{"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}
引用次数: 1
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
