{"title":"超立方体中的最佳多选择","authors":"Hong Shen","doi":"10.1080/10637199808947387","DOIUrl":null,"url":null,"abstract":"We study efficient parallel solutions to the problem of selecting r elements at specified ranks from a set of n arbitrary elements, known as multiselection, in a hypercube with p<n processors. We propose two parallel algorithms based on different approaches, where one requires processors to operate in the SIMD mode, and the other in the MIMD mode. Our SIMD algorithm runs in O(n ϵ min{r, log p}) time when p = n 1−r for any 0<ϵ<1, which is cost-optimal when r≥p. With the same number of processors, our MIMD algorithm runs in O(n ϵ logr) time and is cost-optimal for any values of r. Both algorithms are more efficient than straightforward solutions and that of direct simulation of the optimal EREW algorithm.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"OPTIMAL MULTISELECTION IN HYPERCUBES\",\"authors\":\"Hong Shen\",\"doi\":\"10.1080/10637199808947387\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study efficient parallel solutions to the problem of selecting r elements at specified ranks from a set of n arbitrary elements, known as multiselection, in a hypercube with p<n processors. We propose two parallel algorithms based on different approaches, where one requires processors to operate in the SIMD mode, and the other in the MIMD mode. Our SIMD algorithm runs in O(n ϵ min{r, log p}) time when p = n 1−r for any 0<ϵ<1, which is cost-optimal when r≥p. With the same number of processors, our MIMD algorithm runs in O(n ϵ logr) time and is cost-optimal for any values of r. Both algorithms are more efficient than straightforward solutions and that of direct simulation of the optimal EREW algorithm.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10637199808947387\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10637199808947387","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study efficient parallel solutions to the problem of selecting r elements at specified ranks from a set of n arbitrary elements, known as multiselection, in a hypercube with p
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
