Efficient selection and sorting schemes using coteries for processing large distributed files

DOI10.1006/JPDC.2002.1861MaRDI QIDQ701180zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 16 October 2002

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

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/141989/1/04.pdf

zbMATH Keywords

consensuscoterieslarge distributed filessampling techniqueselectionsorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
• Distributed Sorting
• Optimal Distributed Algorithms for Sorting and Ranking
• Distributed algorithms for selection in sets
• Sorting a distributed file in a network

Cited in

(1)

• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES

This page was built for publication: Efficient selection and sorting schemes using coteries for processing large distributed files

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