Interconnection networks
Patent
·
OSTI ID:6316175
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)exclamation/ (d /minus/ k + 1)exclamation processors for each d greater than or equal to k and GAMMA/sub d/(k, /minus/1) with degree d /minus/ 1, diameter k + 1, and (d + 1)exclamation/(d /minus/ k + 1)exclamation processors for each d greater than or equal to k greater than or equal to 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, /minus/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. 9 figs.
- Research Organization:
- Los Alamos National Lab., NM (USA)
- DOE Contract Number:
- W-7405-ENG-36
- Assignee:
- Dept. of Energy
- Patent Number(s):
- PATENTS-US-A7209238
- Application Number:
- ON: DE89010965
- OSTI ID:
- 6316175
- Country of Publication:
- United States
- Language:
- English
Similar Records
System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees
Spark timing control device for an internal combustion engine
(k minus k) routing on multidimensional mesh-connected arrays
Patent
·
Tue Dec 31 23:00:00 EST 1991
·
OSTI ID:868362
Spark timing control device for an internal combustion engine
Patent
·
Tue Jun 05 00:00:00 EDT 1984
·
OSTI ID:6470491
(k minus k) routing on multidimensional mesh-connected arrays
Journal Article
·
Thu Jan 31 23:00:00 EST 1991
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:5070764
Related Subjects
99 GENERAL AND MISCELLANEOUS
990220* -- Computers
Computerized Models
& Computer Programs-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
DATA TRANSMISSION
FUNCTIONS
GRAPHS
INVENTIONS
MATHEMATICAL LOGIC
MATHEMATICS
MEMORY DEVICES
NUMERICAL ANALYSIS
PARALLEL PROCESSING
PROGRAMMING
ROUTING
VERTEX FUNCTIONS
990220* -- Computers
Computerized Models
& Computer Programs-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
DATA TRANSMISSION
FUNCTIONS
GRAPHS
INVENTIONS
MATHEMATICAL LOGIC
MATHEMATICS
MEMORY DEVICES
NUMERICAL ANALYSIS
PARALLEL PROCESSING
PROGRAMMING
ROUTING
VERTEX FUNCTIONS