Embedding Rings into Faulty Twisted Hypercubes

Abstract

The 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.