Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing

The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-toall broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Petr Salinger, Pavel Tvrdík
• Keywords: Distance-insensitive Routing, Distance-sensitive Routing, Distributed And Parallel Computing, Implement Distance-insensitive Routing, IPPS 2000