The hypercube is emerging as one of the most effective and popular net
work architectures for large scale parallel machines. Hypercube based
machines are becoming more popular due to many of their attractive fea
tures 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 hyper
cubes with up to 2(n-3) faulty processors.