Affiliation:
1. Kyoto Institute of Technology, Japan
Abstract
Sorting is a fundamental and essential problem required in the wide range of application fields, and so many sorting algorithms have been developed. Among those algorithms, heapsort is one of the most elegant and efficient sorting algorithms. But no parallel heapsort algorithm had been presented until the authors developed a restricted parallel algorithm a few years ago. This parallel algorithm had a restriction which makes it difficult to be used universally for general data sets. So, in this article, the authors present a modified parallel algorithm which is free from such restriction and can be used for any data set. This new algorithm can achieve almost the same performance as the restricted algorithm the authors developed before.
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Computer Science Applications,Software
Reference17 articles.
1. Multidimensional binary search trees used for associative searching
2. IBM Corp. (2016). POWER8 Processor User’s Manual for the Single-Chip Module. Retrieved from https://www.setphaserstostun.org/power8/POWER8_UM_v1.3_16MAR2016_pub.pdf
3. Fujisawa, K., Nunome, A., Shibayama, K., & Hirata, H. (2017). A Software Implementation of Speculative Memory. In Proceedings of the 18th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 2017) (pp. 437–443). ACIS & IEEE.
4. Fujisawa, K., Nunome, A., Shibayama, K., & Hirata, H. (2018). Design Space Exploration for Implementing a Software-based Speculative Memory System. International Journal of Software Innovation, 6(2), 37–49.
5. Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., & Hennessy, J. (1990). Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture (ISCA ’90) (pp. 15–26). ACM & IEEE.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献