{"title":"电路交换固定路由网络的脱机置换调度","authors":"A. Youssef","doi":"10.1109/FMPC.1992.234935","DOIUrl":null,"url":null,"abstract":"The problem of offline permutation scheduling on linear arrays, rings, hypercubes, and two-dimensional arrays, assuming the CSFR (circuit-switched fixed routing) model, is examined. Optimal permutation scheduling involves finding a minimum number of subsets of nonconflicting source-destination paths. Every subset of paths can be established to run in one pass. Optimal permutation scheduling on linear arrays is shown to be linear and on rings NP-complete. On hypercubes, the problem is NP-complete. However, the author discusses an O(N log N) algorithm that routes any permutation in two passes if the model is relaxed to allow for two routing rules, the e-cube rule and the e/sup -1/-cube rule. This complexity is reduced to O(N) hypercube-parallel time. An O(N log/sup 2/ N) bipartite-matching-based algorithm designed to schedule any permutation on p*q meshes/tori in q passes is considered.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Off-line permutation scheduling on circuit-switched fixed routing networks\",\"authors\":\"A. Youssef\",\"doi\":\"10.1109/FMPC.1992.234935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of offline permutation scheduling on linear arrays, rings, hypercubes, and two-dimensional arrays, assuming the CSFR (circuit-switched fixed routing) model, is examined. Optimal permutation scheduling involves finding a minimum number of subsets of nonconflicting source-destination paths. Every subset of paths can be established to run in one pass. Optimal permutation scheduling on linear arrays is shown to be linear and on rings NP-complete. On hypercubes, the problem is NP-complete. However, the author discusses an O(N log N) algorithm that routes any permutation in two passes if the model is relaxed to allow for two routing rules, the e-cube rule and the e/sup -1/-cube rule. This complexity is reduced to O(N) hypercube-parallel time. An O(N log/sup 2/ N) bipartite-matching-based algorithm designed to schedule any permutation on p*q meshes/tori in q passes is considered.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"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.234935\",\"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.234935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Off-line permutation scheduling on circuit-switched fixed routing networks
The problem of offline permutation scheduling on linear arrays, rings, hypercubes, and two-dimensional arrays, assuming the CSFR (circuit-switched fixed routing) model, is examined. Optimal permutation scheduling involves finding a minimum number of subsets of nonconflicting source-destination paths. Every subset of paths can be established to run in one pass. Optimal permutation scheduling on linear arrays is shown to be linear and on rings NP-complete. On hypercubes, the problem is NP-complete. However, the author discusses an O(N log N) algorithm that routes any permutation in two passes if the model is relaxed to allow for two routing rules, the e-cube rule and the e/sup -1/-cube rule. This complexity is reduced to O(N) hypercube-parallel time. An O(N log/sup 2/ N) bipartite-matching-based algorithm designed to schedule any permutation on p*q meshes/tori in q passes is considered.<>
![[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
