Affiliation:
1. School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6, Canada
Abstract
We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 [Formula: see text]-relations and 18 p-relations), O (n/p) memory per processor and O (n/p) local computation. Experimental data indicates that the algorithm has very good performance in practice.
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Low-Depth Spatial Tree Algorithms;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27
2. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs;Theoretical Computer Science;2020-01
3. A Study of Integer Sorting on Multicores;Parallel Processing Letters;2018-12
4. A new efficient parallel algorithm for minimum spanning tree;INT SYM COMP ARCHIT;2018
5. A Parallel Algorithm for Minimum Spanning Tree on GPU;2017 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW);2017-10