{"title":"Optimal algorithms for selection on a mesh-connected processor array","authors":"D. Krizanc, L. Narayanan","doi":"10.1109/SPDP.1992.242761","DOIUrl":null,"url":null,"abstract":"The authors present novel algorithms for selecting an elements of specified rank among N=n/sup 2/ elements on an n*n mesh-connected processor array, in a variety of settings. They give: (1) an optimal randomized algorithm for selecting the element of rank k out of N, 1<or=k<or=N, at any processor that is at least 0.5n-o(n) steps away from the middle processor; (2) an optimal deterministic algorithm for selecting the element of rank k out of N, 1<or=k<or=N, at any processor, when the elements are drawn from the set (1,. . .,N/sup 1- in /), where 0< in <or=1; and an optimal deterministic algorithm for selecting the element of rank k out of N, at any processor, when 1<or=k<or=N/sup 1- in /, where 0< in <or=1.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
The authors present novel algorithms for selecting an elements of specified rank among N=n/sup 2/ elements on an n*n mesh-connected processor array, in a variety of settings. They give: (1) an optimal randomized algorithm for selecting the element of rank k out of N, 1>