Proceedings of the 16th International Conference on Applied Computing 2019 2019
DOI: 10.33965/ac2019_201912l014
|View full text |Cite
|
Sign up to set email alerts
|

High Performance Parallel Sort for Shared and Distributed Memory Mimd

Abstract: We present four high performance hybrid sorting methods developed for various parallel platforms: shared memory multiprocessors, distributed multiprocessors, and clusters taking advantage of existence of both shared and distributed memory. Merge sort, known for its stability, is used to design several of our algorithms. We improve its parallel performance by combining it with Quicksort. We present two models designed for shared memory MIMD (OpenMP): (a) a non-recursive Merge sort and (b) a hybrid Quicksort and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 6 publications
0
0
0
Order By: Relevance