Abstract
AbstractInteger sorting is a special case of the sorting problem, where the elements have integer values in the range [0,n–1]. We evaluate the behavior and performance of two parallel integer sorting algorithms in practice. We have used Ada tasks facilities to simulate the parallel sorting algorithms on a machine consisting of 4-processors. Both algorithms are based on self-index method on EREW PRAM [3,6]. Also, we study the scalability of the two parallel algorithms and compare between them.KeywordsParallel AlgorithmShared MemorySorting ProblemRandom Access MachineParallel Random Access MachineThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call