System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees
Patent
·
OSTI ID:868362
- Los Alamos, NM
A network of interconnected processors is formed from a vertex symmetric graph selected from graphs .GAMMA..sub.d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k and .GAMMA..sub.d (k,-1) with degree 3-1, diameter k+1, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k.gtoreq.4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network .GAMMA..sub.d (k,-1) is provided, no processor has a channel connected to form an edge in a direction .delta..sub.1. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM
- DOE Contract Number:
- W-7405-ENG-36
- Assignee:
- United States of America as represented by Department of Energy (Washington, DC)
- Patent Number(s):
- US 5125076
- OSTI ID:
- 868362
- Country of Publication:
- United States
- Language:
- English
Strategies for interconnection networks: Some methods from graph theory
|
journal | December 1986 |
A group-theoretic model for symmetric interconnection networks
|
journal | April 1989 |
Vertex-transitive graphs
|
journal | October 1964 |
A Design for Directed Graphs with Minimum Diameter
|
journal | August 1983 |
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
|
journal | May 1987 |
Similar Records
Interconnection networks
System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indices
Permutations on Illiac IV-type networks
Patent
·
Mon Jun 20 00:00:00 EDT 1988
·
OSTI ID:6316175
System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indices
Patent
·
Tue Jun 23 00:00:00 EDT 1992
·
OSTI ID:7152609
Permutations on Illiac IV-type networks
Journal Article
·
Tue Jul 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5516693
Related Subjects
-1
/709/370/714/
3-1
address
addresses
appending
channel
channels
chosen
connected
corresponding
d-k
defined
degree
delta
diameter
direction
edge
elements
extended
form
formed
forming
found
front
gamma
graph
graphs
gtoreq
identification
indicees
interconnected
letter
letters
line
messages
moving
network
ones
permutations
plurality
position
predetermined
predetermined sequence
processor
processors
provided
remaining
routing
selected
selecting
sequence
symmetric
time
transmission
transmission line
vertex
vertex symmetric
/709/370/714/
3-1
address
addresses
appending
channel
channels
chosen
connected
corresponding
d-k
defined
degree
delta
diameter
direction
edge
elements
extended
form
formed
forming
found
front
gamma
graph
graphs
gtoreq
identification
indicees
interconnected
letter
letters
line
messages
moving
network
ones
permutations
plurality
position
predetermined
predetermined sequence
processor
processors
provided
remaining
routing
selected
selecting
sequence
symmetric
time
transmission
transmission line
vertex
vertex symmetric