Add to ORKGThe hypercube is emerging as one of the most effective and popular network architectures for large scale parallel machines. Hypercube based machines are becoming more popular due to many of their attractive features in parallel computing. An attractive version of the hypercube is the twisted hypercube. It preserves many properties of the hypercube and most importantly reduces the diameter by a factor of two. In this paper we present optimal embeddings of rings into faulty twisted hypercubes with up to 2n-3 faulty processes
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
To obtain a greater performance, many processors are allowed to cooperate to solve a single problem....
[[abstract]]Reconfiguring meshes in a faulty Supercube is investigated in the paper. The result can ...
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (with...
AbstractThe locally twisted cube is a newly introduced interconnection network for parallel computin...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
AbstractComparison-based diagnosis is a practical approach to the system-level fault diagnosis of mu...
It is shown that the diameter of an n-dimensional hypercube can only increase by an additive constan...
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
To obtain a greater performance, many processors are allowed to cooperate to solve a single problem....
[[abstract]]Reconfiguring meshes in a faulty Supercube is investigated in the paper. The result can ...
We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (with...
AbstractThe locally twisted cube is a newly introduced interconnection network for parallel computin...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
[[abstract]]It is well known that the general problem of finding a Hamilton cycle (ring) in an arbit...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
[[abstract]]In order to use existing algorithms for rings and linear arrays on other architectures, ...
Many parallel algorithms use hypercubes as the communication topology among processes, which make th...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
AbstractComparison-based diagnosis is a practical approach to the system-level fault diagnosis of mu...
It is shown that the diameter of an n-dimensional hypercube can only increase by an additive constan...
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
To obtain a greater performance, many processors are allowed to cooperate to solve a single problem....
[[abstract]]Reconfiguring meshes in a faulty Supercube is investigated in the paper. The result can ...