Sciweavers

132 search results - page 1 / 27
» Efficient and deadlock-free reconfiguration for source route...
Sort
View
TC
2008
13 years 4 months ago
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over ti...
Olav Lysne, José Miguel Montañana, J...
WDAG
1998
Springer
71views Algorithms» more  WDAG 1998»
13 years 9 months ago
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
Rastislav Kralovic, Branislav Rovan, Peter Ruzicka...
APPINF
2003
13 years 6 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
PERVASIVE
2008
Springer
13 years 4 months ago
Context-aware routing in wireless mesh networks
Wireless mesh networks promise to deliver resilient connectivity among network nodes, allowing data to be relayed seamlessly between mobile clients and infrastructure. Routing is ...
Peizhao Hu, Marius Portmann, Ricky Robinson, Jadwi...