精确分割并行排序

Fan Dian, Tang Zhizhong
{"title":"精确分割并行排序","authors":"Fan Dian, Tang Zhizhong","doi":"10.1109/ISPAN.2004.1300464","DOIUrl":null,"url":null,"abstract":"A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Parallel sorting by exact splitting\",\"authors\":\"Fan Dian, Tang Zhizhong\",\"doi\":\"10.1109/ISPAN.2004.1300464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种适用于MIMD多处理器的精确分割并行排序算法。该算法采用柔性定位分配器算法对分配器进行精确定位。与其他同类算法相比,该算法的时间复杂度和通信成本都很好,并且在特定情况下甚至可以更好地受益于其定位分配器算法的灵活性。最后给出了该算法在局域网MPI环境下的实验结果,并与PSRS算法进行了比较。理论分析和实验结果表明,该算法具有效率高、可扩展性好、通信成本低、负载均衡性好等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Parallel sorting by exact splitting
A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its locating splitter algorithm. In addition, experimental results of the algorithm under an MPI environment on LANs are given and compared with those of the PSRS algorithm. According to the theoretical analysis and experimental results, the algorithm is preferable due to its virtues of high efficiency, scalability, low communication cost and good load balancing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信