Parallel External Merge Sort is a parallel sorting algorithm that extends the external merge sort paradigm by concurrently merging sorted subsequences from external storage across multiple processing units to accelerate the sorting of large datasets that exceed main memory capacity.
5
Publications
110
Citations
9
Authors
4
Institutions
Publications per year
2017–2026
0
Parents
Publications
5
System issues in parallel sorting for database systems
Balakrishna R. Iyer, D.M. Dias · 2002 · 38 citations
From parallel to external list ranking
Jop F. Sibeyn · MPG.PuRe (Max Planck Society) · 1997 · 21 citations · Full text
Optimal Deterministic Sorting on Parallel Disks
Mark H. Nodine, Jeffrey Scott Vitter · 1992 · 11 citations
1–5 of 5
Authors
9
- NL
1
h-index
- DF
1
h-index
- MH
1
h-index
- BR
1
h-index
- OS
1
h-index
1–5 of 9
Institutions
4
IBM (United States)
Armonk, United States
1 h-index
1 publications
38 citations
Christian-Albrechts-Universität zu Kiel
Kiel, Germany
1 h-index
3 publications
54 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
38 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
21 citations
1–4 of 4
Venues
- MPG.PuRe (Max Planck Society)
Repository · 1 publications · 21 citations
1
h-index
- PLoS ONE
1 publications · 22 citations
1
h-index
1–2