Efficient Internode Communications in Reconfigurable Binary Trees

DOI10.1109/TC.1984.1676372MaRDI QIDQ3335691zbMATH OpenOpenAlexFDO

Authors Svetlana P. Kartashev, Steven I. Kartashev

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1984.1676372

zbMATH Keywords

efficient communication algorithmsinternode communicationsmulticomputer networksreconfigurable binary treesrouting algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 867692
• A message-routing strategy for multicomputer systems
• Efficient Schemes for Parallel Communication
• A bandwidth latency tradeoff for broadcast and reduction
• Spanning subgraphs with applications to communication on the multidimensional torus network

Cited in

(1)

• ROUTING MULTIPLE WIDTH COMMUNICATIONS ON THE CIRCUIT SWITCHED TREE

This page was built for publication: Efficient Internode Communications in Reconfigurable Binary Trees

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