{"title":"PEC网络的路由算法","authors":"C.C.S. Lin, V. K. Prasanna","doi":"10.1109/FMPC.1992.234891","DOIUrl":null,"url":null,"abstract":"A routing algorithm is shown which can route in O( square root log N*2/sup square root 2logN/) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N*2/sup square root 2logN/) parallel steps.<<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":"5","resultStr":"{\"title\":\"A routing algorithm for PEC networks\",\"authors\":\"C.C.S. Lin, V. K. Prasanna\",\"doi\":\"10.1109/FMPC.1992.234891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A routing algorithm is shown which can route in O( square root log N*2/sup square root 2logN/) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N*2/sup square root 2logN/) parallel steps.<<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\":\"5\",\"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.234891\",\"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.234891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A routing algorithm is shown which can route in O( square root log N*2/sup square root 2logN/) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N*2/sup square root 2logN/) parallel steps.<>