A simple and efficient parallel disk mergesort

DOI10.1007/S00224-002-1031-0MaRDI QIDQ1601739zbMATH OpenOpenAlexFDO

Authors Jeffrey Scott Vitter, Rakesh D. Barve

Publication date 27 June 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1808/7223

zbMATH Keywords

disk-striped mergesortsimple randomized merging

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1241382
• scientific article; zbMATH DE number 1792107
• Simple randomized mergesort on parallel disks
• A framework for simple sorting algorithms on parallel disk systems
• Algorithms for parallel memory, I: Two-level memories

Cited in

(8)

• The parallel neighbour sort and 2-way merge algorithm
• Merging sorted runs using large main memory
• Simple randomized mergesort on parallel disks
• Parallel database sorting
• A Pictorial Description of Cole’s Parallel Merge Sort
• scientific article; zbMATH DE number 1241382 (Why is no real title available?)
• scientific article; zbMATH DE number 1926666 (Why is no real title available?)
• A framework for simple sorting algorithms on parallel disk systems

Describes a project that uses

Uses Software

• TPIE

This page was built for publication: A simple and efficient parallel disk mergesort

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