Class network routing
Patent
·
OSTI ID:988822
- Princeton, NJ
- Ridgefield, CT
- Croton On Hudson, NY
- Yorktown Heights, NY
- Mount Kisco, NY
- Irvington, NY
- Cortlandt Manor, NY
- Bedford Hills, NY
Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Number(s):
- 7,587,516
- Application Number:
- 10/468,999
- OSTI ID:
- 988822
- Country of Publication:
- United States
- Language:
- English
Performance Evaluation of Multicast Wormhole Routing in 2d-Torus Multicomputers
|
journal | September 1992 |
An optimal scheduling procedure for matrix inversion on linear array at a processor level
|
journal | August 1994 |
Multicast routing in internetworks and extended LANs
|
conference | January 1988 |
A systolic architecture for fast dense matrix inversion
|
journal | March 1989 |
Similar Records
Optimal software multicast in wormhole-routed multistage networks
Relay approach message routing in hypercube multiprocessors
Routing schemes for the augmented data manipulator network in an MIMD system
Book
·
1994
·
OSTI ID:87671
Relay approach message routing in hypercube multiprocessors
Conference
·
1987
·
OSTI ID:5114040
Routing schemes for the augmented data manipulator network in an MIMD system
Journal Article
·
1982
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6153381