{"title":"时空最优并行集运算","authors":"Xiaojun Guan, M. A. Langston","doi":"10.1109/PARBSE.1990.77137","DOIUrl":null,"url":null,"abstract":"The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k<or=n/(log n). Moreover, the methods are completely general in that they are stable (records with identical keys retain their original relative order), they do not modify records (even temporarily) as they execute, and they require no information other than a record's key.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Time-space optimal parallel set operations\",\"authors\":\"Xiaojun Guan, M. A. Langston\",\"doi\":\"10.1109/PARBSE.1990.77137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k<or=n/(log n). Moreover, the methods are completely general in that they are stable (records with identical keys retain their original relative order), they do not modify records (even temporarily) as they execute, and they require no information other than a record's key.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77137\",\"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. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
