会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Message passing with queues and channels
    • 消息传递与队列和通道
    • US08543722B2
    • 2013-09-24
    • US12750363
    • 2010-03-30
    • Gabor J. DozsaPhilip HeidelbergerSameer KumarJoseph D. RattermanBurkhard Steinmacher-BurowRobert W. Wisniewski
    • Gabor J. DozsaPhilip HeidelbergerSameer KumarJoseph D. RattermanBurkhard Steinmacher-BurowRobert W. Wisniewski
    • G06F15/16
    • 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.
    • 在一个实施例中,发送线程接收标识目的地节点的标识符和指向数据的指针。 响应于接收到标识符和数据指针,发送线程创建第一个发送请求。 发送线程从多个信道中选择所选择的信道。 所选择的信道包括所选择的切换队列和所选择的消息单元的标识。 每个通道标识不同的消息单元。 所选择的切换队列是随机访问的。 如果所选择的切换队列包含可用条目,则发送线程将第一个发送请求添加到所选择的切换队列。 如果所选择的切换队列不包含可用条目,则发送线程从所选择的切换队列中移除第二发送请求,并将第二发送请求发送到所选择的消息单元。
    • 6. 发明申请
    • MESSAGE PASSING WITH A LIMITED NUMBER OF DMA BYTE COUNTERS
    • 消息传递与有限数量的DMA字节计数器
    • US20090007141A1
    • 2009-01-01
    • US11768813
    • 2007-06-26
    • Michael BlocksomeDong ChenMark E. GiampapaPhilip HeidelbergerSameer KumarJeffrey J. Parker
    • Michael BlocksomeDong ChenMark E. GiampapaPhilip HeidelbergerSameer KumarJeffrey J. Parker
    • G06F9/44
    • G06F15/17356G06F9/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)以提供要发送的消息数据。
    • 7. 发明申请
    • 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
    • H04L12/56
    • 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信息被挤压到分组头部的软件头部中。 反过来,整个广播消息不是从根处理器传送到通信器中的每个处理器,而是复制在几个中间节点上,然后将消息复制到较低叶中的节点。 因此,为了将广播消息复制到树的较低级别,中间计算节点变为“虚拟根计算节点”。