{"title":"一个模归并排序网络","authors":"K. Liszka, K. Batcher","doi":"10.1109/FMPC.1992.234892","DOIUrl":null,"url":null,"abstract":"The odd-even merge is a widely used and generally accepted merging network that uses O(N log/sup 2/N) comparators with O(log/sup 2/N) delay. A novel merging network is presented that generalizes the technique used in the odd-even merge. It is based on the division of the input keys by a specified modulus, not limited to 2. A special comparator is used in the final merge step that accepts m input lines and produces m sorted items, where m is the modulus selected for the merge. Alternatives are discussed that apply to the bitonic merging network.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A modulo merge sorting network\",\"authors\":\"K. Liszka, K. Batcher\",\"doi\":\"10.1109/FMPC.1992.234892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The odd-even merge is a widely used and generally accepted merging network that uses O(N log/sup 2/N) comparators with O(log/sup 2/N) delay. A novel merging network is presented that generalizes the technique used in the odd-even merge. It is based on the division of the input keys by a specified modulus, not limited to 2. A special comparator is used in the final merge step that accepts m input lines and produces m sorted items, where m is the modulus selected for the merge. Alternatives are discussed that apply to the bitonic merging network.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234892\",\"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 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The odd-even merge is a widely used and generally accepted merging network that uses O(N log/sup 2/N) comparators with O(log/sup 2/N) delay. A novel merging network is presented that generalizes the technique used in the odd-even merge. It is based on the division of the input keys by a specified modulus, not limited to 2. A special comparator is used in the final merge step that accepts m input lines and produces m sorted items, where m is the modulus selected for the merge. Alternatives are discussed that apply to the bitonic merging network.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
