WOS: 000084208400006We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a non-faulty hypercube. The number of faulty nodes and links may be rather large and if any path between the nodes exists, the developed algorithm determines it. To construct this algorithm, some properties of the cube algebra are considered and some transformations based on this algebra are developed. (C) 2000 Elsevier Science B.V. Air rights reserved
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
In this paper we study the fault--tolerant properties of the Supercube, a new interconnection networ...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
AbstractRecently, there has been a growing demand for large-scale computing in various fields. A bin...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
Abstract. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), an...
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any n...
A new interconnection network with low-degree for very large parallel computers called metacube (MC)...
Available from British Library Document Supply Centre- DSC:DXN062340 / BLDSC - British Library Docum...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
In real-time computing applications, it is important to have parallel computing systems that not onl...
In real-time computing applications, it is important to have parallel computing systems that not onl...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
Abstract-Using depth-first search, we develop and analyze the per-formance of a routing scheme for h...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
In this paper we study the fault--tolerant properties of the Supercube, a new interconnection networ...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
AbstractRecently, there has been a growing demand for large-scale computing in various fields. A bin...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
Abstract. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), an...
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any n...
A new interconnection network with low-degree for very large parallel computers called metacube (MC)...
Available from British Library Document Supply Centre- DSC:DXN062340 / BLDSC - British Library Docum...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
In real-time computing applications, it is important to have parallel computing systems that not onl...
In real-time computing applications, it is important to have parallel computing systems that not onl...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
Abstract-Using depth-first search, we develop and analyze the per-formance of a routing scheme for h...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
In this paper we study the fault--tolerant properties of the Supercube, a new interconnection networ...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...