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

11. 发明授权

US08381230B2 Message passing with queues and channels 失效
标题翻译：消息传递与队列和通道
公开(公告)号：US08381230B2
公开(公告)日：2013-02-19
申请号：US12764315
申请日：2010-04-21
申请人： Gabor J. Dozsa , Philip Heidelberger , Sameer Kumar , Joseph D. Ratterman , Burkhard Steinmacher-Burow
发明人： Gabor J. Dozsa , Philip Heidelberger , Sameer Kumar , Joseph D. Ratterman , Burkhard Steinmacher-Burow
IPC分类号： G06F3/00
CPC分类号： G06F9/546 , G06F2209/548
摘要： In an embodiment, a reception thread receives a source node identifier, a type, and a data pointer from an application and, in response, creates a receive request. If the source node identifier specifies a source node, the reception thread adds the receive request to a fast-post queue. If a message received from a network does not match a receive request on a posted queue, a polling thread adds a receive request that represents the message to an unexpected queue. If the fast-post queue contains the receive request, the polling thread removes the receive request from the fast-post queue. If the receive request that was removed from the fast-post queue does not match the receive request on the unexpected queue, the polling thread adds the receive request that was removed from the fast-post queue to the posted queue. The reception thread and the polling thread execute asynchronously from each other.
摘要翻译：在一个实施例中，接收线程从应用接收源节点标识符，类型和数据指针，作为响应，创建接收请求。如果源节点标识符指定源节点，则接收线程将接收请求添加到快速发送队列。如果从网络接收到的消息与发布的队列上的接收请求不匹配，轮询线程将将消息的接收请求添加到意外队列。如果快速发送队列包含接收请求，轮询线程将从快速发送队列中删除接收请求。如果从快速发布队列中删除的接收请求与意外队列中的接收请求不匹配，轮询线程将从快速发布队列中删除的接收请求添加到发布的队列。接收线程和轮询线程彼此异步执行。

12. 发明申请

US20110246582A1 Message Passing with Queues and Channels 失效
标题翻译：消息传递与队列和通道
公开(公告)号：US20110246582A1
公开(公告)日：2011-10-06
申请号：US12750363
申请日：2010-03-30
申请人： Gabor J. Dozsa , Philip Heidelberger , Sameer Kumar , Joseph D. Ratterman , Burkhard Steinmacher-Burow , Robert W. Wisniewski
发明人： Gabor J. Dozsa , Philip Heidelberger , Sameer Kumar , Joseph D. Ratterman , Burkhard Steinmacher-Burow , Robert W. Wisniewski
IPC分类号： G06F15/16
CPC分类号： G06F9/546
摘要： In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first send request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.
摘要翻译：在一个实施例中，发送线程接收标识目的地节点的标识符和指向数据的指针。响应于接收到标识符和数据指针，发送线程创建第一个发送请求。发送线程从多个信道中选择所选择的信道。所选择的信道包括所选择的切换队列和所选择的消息单元的标识。每个通道标识不同的消息单元。所选择的切换队列是随机访问的。如果所选择的切换队列包含可用条目，则发送线程将第一个发送请求添加到所选择的切换队列。如果所选择的切换队列不包含可用条目，则发送线程从所选择的切换队列中移除第二发送请求，并将第二发送请求发送到所选择的消息单元。

13. 发明授权

US07958274B2 Heuristic status polling 有权
标题翻译：启发式状态轮询
公开(公告)号：US07958274B2
公开(公告)日：2011-06-07
申请号：US11764282
申请日：2007-06-18
申请人： Charles J. Archer , Michael A. Blocksome , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Joseph D. Ratterman
发明人： Charles J. Archer , Michael A. Blocksome , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Joseph D. Ratterman
IPC分类号： G06F3/00
CPC分类号： H04L12/44 , H04L12/403
摘要： Methods, compute nodes, and computer program products are provided for heuristic status polling of a component in a computing system. Embodiments include receiving, by a polling module from a requesting application, a status request requesting status of a component; determining, by the polling module, whether an activity history for the component satisfies heuristic polling criteria; polling, by the polling module, the component for status if the activity history for the component satisfies the heuristic polling criteria; and not polling, by the polling module, the component for status if the activity history for the component does not satisfy the heuristic criteria.
摘要翻译：提供方法，计算节点和计算机程序产品用于计算系统中组件的启发状态轮询。实施例包括通过轮询模块从请求应用程序接收请求状态的组件的状态请求; 由轮询模块确定该组件的活动历史是否满足启发式轮询标准; 如果组件的活动历史满足启发式轮询标准，轮询由轮询模块组成状态; 如果组件的活动历史不满足启发式标准，则轮询模块不会轮询该组件的状态。

14. 发明申请

US20080313376A1 Heuristic Status Polling 有权
标题翻译：启发式状态轮询
公开(公告)号：US20080313376A1
公开(公告)日：2008-12-18
申请号：US11764282
申请日：2007-06-18
申请人： Charles J. Archer , Michael A. Blocksome , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Joseph D. Ratterman
发明人： Charles J. Archer , Michael A. Blocksome , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Joseph D. Ratterman
IPC分类号： G06F13/22
CPC分类号： H04L12/44 , H04L12/403
摘要： Methods, compute nodes, and computer program products are provided for heuristic status polling of a component in a computing system. Embodiments include receiving, by a polling module from a requesting application, a status request requesting status of a component; determining, by the polling module, whether an activity history for the component satisfies heuristic polling criteria; polling, by the polling module, the component for status if the activity history for the component satisfies the heuristic polling criteria; and not polling, by the polling module, the component for status if the activity history for the component does not satisfy the heuristic criteria.
摘要翻译：提供方法，计算节点和计算机程序产品用于计算系统中组件的启发状态轮询。实施例包括通过轮询模块从请求应用程序接收请求状态的组件的状态请求; 由轮询模块确定该组件的活动历史是否满足启发式轮询标准; 如果组件的活动历史满足启发式轮询标准，轮询由轮询模块组成状态; 如果组件的活动历史不满足启发式标准，则轮询模块不会轮询该组件的状态。

15. 发明申请

US20090007141A1 MESSAGE PASSING WITH A LIMITED NUMBER OF DMA BYTE COUNTERS 失效
标题翻译：消息传递与有限数量的DMA字节计数器
公开(公告)号：US20090007141A1
公开(公告)日：2009-01-01
申请号：US11768813
申请日：2007-06-26
申请人： Michael Blocksome , Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker
发明人： Michael Blocksome , Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker
IPC分类号： G06F9/44
CPC分类号： G06F15/17356 , G06F9/546
摘要： A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node. Using one DMA FIFO at the source compute node, the RTS descriptors are maintained for rendezvous messages destined for the destination compute node to ensure proper message data ordering thereat. Using a reception counter at a DMA engine, the destination compute node tracks reception of the RTS and associated message data and sends a clear to send (CTS) message to the source node in a rendezvous protocol form of a remote get to accept the RTS message and message data and processing the remote get (CTS) by the source compute node DMA engine to provide the message data to be sent.
摘要翻译：一种在并行计算机系统中传送消息的方法，该并行计算机系统被构造为作为网络互连的多个计算节点，其中每个计算节点包括DMA引擎，但是仅包括有限数量的字节计数器，用于跟踪由 DMA引擎，其中可以在共享计数器或专用计数器操作模式中使用字节计数器。该方法包括使用会合协议，源计算节点使用专用注入计数器确定性地发送具有单个RTS描述符的请求（RTS）消息以跟踪要与RTS消息相关联地发送的RTS消息和消息数据，到目的地计算节点，使得RTS描述符向目标计算节点指示消息数据将自适应地路由到目的地节点。在源计算节点使用一个DMA FIFO，将为发往目的地计算节点的会合消息保留RTS描述符，以确保正确的消息数据顺序。在DMA引擎上使用接收计数器，目的地计算节点跟踪RTS和相关联的消息数据的接收，并以远程获取的会合协议形式向源节点发送明确发送（CTS）消息以接受RTS消息和消息数据，并由源计算节点DMA引擎处理远程获取（CTS）以提供要发送的消息数据。

16. 发明授权

US08032892B2 Message passing with a limited number of DMA byte counters 失效
标题翻译：消息传递有限数量的DMA字节计数器
公开(公告)号：US08032892B2
公开(公告)日：2011-10-04
申请号：US11768813
申请日：2007-06-26
申请人： Michael Blocksome , Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker
发明人： Michael Blocksome , Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker
IPC分类号： G06F9/44 , G06F9/46 , G06F13/00 , G06F15/167
CPC分类号： G06F15/17356 , G06F9/546
摘要： A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node. Using one DMA FIFO at the source compute node, the RTS descriptors are maintained for rendezvous messages destined for the destination compute node to ensure proper message data ordering thereat. Using a reception counter at a DMA engine, the destination compute node tracks reception of the RTS and associated message data and sends a clear to send (CTS) message to the source node in a rendezvous protocol form of a remote get to accept the RTS message and message data and processing the remote get (CTS) by the source compute node DMA engine to provide the message data to be sent.
摘要翻译：一种在并行计算机系统中传送消息的方法，该并行计算机系统被构造为作为网络互连的多个计算节点，其中每个计算节点包括DMA引擎，但是仅包括有限数量的字节计数器，用于跟踪由 DMA引擎，其中可以在共享计数器或专用计数器操作模式中使用字节计数器。该方法包括使用会合协议，源计算节点使用专用注入计数器确定性地发送具有单个RTS描述符的请求（RTS）消息以跟踪要与RTS消息相关联地发送的RTS消息和消息数据，到目的地计算节点，使得RTS描述符向目标计算节点指示消息数据将自适应地路由到目的地节点。在源计算节点使用一个DMA FIFO，将为发往目的地计算节点的会合消息保留RTS描述符，以确保正确的消息数据顺序。在DMA引擎上使用接收计数器，目的地计算节点跟踪RTS和相关联的消息数据的接收，并以远程获取的会合协议形式向源节点发送明确发送（CTS）消息以接受RTS消息和消息数据，并由源计算节点DMA引擎处理远程获取（CTS）以提供要发送的消息数据。

17. 发明申请

US20110179229A1 STORE-OPERATE-COHERENCE-ON-VALUE 有权
标题翻译：存储操作相关值
公开(公告)号：US20110179229A1
公开(公告)日：2011-07-21
申请号：US12986652
申请日：2011-01-07
申请人： Dong Chen , Philip Heidelberger , Sameer Kumar , Martin Ohmacht , Burkhard Steinmacher-Burow
发明人： Dong Chen , Philip Heidelberger , Sameer Kumar , Martin Ohmacht , Burkhard Steinmacher-Burow
IPC分类号： G06F12/08
CPC分类号： G06F12/0815 , G06F9/30043 , G06F9/30072 , G06F9/30087 , G06F9/3834 , Y02D10/13
摘要： A system, method and computer program product for performing various store-operate instructions in a parallel computing environment that includes a plurality of processors and at least one cache memory device. A queue in the system receives, from a processor, a store-operate instruction that specifies under which condition a cache coherence operation is to be invoked. A hardware unit in the system runs the received store-operate instruction. The hardware unit evaluates whether a result of the running the received store-operate instruction satisfies the condition. The hardware unit invokes a cache coherence operation on a cache memory address associated with the received store-operate instruction if the result satisfies the condition. Otherwise, the hardware unit does not invoke the cache coherence operation on the cache memory device.
摘要翻译：一种用于在包括多个处理器和至少一个高速缓冲存储器设备的并行计算环境中执行各种存储操作指令的系统，方法和计算机程序产品。系统中的队列从处理器接收存储操作指令，该指令指定在哪个条件下调用高速缓存一致性操作。系统中的硬件单元运行接收到的存储操作指令。硬件单元评估运行接收到的存储操作指令的结果是否满足条件。如果结果满足条件，则硬件单元调用与接收到的存储操作指令相关联的高速缓存存储器地址的高速缓存一致性操作。否则，硬件单元不会调用高速缓存存储器设备上的高速缓存一致性操作。

18. 发明授权

US07899055B2 Method for route optimization with dual mobile IPv4 node in IPv6-only network 有权
标题翻译：仅在IPv6网络中使用双移动IPv4节点进行路由优化的方法
公开(公告)号：US07899055B2
公开(公告)日：2011-03-01
申请号：US11645671
申请日：2006-12-27
申请人： Kishore Mundra , Lakshmi Praba Gurusamy , Sameer Kumar , Ranjitsinh Udaysinh Wable
发明人： Kishore Mundra , Lakshmi Praba Gurusamy , Sameer Kumar , Ranjitsinh Udaysinh Wable
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04W8/082 , H04W80/04 , H04W80/045
摘要： A method for route optimization with a dual mobile IPv4 node in an IPv6-only network is provided. The method includes the operations of: receiving a visited IPv6 address from a router when the dual mobile node is connected to the IPv6-only network; updating a home agent with the IPv6 address; deregistering a binding update with a correspondent node via the home agent; updating the correspondent node with an IPv6 address; checking the reachability of packets directly to the correspondent node using its IPv6 address; the mobile node starting sending, to the CN, data packets tunneled in an IPv6 packet once the reachability is verified; and the correspondent node sending tunneled data packets directly to an IPv6 address of the mobile node.
摘要翻译：提供了一种仅在IPv6网络中使用双移动IPv4节点进行路由优化的方法。该方法包括以下操作：当双移动节点连接到仅IPv6网络时，从路由器接收到访问的IPv6地址; 使用IPv6地址更新归属代理; 通过归属代理注销与通信节点的绑定更新; 用IPv6地址更新对端节点; 使用其IPv6地址将数据包的可达性直接检查到对端节点; 移动节点开始向CN发送一旦IPv6包中隧道的数据包，一旦可达性得到验证，并且对端节点将隧道化数据分组直接发送到移动节点的IPv6地址。

19. 发明申请

US20090003344A1 ASYNCRONOUS BROADCAST FOR ORDERED DELIVERY BETWEEN COMPUTE NODES IN A PARALLEL COMPUTING SYSTEM WHERE PACKET HEADER SPACE IS LIMITED 失效
标题翻译：有限公司在并行计算系统中的计算机之间的订单交付，其中包装头空间有限公司
公开(公告)号：US20090003344A1
公开(公告)日：2009-01-01
申请号：US11768619
申请日：2007-06-26
申请人： Sameer Kumar
发明人： Sameer Kumar
IPC分类号： H04L12/56
CPC分类号： H04L12/1854
摘要： 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.
摘要翻译：公开了一种用于在并行计算系统中接收处理器的机制，用于向从广播呼叫接收的数据分组提供命令，并且将节点处接收到的数据分组与限制报头空间的若干输入异步广播消息进行区分。在本发明中，树的较低叶处理器不需要通过直接访问根处理器的缓冲器中的数据而获得广播消息。相反，每个后续的中间节点的等级id信息被挤压到分组头部的软件头部中。反过来，整个广播消息不是从根处理器传送到通信器中的每个处理器，而是复制在几个中间节点上，然后将消息复制到较低叶中的节点。因此，为了将广播消息复制到树的较低级别，中间计算节点变为“虚拟根计算节点”。

20. 发明申请

US20070258424A1 Method of route optimization with dual mobile node in IPv4-only network 审中-公开
标题翻译：仅在IPv4网络中使用双移动节点的路由优化方法
公开(公告)号：US20070258424A1
公开(公告)日：2007-11-08
申请号：US11585912
申请日：2006-10-25
申请人： Ranjitsinh Wable , Lakshmi Gurusamy , Sameer Kumar , Kishore Mundra , Syam Madanapalli
发明人： Ranjitsinh Wable , Lakshmi Gurusamy , Sameer Kumar , Kishore Mundra , Syam Madanapalli
IPC分类号： H04Q7/24
CPC分类号： H04W8/082 , H04L45/52 , H04L2212/00 , H04W40/34 , H04W80/04 , H04W80/045
摘要： A method of achieving route optimization (RO) when a dual capable mobile Internet protocol version 6 (MIPv6) mobile node is connected with an IPv4-only network allows RO of packets to traverse a shorter route than the default one through the home agent (HA) using bidirectional tunneling, and leads to better bandwidth utilization. The method of RO with a dual MIPV6 node in an IPV4-only network includes updating the HA with an IPv4 address of the MN and deregistering a binding update (BU) with a corresponding node (CN) via the HA; informing the CN about its IPv4 address and receiving the CN's IPv4 address in reply; checking reachability of the CN in its IPv4 address using an IPv6-in-IPv4 tunnel; and sending and receiving Ipv6 data packets to/from the CN using a v4 tunnel.
摘要翻译：当双重能力的移动互联网协议版本6（MIPv6）移动节点与仅IPv4网络连接时，实现路由优化（RO）的方法允许分组的RO穿过比默认路由优先于通过归属代理（HA ）使用双向隧道，并带来更好的带宽利用率。在仅IPV4网络中具有双MIPV6节点的RO的方法包括用MN的IPv4地址更新HA并经由HA通过对应节点（CN）去注销绑定更新（BU）; 向CN通知其IPv4地址并接收CN的IPv4地址; 使用IPv6-in-IPv4隧道检查CN在其IPv4地址中的可达性; 并使用v4隧道向/从CN发送和接收Ipv6数据包。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式