Efficient out-of-core sorting algorithms for the parallel disks model

DOI10.1016/j.jpdc.2011.07.004zbMath1225.68271DBLPjournals/jpdc/KundetiR11OpenAlexW2009612621WikidataQ38796908 ScholiaQ38796908MaRDI QIDQ645818

Sanguthevar Rajasekaran, Vamsi Krishna Kundeti

Publication date: 10 November 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3199586

zbMATH Keywords

sortingrandomized algorithmsmassive data setsexternal memorydisk sortingparallel disk model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for parallel memory, I: Two-level memories
• Simple randomized mergesort on parallel disks
• Optimal and Practical Algorithms for Sorting on the PDM
• A framework for simple sorting algorithms on parallel disk systems

This page was built for publication: Efficient out-of-core sorting algorithms for the parallel disks model