Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited
US7738443B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Jun 26, 2007 |
| Grant date | Jun 15, 2010 |
| Priority date | — |
| Expiry date | Apr 7, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L12/1854
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become “virtual root compute nodes” for the purpose of replicating the broadcast message to lower levels of a tree.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.