DocumentCode
761138
Title
Embedding graphs onto the Supercube
Author
Auletta, Vincenzo ; Rescigno, Adele Anna ; Scarano, Vittorio
Author_Institution
Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy
Volume
44
Issue
4
fYear
1995
fDate
4/1/1995 12:00:00 AM
Firstpage
593
Lastpage
597
Abstract
In this paper we consider the Supercube, a new interconnection network derived from the hypercube. The Supercube, introduced by A. Sen (1989), has the same diameter and connectivity as a Hypercube but can be realized for any number of nodes, not only powers of 2. We study the Supercube´s ability to execute parallel programs, using graph-embedding techniques. We show that complete binary trees and bidimensional meshes (with a side length power of 2) are spanning subgraphs of the Supercube. We then prove that the Supercube is Hamiltonian and, when the number of nodes is not a power of 2, it contains all cycles of length greater than 3 as subgraphs
Keywords
hypercube networks; Supercube; bidimensional meshes; complete binary trees; graphs embedding; hypercube; interconnection network; parallel programs; spanning subgraphs; Binary trees; Computer science; Concurrent computing; Costs; Fault tolerance; Hypercubes; Joining processes; Parallel algorithms; Parallel architectures; Parallel machines;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.376173
Filename
376173
Link To Document