loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99)
Circuit-Switched Routings for Automorphisms of a Hypercube
Fremantle, Australia
June 23-June 25
ISBN: 0-7695-0231-8
ASCII Text
x 
 
I. Hal Sudborough, Taoyu Zhang, "Circuit-Switched Routings for Automorphisms of a Hypercube," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 28, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1999.778913,
author = {I. Hal Sudborough and Taoyu Zhang},
title = {Circuit-Switched Routings for Automorphisms of a Hypercube},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1999},
issn = {1087-4089},
pages = {28},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778913},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Circuit-Switched Routings for Automorphisms of a Hypercube
SN - 1087-4089
SP
EP
A1 - I. Hal Sudborough,
A1 - Taoyu Zhang,
PY - 1999
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
I. Hal Sudborough, University of Texas at Dallas
Taoyu Zhang, University of Texas at Dallas
We consider, for d>1, a directed d-dimensional hypercube, Q d =(V,E), where V is a set of 2 d nodes, each denoted by a distinct binary string of length d, and E is the set of edges (x,y), such that x,y?V differ in exactly one position of their bit strings. Given a permutation of the vertices of Q d , which describes a source-destination mapping, we study the existence of a set of paths from each source to each destination such that no edge of Q d is assigned to more than one path. For a multiprocessor connected in such a manner, such a set of paths could be used for circuit switching of messages between source-destination processors (nodes). We show that for any automorphism of Q d , there is such a set of paths.
Citation:
I. Hal Sudborough, Taoyu Zhang, "Circuit-Switched Routings for Automorphisms of a Hypercube," ispan, pp.28, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.