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

41. 发明申请

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.
摘要翻译：在一个实施例中，发送线程接收标识目的地节点的标识符和指向数据的指针。响应于接收到标识符和数据指针，发送线程创建第一个发送请求。发送线程从多个信道中选择所选择的信道。所选择的信道包括所选择的切换队列和所选择的消息单元的标识。每个通道标识不同的消息单元。所选择的切换队列是随机访问的。如果所选择的切换队列包含可用条目，则发送线程将第一个发送请求添加到所选择的切换队列。如果所选择的切换队列不包含可用条目，则发送线程从所选择的切换队列中移除第二发送请求，并将第二发送请求发送到所选择的消息单元。

42. 发明授权

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.
摘要翻译：提供方法，计算节点和计算机程序产品用于计算系统中组件的启发状态轮询。实施例包括通过轮询模块从请求应用程序接收请求状态的组件的状态请求; 由轮询模块确定该组件的活动历史是否满足启发式轮询标准; 如果组件的活动历史满足启发式轮询标准，轮询由轮询模块组成状态; 如果组件的活动历史不满足启发式标准，则轮询模块不会轮询该组件的状态。

43. 发明授权

US07765337B2 Direct memory access transfer completion notification 失效
标题翻译：直接内存访问传输完成通知
公开(公告)号：US07765337B2
公开(公告)日：2010-07-27
申请号：US11758167
申请日：2007-06-05
申请人： Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Burkhard D. Steinmacher-Burow , Pavlos Vranas
发明人： Dong Chen , Mark E. Giampapa , Philip Heidelberger , Sameer Kumar , Jeffrey J. Parker , Burkhard D. Steinmacher-Burow , Pavlos Vranas
IPC分类号： G06F13/28 , G06F3/00 , G06F13/00
CPC分类号： G06F13/28
摘要： Methods, compute nodes, and computer program products are provided for direct memory access (‘DMA’) transfer completion notification. Embodiments include determining, by an origin DMA engine on an origin compute node, whether a data descriptor for an application message to be sent to a target compute node is currently in an injection first-in-first-out (‘FIFO’) buffer in dependence upon a sequence number previously associated with the data descriptor, the total number of descriptors currently in the injection FIFO buffer, and the current sequence number for the newest data descriptor stored in the injection FIFO buffer; and notifying a processor core on the origin DMA engine that the message has been sent if the data descriptor for the message is not currently in the injection FIFO buffer.
摘要翻译：提供方法，计算节点和计算机程序产品用于直接内存访问（“DMA”）传输完成通知。实施例包括通过原始计算节点上的原始DMA引擎确定要发送到目标计算节点的应用消息的数据描述符当前是否处于先进先出先入先出（FIFO）缓冲器依赖于先前与数据描述符相关联的序列号，当前在注入FIFO缓冲器中的描述符的总数以及存储在注入FIFO缓冲器中的最新数据描述符的当前序列号; 并且如果消息的数据描述符当前不在注入FIFO缓冲器中，则通知源DMA引擎上的处理器核心消息已被发送。

44. 发明授权

US07738443B2 Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited 失效
标题翻译：用于在数据包头部空间受限的并行计算系统中的计算节点之间的有序传送的异步广播
公开(公告)号：US07738443B2
公开(公告)日：2010-06-15
申请号：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信息被挤压到分组头部的软件头部中。反过来，整个广播消息不是从根处理器传送到通信器中的每个处理器，而是复制在几个中间节点上，然后将消息复制到较低叶中的节点。因此，为了将广播消息复制到树的较低级别，中间计算节点变为“虚拟根计算节点”。

45. 发明申请

US20090147751A1 METHOD OF APPLYING FAST MOBILE IPV6 FOR MOBILE NODES IN MOBILE NETWORKS, MOBILE ROUTER THEREFOR, AND MOBILE NETWORK THEREFOR 审中-公开
标题翻译：在移动网络中应用快速移动IPV6移动网络的方法，其中的移动路由器及其移动网络
公开(公告)号：US20090147751A1
公开(公告)日：2009-06-11
申请号：US11997961
申请日：2006-08-04
申请人： Lakshmi Prabha Gurusamy , Sameer Kumar , Ranjitsinh Udaysinh Wable , Kishore Mundra , Syam Madanapalli
发明人： Lakshmi Prabha Gurusamy , Sameer Kumar , Ranjitsinh Udaysinh Wable , Kishore Mundra , Syam Madanapalli
IPC分类号： H04W36/00
CPC分类号： H04W8/082 , H04W28/18 , H04W36/0011 , H04W40/36 , H04W80/04
摘要： Provided are a method of applying fast mobile IPv6 (FMIPv6) to a mobile node in order to prevent loss of packets transmitted during a handover of a mobile router from a first access router to a second access router, and a mobile router and a mobile network therefor. Specifically, the mobile router receives, from the first access router, a message containing a prefix corresponding to the second access router, transmits, to the mobile node, a message containing the prefix and information indicating that the prefix is received from the first access router, transmits, to the first access router, a message for FMIPv6, and transmits, to the mobile node, a message to set a zero lifetime for a prefix corresponding to the first access router. Furthermore, the mobile node transmits a message for FMIPv6 to the first access router when the mobile node receives the message containing the prefix.
摘要翻译：提供了一种将快速移动IPv6（FMIPv6）应用于移动节点的方法，以便防止在移动路由器从第一接入路由器切换到第二接入路由器期间发送的分组的丢失，以及移动路由器和移动网络因此。具体地说，移动路由器从第一接入路由器接收到包含与第二接入路由器相对应的前缀的消息，向移动节点发送包含前缀的消息和表示从第一接入路由器接收到前缀的信息向第一接入路由器发送用于FMIPv6的消息，并向移动节点发送消息以针对与第一接入路由器相对应的前缀设置零生存期。此外，当移动节点接收到包含前缀的消息时，移动节点向第一接入路由器发送用于FMIPv6的消息。

46. 发明申请

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.
摘要翻译：提供方法，计算节点和计算机程序产品用于计算系统中组件的启发状态轮询。实施例包括通过轮询模块从请求应用程序接收请求状态的组件的状态请求; 由轮询模块确定该组件的活动历史是否满足启发式轮询标准; 如果组件的活动历史满足启发式轮询标准，轮询由轮询模块组成状态; 如果组件的活动历史不满足启发式标准，则轮询模块不会轮询该组件的状态。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式