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

DOI10.1016/J.JPDC.2011.07.004zbMATH Open1225.68271DBLPjournals/jpdc/KundetiR11OpenAlexW2009612621WikidataQ38796908 ScholiaQ38796908MaRDI QIDQ645818FDOQ645818

Authors: 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

Recommendations

• Algorithms and Computation
• scientific article; zbMATH DE number 1792119
• Simple randomized mergesort on parallel disks
• scientific article; zbMATH DE number 1241382

zbMATH Keywords

randomized algorithmssortingexternal memorydisk sortingmassive data setsparallel disk model

Mathematics Subject Classification ID

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

Cites Work

• Algorithms for parallel memory, I: Two-level memories
• Simple randomized mergesort on parallel disks
• Distribution sort with randomized cycling
• Title not available (Why is that?)
• Optimal and Practical Algorithms for Sorting on the PDM
• Title not available (Why is that?)
• Title not available (Why is that?)
• A framework for simple sorting algorithms on parallel disk systems

Cited In (5)

• Title not available (Why is that?)
• Out-of-core computing on mesh connected computers
• Algorithms and Computation
• Slabpose columnsort: A new oblivious algorithm for out-of-core sorting on distributed-memory clusters
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645818)