Order preserving communication on a star network

DOI10.1016/0167-8191(94)00091-NzbMATH Open0875.68053OpenAlexW1991631770MaRDI QIDQ673528FDOQ673528

Authors: Dilip K. Saikia, Ranjan Kumar Sen 

Publication date: 28 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)00091-n

Recommendations

• Node-ranking schemes for the star networks.
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• Bit complexity of order statistics on a distributed star network

zbMATH Keywords

Parallel computingASCEND/DESCEND algorithmsFast Fourier TransformOrder preserving communicationsPipelined computationStar network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (2)

• Node-ranking schemes for the star networks.
• Bit complexity of order statistics on a distributed star network

This page was built for publication: Order preserving communication on a star network

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