{"title":"PRAM上工作时间最优k-归并算法","authors":"Tatsuya Hayashi, K. Nakano, S. Olariu","doi":"10.1109/IPPS.1997.580913","DOIUrl":null,"url":null,"abstract":"The k-merge problem, given a collection of k, (2/spl les/k/spl les/n), sorted sequences of total length a asks to merge them into a new sorted sequence. The main contribution of the work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically their k-merge algorithms perform O(nlogk) work and run in O(log n) time on the EREW-PRAM and in O (log log n+log k) time on the CREW-PRAM, respectively.","PeriodicalId":145892,"journal":{"name":"Proceedings 11th International Parallel Processing Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Work-time optimal k-merge algorithms on the PRAM\",\"authors\":\"Tatsuya Hayashi, K. Nakano, S. Olariu\",\"doi\":\"10.1109/IPPS.1997.580913\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The k-merge problem, given a collection of k, (2/spl les/k/spl les/n), sorted sequences of total length a asks to merge them into a new sorted sequence. The main contribution of the work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically their k-merge algorithms perform O(nlogk) work and run in O(log n) time on the EREW-PRAM and in O (log log n+log k) time on the CREW-PRAM, respectively.\",\"PeriodicalId\":145892,\"journal\":{\"name\":\"Proceedings 11th International Parallel Processing Symposium\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1997.580913\",\"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 11th International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1997.580913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The k-merge problem, given a collection of k, (2/spl les/k/spl les/n), sorted sequences of total length a asks to merge them into a new sorted sequence. The main contribution of the work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically their k-merge algorithms perform O(nlogk) work and run in O(log n) time on the EREW-PRAM and in O (log log n+log k) time on the CREW-PRAM, respectively.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
