A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
DOI10.1080/00207169308804188zbMATH Open0815.68045OpenAlexW2055840391MaRDI QIDQ4323716FDOQ4323716
Authors: C. S. R. Krishnan, C. Siva Ram Murthy
Publication date: 30 March 1995
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169308804188
Recommendations
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cites Work
Cited In (8)
- SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- Compression using efficient multicasting
- Parallel enumeration sort on OTIS-hypercube
- A unified algorithm for sorting on multidimensional mesh-connected processors
- Title not available (Why is that?)
- Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting
- Efficient algorithms for parallel sorting on mesh multicomputers
This page was built for publication: A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323716)