Filters








423 Hits in 6.9 sec

A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS

J. AL-SADI, K. DAY, M. OULD-KHAOUA
2004 International journal of high speed computing  
This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors".  ...  The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network.  ...  "PV Routing" fault-tolerant routing algorithm.A New Fault-Tolerant Routing Algorithm for k-Ary n-Cube Networks 35 Fig. 1 : 1 Outline of the proposed "PV_Routing" fault-tolerant routing algorithm.  ... 
doi:10.1142/s0129053304000220 fatcat:5vykyvyznfcwfmsom6u5qauaua

A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis [chapter]

Liu Hongmei
2007 Lecture Notes in Computer Science  
A new algorithm for fault-tolerant routing based on detour and backtracking techniques is developed for m-ary n-cube multi-computer networks.  ...  The probability of routing messages via an optimal path between any two nodes is a special case of our results, and can be obtained by replacing the obstructed node with the destination node.  ...  Conclusion This paper proposed a new fault-tolerant routing algorithm for m-ary n-cube. This algorithm is based on the detour and backtracking technique.  ... 
doi:10.1007/978-3-540-72584-8_86 fatcat:et2oxnoy2jhmnd7su6pem65ksy

A Partial Irregular-Network Routing on Faulty k-ary n-cubes

Michihiro Koibuchi, Tsutomu Yoshinaga, Yasuhiko Nishimura
2006 Automated Software Engineering, IEEE International Conference  
This paper presents a partial irregular-network routing in order to provide a high fault-tolerance in k-ary n-cube networks.  ...  Since an irregular-network routing usually performs poorly in k-ary n-cube networks, it is only used for progressive deadlock-recovery, and avoiding hard failures.  ...  path on k-ary n-cubes.  ... 
doi:10.1109/iwias.2006.23 fatcat:5nxqmbk3nbhgbi66klzg76hrbe

A Performance Model of Fault-Tolerant Routing Algorithm in Interconnect Networks [chapter]

F. Safaei, M. Fathy, A. Khonsari, M. Ould-Khaoua
2006 Lecture Notes in Computer Science  
This paper presents a new analytical model to capture the effects of failures in wormhole-switched k-ary n-cubes using Software-Based fault-tolerant routing algorithm.  ...  A number of different analytical models for fault-free routing algorithms have been suggested in the past literature.  ...  Fault-tolerance is the ability of a routing algorithm to bypass faulty nodes/links in the network.  ... 
doi:10.1007/11758501_99 fatcat:ijgbncygjjh5zppoypeeziuf7m

Software-based fault-tolerant routing algorithm in multidimensional networks

F. Safaei, M. Rezazad, A. Khonsari, M. Fathy, M. Ould-Khaoua, N. Alzeidi
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
The Software-Based fault-tolerant routing algorithm is a popular routing to achieve faulttolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1] .  ...  Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions.  ...  A k-ary n-cube is a class of regular graphs, consist of N=k n nodes arranged in an ndimensional cube with k nodes along each dimension.  ... 
doi:10.1109/ipdps.2006.1639644 dblp:conf/ipps/SafaeiRKFOA06 fatcat:47x7p32zqfa2jmjtsg7ouhmaca

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1992 SIGARCH Computer Architecture News  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  A hypercube is an n-dimensional mesh in which k, = 2 for O < i < n -1 or a 2-ary n-cube. Meshes and k-ary n-cubes are pop&r in part because their regular topologies simplify routing.  ...  Applied to n-dimensional meshes and k-ary n-cubes without extra chanuels, the turn model produces severaf new, par- tially adaptive routing algorithms.  ... 
doi:10.1145/146628.140384 fatcat:jo7t3lar3bcjpecetb6hm7wutu

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1992 Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  A hypercube is an n-dimensional mesh in which k, = 2 for O < i < n -1 or a 2-ary n-cube. Meshes and k-ary n-cubes are pop&r in part because their regular topologies simplify routing.  ...  Applied to n-dimensional meshes and k-ary n-cubes without extra chanuels, the turn model produces severaf new, par- tially adaptive routing algorithms.  ... 
doi:10.1145/139669.140384 dblp:conf/isca/GlassN92 fatcat:habm5axbfzg3ri7g5i4z3rkpbe

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1998 25 years of the international symposia on Computer architecture (selected papers) - ISCA '98  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  A hypercube is an n-dimensional mesh in which k, = 2 for O < i < n -1 or a 2-ary n-cube. Meshes and k-ary n-cubes are pop&r in part because their regular topologies simplify routing.  ...  Applied to n-dimensional meshes and k-ary n-cubes without extra chanuels, the turn model produces severaf new, par- tially adaptive routing algorithms.  ... 
doi:10.1145/285930.286003 dblp:conf/isca/GlassN98 fatcat:sgszfxgu5zho3m2yfu47t3meba

The turn model for adaptive routing

Christopher J. Glass, Lionel M. Ni
1994 Journal of the ACM  
We present a model for designing wormhole routing algorithms that are deadlock free, livelock free, minimaf or nonminimal, and maximally adaptive.  ...  A hypercube is an n-dimensional mesh in which k, = 2 for O < i < n -1 or a 2-ary n-cube. Meshes and k-ary n-cubes are pop&r in part because their regular topologies simplify routing.  ...  Applied to n-dimensional meshes and k-ary n-cubes without extra chanuels, the turn model produces severaf new, par- tially adaptive routing algorithms.  ... 
doi:10.1145/185675.185682 fatcat:hrw7lwnvjbgnvkuqeafutpx3oe

Communication algorithms in k-ary n-cube interconnection networks

Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed
1997 Information Processing Letters  
Tolerating Faults in k-ary n-cubes This section shows the existence of a Hamiltonian cycle in a k-ary n-cube Qk, where k > 3 and n > 2, with at most An -5 faulty links where each node is incident with  ...  Let (a new) 3-ary 2-cube Q\ be such that there is a fault (x,y) in Q2 if and only if there is a fault (a?.-, y*) in Qi, for some i E {1,2,3}.  ... 
doi:10.1016/s0020-0190(96)00188-3 fatcat:6zlxe2ntdrckrkdz55a7mweuva

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
Along with performance, fault tolerance is essential for message routing in multicomputers, and we thus discuss several fault-tolerant wormhole routing algorithms along with their fault-handling capabilities  ...  These routing schemes enable a message to reach its destination even in the presence of faults in the network.  ...  The author is thankful to Katrina Avery for her editorial assistance, which improved the readability of the article. The author also thanks the referees for their valuable comments.  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

The k-ary n-direct s-indirect family of topologies for large-scale interconnection networks

Roberto Peñaranda, Crispín Gómez, María E. Gómez, Pedro López, Jose Duato
2016 Journal of Supercomputing  
The k-ary n-direct s-indirect family of topologies for large-scale interconnection networks.  ...  In this paper, we propose a new family of hybrid topologies, the k-ary n-direct s-indirect, that combines the best features from both direct and indirect topologies to efficiently connect an extremely  ...  This kind of topologies is known as k-ary n-cubes.  ... 
doi:10.1007/s11227-016-1640-z fatcat:dob6ybcnmbdsvlhiykvp7i52mi

An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes

D.H. Linder, J.C. Harden
1991 IEEE transactions on computers  
Virtual interconnection networks allowing adaptive, deadlock-free routing arc examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional  ...  The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free.  ...  The purpose of this paper is to present simple, deadlock-free, adaptable, and fault-tolerant wormhole routing techniques for a popular topology-the k-ary n-cube.  ... 
doi:10.1109/12.67315 fatcat:xpfxamxmbjfptpgtqwr5woppt4

Broadcasting and routing in faulty mesh networks

M. Stojmenovic, A. Nayak
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
In this paper, we consider the family of mesh networks, which include the mesh connected computer (MCC), k-dimensional mesh, torus, and k-ary n-cube.  ...  The algorithm can be extended to faulty k-D meshes and k-ary n-cubes, where the delivery will be guaranteed if healthy nodes in every 2-D submesh (sub-tori) remain connected.  ...  ROUTING WITH K-D MESHES AND K-ARY N-CUBES In this paper, we also introduce an algorithm for routing messaged through k-D meshes and k-ary n-cubes.  ... 
doi:10.1109/ipdps.2006.1639557 dblp:conf/ipps/StojmenovicN06 fatcat:x32r3pckczgxjhalxjo2ln7waq

DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET

YAMIN LI, SHIETUNG PENG, WANMING CHU
2011 International Journal of Foundations of Computer Science  
In this paper, we propose efficient algorithms for disjoint-paths and fault-tolerant routings on the recursive dual-net.  ...  Disjoint-paths routing and fault-tolerant routing are fundamental and critical issues for the performance of an interconnection network.  ...  ALGORITHM FOR FAULT-TOLERANT ROUTING ON RDN WITH ARBITRARY NUMBER OF FAULTY NODES In this section, we propose an efficient practical algorithm for fault-tolerant routing in a RDN with arbitrary number  ... 
doi:10.1142/s0129054111008532 fatcat:t4atrzgzbvgnlmyfr5l6a4mgma
« Previous Showing results 1 — 15 out of 423 results