专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明授权

US08751655B2 Collective acceleration unit tree structure 有权
标题翻译：集体加速单位树结构
公开(公告)号：US08751655B2
公开(公告)日：2014-06-10
申请号：US12749100
申请日：2010-03-29
申请人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
发明人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
IPC分类号： G06F15/173
CPC分类号： 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
摘要： 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.
摘要翻译：在集体加速单元中提供一种用于执行集合操作以在多个参与者节点之间分发或收集数据的机制。该机制从集体树中的邻居节点接收用于集体操作的输入集合分组。所述输入集合分组包括树标识符和输入数据字段，并且其中所述集合树包括多个子树。该机制将树标识符映射到集体加速单元内的索引。索引识别集体加速单元内的资源的一部分，并且与集合树内的给定子树中的一组相邻节点相关联。对于每个邻居节点，集体加速单元存储目的地信息。集体加速单元使用资源部分对输入数据字段进行操作以实现集体操作。

52. 发明申请

US20120296915A1 Collective Acceleration Unit Tree Structure 有权
标题翻译：集体加速单位树结构
公开(公告)号：US20120296915A1
公开(公告)日：2012-11-22
申请号：US13454727
申请日：2012-04-24
申请人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
发明人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Paul F. Lecocq , Hanhong Xue
IPC分类号： G06F17/30
CPC分类号： 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
摘要： 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.
摘要翻译：在集体加速单元中提供一种用于执行集合操作以在多个参与者节点之间分发或收集数据的机制。该机制从集体树中的邻居节点接收用于集体操作的输入集合分组。所述输入集合分组包括树标识符和输入数据字段，并且其中所述集合树包括多个子树。该机制将树标识符映射到集体加速单元内的索引。索引识别集体加速单元内的资源的一部分，并且与集合树内的给定子树中的一组相邻节点相关联。对于每个邻居节点，集体加速单元存储目的地信息。集体加速单元使用资源部分对输入数据字段进行操作以实现集体操作。

53. 发明申请

US20110173258A1 Collective Acceleration Unit Tree Flow Control and Retransmit 失效
标题翻译：集体加速单位树流量控制和重新发布
公开(公告)号：US20110173258A1
公开(公告)日：2011-07-14
申请号：US12640208
申请日：2009-12-17
申请人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
发明人： Lakshminarayana B. Arimilli , Bernard C. Drerup , Jody B. Joyner , Paul F. Lecocq , Hanhong Xue
IPC分类号： G06F15/16
CPC分类号： G06F15/16
摘要： 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.
摘要翻译：提供了一种用于集体加速单元树流控制的机制，形成这些处理器之间的逻辑树（子网），并在该树上传输“集合”分组。系统支持许多集体树，每个集体加速单元（CAU）包括支持一部分树的资源。每个CAU具有有限的缓冲区空间，两个CAU之间的连接不是完全可靠的。因此，为了解决在树上遍历的集合分组的挑战，不会相互冲突，保证端到端的分组传递，系统中的每个CAU都有效地流量控制分组，检测分组丢失，重传丢失数据包

54. 发明申请

US20060075067A1 Remote direct memory access with striping over an unreliable datagram transport 审中-公开
标题翻译：远程直接存储器访问，具有条带化不可靠的数据报传输
公开(公告)号：US20060075067A1
公开(公告)日：2006-04-06
申请号：US11017359
申请日：2004-12-20
申请人： Robert Blackmore , Piyush Chaudhary , Jason Goscinski , Rama Govindaraju , Donald Grice , Peter Hochschild , John Houston , Chulho Kim , Steven Martin , Rajeev Sivaram , Hanhong Xue
发明人： Robert Blackmore , Piyush Chaudhary , Jason Goscinski , Rama Govindaraju , Donald Grice , Peter Hochschild , John Houston , Chulho Kim , Steven Martin , Rajeev Sivaram , Hanhong Xue
IPC分类号： G06F15/16
CPC分类号： H04L69/16 , G06F12/1081 , H04L69/166
摘要： In a multinode data processing system in which nodes exchange information over a network or through a switch, a structure and mechanism are provided which enables data packets to be sent and received in any order. Normally, if in-order transmission and receipt are required, then transmission over a single path is essential to insure proper reassembly. However, the present mechanism avoids this necessity and permits Remote Direct Memory Access (RDMA) operations to be carried out simultaneously over multiple paths. This provides a data striping mode of operation in which data transfers can be carried out much faster since packets of single or multiple RDMA messages can be portioned and transferred over several paths simultaneously, thus providing the ability to utilize the full system bandwidth that is available.
摘要翻译：在节点通过网络交换信息或通过交换机交换信息的多节点数据处理系统中，提供了能够以任何顺序发送和接收数据分组的结构和机制。通常，如果需要按顺序传输和接收，则通过单个路径的传输对于确保适当的重新组装是至关重要的。然而，本机制避免了这种必要性，并且允许在多个路径上同时执行远程直接存储器访问（RDMA）操作。这提供了数据条带化操作模式，其中数据传输可以执行得更快，因为单个或多个RDMA消息的分组可以同时分配和传输多个路径，从而提供利用可用的全部系统带宽的能力。

55. 发明申请

US20050132081A1 Efficient protocol processing to increase bandwidth in interrupt mode 审中-公开
标题翻译：高效的协议处理能够在中断模式下增加带宽
公开(公告)号：US20050132081A1
公开(公告)日：2005-06-16
申请号：US10733725
申请日：2003-12-11
申请人： Chulho Kim , Hanhong Xue
发明人： Chulho Kim , Hanhong Xue
IPC分类号： G06F15/16 , H04L12/56 , H04L29/06
CPC分类号： H04L49/9068 , H04L49/90
摘要： A communication system with a communications adapter operating in an interrupt mode, the system comprising: a network system with at least one sender and a recipient of a message and a network for communication therebetween; the communications adapter placing data from the message in a receive buffer and generating an interrupt; and a state variable configured to track received messages. A method for increasing bandwidth in an interrupt mode processing protocol comprising: creating a state variable configured to track received messages; incrementing the state variable only if the received message exhibits multiple packets; decrementing the state variable if the received message exhibits multiple packets and completes; and generating an interrupt, with a communications adapter running in an interrupt mode, the communications adapter placing data from received message in a receive buffer.
摘要翻译：一种具有以中断模式操作的通信适配器的通信系统，所述系统包括：具有消息的至少一个发送者和接收者的网络系统和用于在其间进行通信的网络; 所述通信适配器将来自所述消息的数据放置在接收缓冲器中并产生中断; 以及配置成跟踪接收到的消息的状态变量。一种用于在中断模式处理协议中增加带宽的方法，包括：创建配置成跟踪接收的消息的状态变量; 只有当接收到的消息呈现多个分组时才增加状态变量; 如果接收的消息呈现多个分组并且完成，则递减状态变量; 并且在通信适配器以中断模式运行的情况下产生中断，所述通信适配器将来自接收到的消息的数据放置在接收缓冲器中。

56. 发明授权

US08452888B2 Flow control for reliable message passing 失效
公开(公告)号：US08452888B2
公开(公告)日：2013-05-28
申请号：US12841399
申请日：2010-07-22
申请人： Uman Chan , Deryck X Hong , Tsai-Yang Jea , Chulho Kim , Zenon J Piatek , Hung Q Thai , Abhinav Vishnu , Hanhong Xue
发明人： Uman Chan , Deryck X Hong , Tsai-Yang Jea , Chulho Kim , Zenon J Piatek , Hung Q Thai , Abhinav Vishnu , Hanhong Xue
IPC分类号： G06F9/46 , G06F12/02
CPC分类号： H04L47/29 , G06F9/546 , H04L43/08 , H04L43/16 , H04L47/2466 , H04L47/30
摘要： A message flow controller limits a process from passing a new message in a reliable message passing layer from a source node to at least one destination node while a total number of in-flight messages for the process meets a first level limit. The message flow controller limits the new message from passing from the source node to a particular destination node from among a plurality of destination nodes while a total number of in-flight messages to the particular destination node meets a second level limit. Responsive to the total number of in-flight messages to the particular destination node not meeting the second level limit, the message flow controller only sends a new packet from among at least one packet for the new message to the particular destination node while a total number of in-flight packets for the new message is less than a third level limit.

57. 发明授权

US08141084B2 Managing preemption in a parallel computing system 失效
标题翻译：在并行计算系统中管理抢占
公开(公告)号：US08141084B2
公开(公告)日：2012-03-20
申请号：US12098868
申请日：2008-04-07
申请人： Richard J. Coppinger , Deryck X. Hong , Chulho Kim , Hanhong Xue
发明人： Richard J. Coppinger , Deryck X. Hong , Chulho Kim , Hanhong Xue
IPC分类号： G06F11/34
CPC分类号： G06F9/5022 , G06F9/5077
摘要： This present invention provides a portable user space application release/reacquire of adapter resources for a given job on a node using information in a network resource table. The information in the network resource table is obtained when a user space application is loaded by some resource manager. The present invention provides a portable solution that will work for any interconnect where adapter resources need to be freed and reacquired without having to write a specific function in the device driver. In the present invention, the preemption request is done on a job basis using a key or “job key” that was previously loaded when the user space application or job originally requested the adapter resources. This is done for each OS instance where the job is run.
摘要翻译：本发明提供了使用网络资源表中的信息的便携式用户空间应用程序释放/重新获取节点上的给定作业的适配器资源。当某个资源管理器加载用户空间应用程序时，获取网络资源表中的信息。本发明提供一种便携式解决方案，其可适用于任何互连，其中适配器资源需要被释放并重新获取，而不必在设备驱动器中写入特定功能。在本发明中，使用当用户空间应用或作业最初请求适配器资源时先前加载的密钥或“作业密钥”，在作业基础上完成抢占请求。这是为运行作业的每个操作系统实例完成的。

58. 发明申请

US20110061053A1 MANAGING PREEMPTION IN A PARALLEL COMPUTING SYSTEM 失效
标题翻译：管理平行计算系统中的预防措施
公开(公告)号：US20110061053A1
公开(公告)日：2011-03-10
申请号：US12098868
申请日：2008-04-07
申请人： RICHARD J. COPPINGER , Deryck X. Hong , Chulho Kim , Hanhong Xue
发明人： RICHARD J. COPPINGER , Deryck X. Hong , Chulho Kim , Hanhong Xue
IPC分类号： G06F9/46
CPC分类号： G06F9/5022 , G06F9/5077
摘要： This present invention provides a portable user space application release/reacquire of adapter resources for a given job on a node using information in a network resource table. The information in the network resource table is obtained when a user space application is loaded by some resource manager. The present invention provides a portable solution that will work for any interconnect where adapter resources need to be freed and reacquired without having to write a specific function in the device driver. In the present invention, the preemption request is done on a job basis using a key or “job key” that was previously loaded when the user space application or job originally requested the adapter resources. This is done for each OS instance where the job is run.
摘要翻译：本发明提供了使用网络资源表中的信息的便携式用户空间应用程序释放/重新获取节点上的给定作业的适配器资源。当某个资源管理器加载用户空间应用程序时，获取网络资源表中的信息。本发明提供一种便携式解决方案，其可适用于任何互连，其中适配器资源需要被释放并重新获取，而不必在设备驱动器中写入特定功能。在本发明中，使用当用户空间应用或作业最初请求适配器资源时先前加载的密钥或“作业密钥”，在作业基础上完成抢占请求。这是为运行作业的每个操作系统实例完成的。

59. 发明授权

US07840643B2 System and method for movement of non-aligned data in network buffer model 有权
标题翻译：网络缓冲模型中非对齐数据移动的系统和方法
公开(公告)号：US07840643B2
公开(公告)日：2010-11-23
申请号：US10959801
申请日：2004-10-06
申请人： Rama K. Govindaraju , Chulho Kim , Hanhong Xue
发明人： Rama K. Govindaraju , Chulho Kim , Hanhong Xue
IPC分类号： G06F15/16
CPC分类号： H04L47/10
摘要： A method is provided for transferring data between first and second nodes of a network. Such method includes requesting first data to be transferred by a first upper layer protocol (ULP) operating on the first node of the network; and buffering second data for transfer to the second node by a lower protocol layer lower than the first ULP, the second data including an integral number of standard size units of data including the first data. The method further includes posting the second data to the network for delivery to the second node; receiving the second data at the second node; and from the received data, delivering the first data to a second ULP operating on the second node. The method is of particular application when transferring the data in unit size is faster than transferring the data in other than unit size.
摘要翻译：提供了一种用于在网络的第一和第二节点之间传送数据的方法。这种方法包括通过在网络的第一节点上操作的第一上层协议（ULP）来请求第一数据传送; 以及缓冲第二数据以通过低于所述第一ULP的较低协议层传送到所述第二节点，所述第二数据包括包括所述第一数据的标准大小数据单元的整数。该方法还包括将第二数据发布到网络以传送到第二节点; 在第二节点处接收第二数据; 并且从所接收的数据中，将第一数据传送到在第二节点上操作的第二ULP。当传输单位大小的数据比传送除单位大小之外的数据更快时，该方法是特别应用的。

60. 发明授权

US07774554B2 System and method for intelligent software-controlled cache injection 失效
标题翻译：用于智能软件控制缓存注入的系统和方法
公开(公告)号：US07774554B2
公开(公告)日：2010-08-10
申请号：US11676745
申请日：2007-02-20
申请人： Piyush Chaudhary , Rama K. Govindaraju , Jay Robert Herring , Peter Hochschild , Chulho Kim , Rajeev Sivaram , Hanhong Xue
发明人： Piyush Chaudhary , Rama K. Govindaraju , Jay Robert Herring , Peter Hochschild , Chulho Kim , Rajeev Sivaram , Hanhong Xue
IPC分类号： G06F12/00
CPC分类号： G06F12/0862 , G06F12/0817
摘要： A system and method to provide injection of important data directly into a processor's cache location when that processor has previously indicated interest in the data. The memory subsystem at a target processor will determine if the memory address of data to be written to a memory location associated with the target processor is found in a processor cache of the target processor. If it is determined that the memory address is found in a target processor's cache, the data will be directly written to that cache at the same time that the data is being provided to a location in main memory.
摘要翻译：当处理器先前已经对数据感兴趣时，提供将重要数据直接注入处理器的高速缓存位置的系统和方法。目标处理器上的存储器子系统将确定是否在目标处理器的处理器高速缓存中找到要写入到与目标处理器相关联的存储器位置的数据的存储器地址。如果确定在目标处理器的高速缓存中找到存储器地址，则在将数据提供给主存储器中的位置的同时，数据将被直接写入该高速缓存。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式