{"title":"计算机与通信中的基本问题","authors":"S. Rajasekaran, Jaime I. Dávila","doi":"10.1109/ICPADS.2004.4","DOIUrl":null,"url":null,"abstract":"Partitioned Optical Passive Stars (POPS) network has been proposedrecently as a desirable model of parallel computing. Many papers have been published that address fundamental problems on these networks. Packet routing is onesuch important problem. We present a randomized algorithm in this paper thatperforms better than the best prior algorithms. We also present a randomized algorithm for selection on the POPS network.","PeriodicalId":281075,"journal":{"name":"International Conference on Parallel and Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fundamental Problem in Computer and Communication\",\"authors\":\"S. Rajasekaran, Jaime I. Dávila\",\"doi\":\"10.1109/ICPADS.2004.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partitioned Optical Passive Stars (POPS) network has been proposedrecently as a desirable model of parallel computing. Many papers have been published that address fundamental problems on these networks. Packet routing is onesuch important problem. We present a randomized algorithm in this paper thatperforms better than the best prior algorithms. We also present a randomized algorithm for selection on the POPS network.\",\"PeriodicalId\":281075,\"journal\":{\"name\":\"International Conference on Parallel and Distributed Systems\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.2004.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.2004.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Fundamental Problem in Computer and Communication
Partitioned Optical Passive Stars (POPS) network has been proposedrecently as a desirable model of parallel computing. Many papers have been published that address fundamental problems on these networks. Packet routing is onesuch important problem. We present a randomized algorithm in this paper thatperforms better than the best prior algorithms. We also present a randomized algorithm for selection on the POPS network.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
