-
公开(公告)号：US08756270B2
公开(公告)日：2014-06-17
申请号：US13454727
申请日：2012-04-24
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
CPC classification number: H04L29/06 , G06F15/17318 , H04L12/56 , H04L29/08072 , H04L29/08135 , H04L29/12132 , H04L29/12594 , H04L45/02 , H04L45/123 , H04L45/306 , H04L61/1552 , H04L61/3015 , Y10S707/9994
Abstract: A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.
-
Patent Agency Ranking
公开(公告)号：US20110238956A1
公开(公告)日：2011-09-29
申请号：US12749100
申请日：2010-03-29
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
IPC: G06F15/173 , G06F17/30 , G06F9/302
CPC classification number: H04L29/06 , G06F15/17318 , H04L12/56 , H04L29/08072 , H04L29/08135 , H04L29/12132 , H04L29/12594 , H04L45/02 , H04L45/123 , H04L45/306 , H04L61/1552 , H04L61/3015 , Y10S707/9994
Abstract: A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.
Abstract translation: 在集体加速单元中提供一种用于执行集合操作以在多个参与者节点之间分发或收集数据的机制。 该机制从集体树中的邻居节点接收用于集体操作的输入集合分组。 所述输入集合分组包括树标识符和输入数据字段，并且其中所述集合树包括多个子树。 该机制将树标识符映射到集体加速单元内的索引。 索引识别集体加速单元内的资源的一部分，并且与集合树内的给定子树中的一组相邻节点相关联。 对于每个邻居节点，集体加速单元存储目的地信息。 集体加速单元使用资源部分对输入数据字段进行操作以实现集体操作。
-
公开(公告)号：US08417778B2
公开(公告)日：2013-04-09
申请号：US12640208
申请日：2009-12-17
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
IPC: G06F15/16
CPC classification number: G06F15/16
Abstract: A mechanism is provided for collective acceleration unit tree flow control forms a logical tree (sub-network) among those processors and transfers “collective” packets on this tree. The system supports many collective trees, and each collective acceleration unit (CAU) includes resources to support a subset of the trees. Each CAU has limited buffer space, and the connection between two CAUs is not completely reliable. Therefore, to address the challenge of collective packets traversing on the tree without colliding with each other for buffer space and guaranteeing the end-to-end packet delivery, each CAU in the system effectively flow controls the packets, detects packet loss, and retransmits lost packets.
Abstract translation: 提供了一种用于集体加速单元树流控制的机制，形成这些处理器之间的逻辑树（子网），并在该树上传送集合分组。 系统支持许多集体树，每个集体加速单元（CAU）包括支持一部分树的资源。 每个CAU具有有限的缓冲区空间，两个CAU之间的连接不是完全可靠的。 因此，为了解决在树上遍历的集合分组的挑战，不会相互冲突，保证端到端的分组传递，系统中的每个CAU都有效地流量控制分组，检测分组丢失，重传丢失 数据包
-
公开(公告)号：US08751655B2
公开(公告)日：2014-06-10
申请号：US12749100
申请日：2010-03-29
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
IPC: G06F15/173
CPC classification number: H04L29/06 , G06F15/17318 , H04L12/56 , H04L29/08072 , H04L29/08135 , H04L29/12132 , H04L29/12594 , H04L45/02 , H04L45/123 , H04L45/306 , H04L61/1552 , H04L61/3015 , Y10S707/9994
Abstract: A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.
Abstract translation: 在集体加速单元中提供一种用于执行集合操作以在多个参与者节点之间分发或收集数据的机制。 该机制从集体树中的邻居节点接收用于集体操作的输入集合分组。 所述输入集合分组包括树标识符和输入数据字段，并且其中所述集合树包括多个子树。 该机制将树标识符映射到集体加速单元内的索引。 索引识别集体加速单元内的资源的一部分，并且与集合树内的给定子树中的一组相邻节点相关联。 对于每个邻居节点，集体加速单元存储目的地信息。 集体加速单元使用资源部分对输入数据字段进行操作以实现集体操作。
-
公开(公告)号：US20120296915A1
公开(公告)日：2012-11-22
申请号：US13454727
申请日：2012-04-24
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
IPC: G06F17/30
CPC classification number: H04L29/06 , G06F15/17318 , H04L12/56 , H04L29/08072 , H04L29/08135 , H04L29/12132 , H04L29/12594 , H04L45/02 , H04L45/123 , H04L45/306 , H04L61/1552 , H04L61/3015 , Y10S707/9994
Abstract: A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation.
Abstract translation: 在集体加速单元中提供一种用于执行集合操作以在多个参与者节点之间分发或收集数据的机制。 该机制从集体树中的邻居节点接收用于集体操作的输入集合分组。 所述输入集合分组包括树标识符和输入数据字段，并且其中所述集合树包括多个子树。 该机制将树标识符映射到集体加速单元内的索引。 索引识别集体加速单元内的资源的一部分，并且与集合树内的给定子树中的一组相邻节点相关联。 对于每个邻居节点，集体加速单元存储目的地信息。 集体加速单元使用资源部分对输入数据字段进行操作以实现集体操作。
-
公开(公告)号：US20110173258A1
公开(公告)日：2011-07-14
申请号：US12640208
申请日：2009-12-17
Applicant: Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
Inventor： Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
IPC: G06F15/16
CPC classification number: G06F15/16
Abstract: A mechanism is provided for collective acceleration unit tree flow control forms a logical tree (sub-network) among those processors and transfers “collective” packets on this tree. The system supports many collective trees, and each collective acceleration unit (CAU) includes resources to support a subset of the trees. Each CAU has limited buffer space, and the connection between two CAUs is not completely reliable. Therefore, to address the challenge of collective packets traversing on the tree without colliding with each other for buffer space and guaranteeing the end-to-end packet delivery, each CAU in the system effectively flow controls the packets, detects packet loss, and retransmits lost packets.
Abstract translation: 提供了一种用于集体加速单元树流控制的机制，形成这些处理器之间的逻辑树（子网），并在该树上传输“集合”分组。 系统支持许多集体树，每个集体加速单元（CAU）包括支持一部分树的资源。 每个CAU具有有限的缓冲区空间，两个CAU之间的连接不是完全可靠的。 因此，为了解决在树上遍历的集合分组的挑战，不会相互冲突，保证端到端的分组传递，系统中的每个CAU都有效地流量控制分组，检测分组丢失，重传丢失 数据包
-
-
-
-
-
Search Results
6
records
(took 0.018 seconds)
