Abstract
In this research, we illustrate comprehensive comparison between parallel sorting algorithm techniques, architectures and behaviors on logically or physically distributed environments. Especially on shared-memory with multiple processor machines and mesh connected multi-core processor environments. Also discuss how these algorithms designed to run under CPU and GPU processor base environments including In-Memory execution. Also deliberate the conversion approach of existing linear and non-linear algorithms into parallel sorting algorithms to support distributed process. In addition to that, we describe why algorithm architectures and behaviors are important rather than using comparison measurements such as algorithm complexity and performance under specified execution environments. And finally produce comprehensive comparison report for researches to use as a reference.
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
