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

DOI10.1142/S0129054103002229MaRDI QIDQ5696958zbMATH OpenOpenAlexFDO

Authors David S. L. Wei, Kshirasagar Naik, Sy-Yen Kuo, Sanguthevar Rajasekaran

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103002229

zbMATH Keywords

hypercubede Bruijn networklarge distributed filesdistributed sortingdistributed selection

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Efficient selection and sorting schemes using coteries for processing large distributed files
• scientific article; zbMATH DE number 4090817
• Parallel methods for solving fundamental file rearrangement problems
• Efficient algorithms for parallel sorting on mesh multicomputers
• Optimal Distributed Algorithms for Sorting and Ranking
• Algorithms for multidimensional partitioning of static files
• scientific article; zbMATH DE number 1792119
• Distributed selectsort sorting algorithms on broadcast communication networks

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A distributed selection algorithm and its expected communication complexity
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Distributed sorting
• Expected time bounds for selection
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Selection and sorting with limited storage

Cited in

(5)

• Sorting a distributed file in a network
• Distributed selectsort sorting algorithms on broadcast communication networks
• Efficient selection and sorting schemes using coteries for processing large distributed files
• Algorithms for multidimensional partitioning of static files
• Shout echo selection in distributed files

This page was built for publication: EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES

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