{"title":"基于实际网络的高效CRCW PRAM仿真","authors":"M. Hamdi","doi":"10.1109/ICPP.1994.100","DOIUrl":null,"url":null,"abstract":"A new interconnection network is proposed for the construction of massively parallel computers. The systematic construction of this network, denoted RCNFULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully connected nodes. Key communication characteristics and efficient routing algorithms are derivedfor RCN-FULL. An 0(log(N)) sorting algorithm is shown for RCN-FULL and RCN-FULL is proven to deterministically emulate the CRCW PRAM model, with only O(log{N)) degradation in time performance. Finally, the hardware cost for the RCNFULL is estimated as a function of its pin limitations and compared favorably to that of the hypercube.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient CRCW PRAM Emulation on Practical Networks\",\"authors\":\"M. Hamdi\",\"doi\":\"10.1109/ICPP.1994.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new interconnection network is proposed for the construction of massively parallel computers. The systematic construction of this network, denoted RCNFULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully connected nodes. Key communication characteristics and efficient routing algorithms are derivedfor RCN-FULL. An 0(log(N)) sorting algorithm is shown for RCN-FULL and RCN-FULL is proven to deterministically emulate the CRCW PRAM model, with only O(log{N)) degradation in time performance. Finally, the hardware cost for the RCNFULL is estimated as a function of its pin limitations and compared favorably to that of the hypercube.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient CRCW PRAM Emulation on Practical Networks
A new interconnection network is proposed for the construction of massively parallel computers. The systematic construction of this network, denoted RCNFULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully connected nodes. Key communication characteristics and efficient routing algorithms are derivedfor RCN-FULL. An 0(log(N)) sorting algorithm is shown for RCN-FULL and RCN-FULL is proven to deterministically emulate the CRCW PRAM model, with only O(log{N)) degradation in time performance. Finally, the hardware cost for the RCNFULL is estimated as a function of its pin limitations and compared favorably to that of the hypercube.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
