{"title":"基于可重构流水线系统的线性阵列快速并行选择","authors":"Yijie Han, Y. Pan, Hong Shen","doi":"10.1109/FMPC.1999.750611","DOIUrl":null,"url":null,"abstract":"The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical bus technology. We show that the selection problem can be solved on the LARPBS model in O((log log N)/sup 2//log log log N) bus cycles deterministically. To our best knowledge, this is the best deterministic selection algorithm on the LARPBS model.","PeriodicalId":405655,"journal":{"name":"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fast parallel selection on the linear array with reconfigurable pipelined bus system\",\"authors\":\"Yijie Han, Y. Pan, Hong Shen\",\"doi\":\"10.1109/FMPC.1999.750611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical bus technology. We show that the selection problem can be solved on the LARPBS model in O((log log N)/sup 2//log log log N) bus cycles deterministically. To our best knowledge, this is the best deterministic selection algorithm on the LARPBS model.\",\"PeriodicalId\":405655,\"journal\":{\"name\":\"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1999.750611\",\"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. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1999.750611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast parallel selection on the linear array with reconfigurable pipelined bus system
The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical bus technology. We show that the selection problem can be solved on the LARPBS model in O((log log N)/sup 2//log log log N) bus cycles deterministically. To our best knowledge, this is the best deterministic selection algorithm on the LARPBS model.