A message-routing strategy for multicomputer systems

DOI10.1002/NET.3230220703zbMATH Open0794.68010OpenAlexW2064013170MaRDI QIDQ4022729FDOQ4022729

Authors: Hyeong-Ah Choi, Abdol-Hossein Esfahanian 

Publication date: 17 January 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220703

Recommendations

• scientific article; zbMATH DE number 139789
• Methods for message routing in parallel machines
• Deadlock-free message routing in multicomputer networks
• Mapping strategies in message-based multiprocessor systems
• Distributed Algorithms for Message-Passing Systems
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

zbMATH Keywords

hypercubemulticomputer systemoptimal communication tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Multicast algorithms for hypercube multiprocessors
• Multicasting in the hypercube, chord and binomial graphs
• Title not available (Why is that?)
• Efficient Internode Communications in Reconfigurable Binary Trees
• Title not available (Why is that?)
• Mapping strategies in message-based multiprocessor systems
• Optimal doublecast path in hexagonal honeycomb mesh
• Deadlock-free message routing in multicomputer networks
• A MULTICAST ALGORITHM FOR HYPERCUBE MULTIPROCESSORS

This page was built for publication: A message-routing strategy for multicomputer systems

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