Embeddings, Communication and Performance of Algorithms in Faulty Hypercubes

Abstract

In many parallel algorithms in hypercubes, linear arrays and 2-D meshes are embedded for the computations that require local communication while the hypercube topology is used for global communication. In this paper, embedding and global data communication schemes are developed for faulty hypercubes and studied in the context of algorithms. The schemes are also applicable to incomplete hypercubes resulting from the allocation of subcubes to different users.