发明申请
US20090003344A1 ASYNCRONOUS BROADCAST FOR ORDERED DELIVERY BETWEEN COMPUTE NODES IN A PARALLEL COMPUTING SYSTEM WHERE PACKET HEADER SPACE IS LIMITED 失效
有限公司在并行计算系统中的计算机之间的订单交付,其中包装头空间有限公司

  • 专利标题: ASYNCRONOUS BROADCAST FOR ORDERED DELIVERY BETWEEN COMPUTE NODES IN A PARALLEL COMPUTING SYSTEM WHERE PACKET HEADER SPACE IS LIMITED
  • 专利标题(中): 有限公司在并行计算系统中的计算机之间的订单交付,其中包装头空间有限公司
  • 申请号: US11768619
    申请日: 2007-06-26
  • 公开(公告)号: US20090003344A1
    公开(公告)日: 2009-01-01
  • 发明人: Sameer Kumar
  • 申请人: Sameer Kumar
  • 申请人地址: US NY Armonk
  • 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
  • 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
  • 当前专利权人地址: US NY Armonk
  • 主分类号: H04L12/56
  • IPC分类号: H04L12/56
ASYNCRONOUS BROADCAST FOR ORDERED DELIVERY BETWEEN COMPUTE NODES IN A PARALLEL COMPUTING SYSTEM WHERE PACKET HEADER SPACE IS LIMITED
摘要:
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.
信息查询
0/0