Sciweavers

83 search results - page 9 / 17
» Fault-Tolerant Routing Algorithms for Hypercube Networks
Sort
View
DSD
2006
IEEE
159views Hardware» more  DSD 2006»
14 years 1 months ago
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as pr...
Rickard Holsmark, Maurizio Palesi, Shashi Kumar
FGCS
2010
76views more  FGCS 2010»
13 years 6 months ago
Self-healing network for scalable fault-tolerant runtime environments
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
Thara Angskun, Graham E. Fagg, George Bosilca, Jel...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
TPDS
1998
73views more  TPDS 1998»
13 years 7 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
TJS
2010
89views more  TJS 2010»
13 years 6 months ago
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
Yamin Li, Shietung Peng, Wanming Chu