利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

147 条记录 (耗时 0.06 秒)

    Heuristic status polling
    1.
    发明授权
    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.

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

    Heuristic Status Polling
    2.
    发明申请
    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.

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

    Replenishing Data Descriptors in a DMA Injection FIFO Buffer
    5.
    发明申请
    Replenishing Data Descriptors in a DMA Injection FIFO Buffer 失效
    在DMA注入FIFO缓冲区中补充数据描述符

    公开(公告)号：US20100268852A1

    公开(公告)日：2010-10-21

    申请号：US11755501

    申请日：2007-05-30

    申请人： Charles J Archer ,  Michael A. Blocksome ,  Bob R. Cernohous ,  Philip Heidelberger ,  Sameer Kumar ,  Jeffrey J. Parker

    发明人： Charles J Archer ,  Michael A. Blocksome ,  Bob R. Cernohous ,  Philip Heidelberger ,  Sameer Kumar ,  Jeffrey J. Parker

    IPC分类号： G06F13/28

    CPC分类号： G06F13/28

    摘要： Methods, apparatus, and products are disclosed for replenishing data descriptors in a Direct Memory Access (‘DMA’) injection first-in-first-out (‘FIFO’) buffer that include: determining, by a messaging module on an origin compute node, whether a number of data descriptors in a DMA injection FIFO buffer exceeds a predetermined threshold, each data descriptor specifying an application message for transmission to a target compute node; queuing, by the messaging module, a plurality of new data descriptors in a pending descriptor queue if the number of the data descriptors in the DMA injection FIFO buffer exceeds the predetermined threshold; establishing, by the messaging module, interrupt criteria that specify when to replenish the injection FIFO buffer with the plurality of new data descriptors in the pending descriptor queue; and injecting, by the messaging module, the plurality of new data descriptors into the injection FIFO buffer in dependence upon the interrupt criteria.

    摘要翻译： 公开了用于在直接存储器访问（“DMA”）注入先进先出（'FIFO'）缓冲器中补充数据描述符的方法，装置和产品，其包括：由原始计算节点 无论DMA注入FIFO缓冲器中的多个数据描述符是否超过预定阈值，每个数据描述符指定用于传输到目标计算节点的应用消息; 如果DMA注入FIFO缓冲器中的数据描述符的数量超过预定阈值，则由消息接发模块排队等待描述符队列中的多个新数据描述符; 由所述消息传递模块建立中断标准，所述中断标准指定何时用所述待处理描述符队列中的所述多个新数据描述符补充所述注入FIFO缓冲器; 以及根据所述中断标准，由所述消息收发模块将所述多个新数据描述符注入到所述注入FIFO缓冲器中。

    Replenishing data descriptors in a DMA injection FIFO buffer
    6.
    发明授权
    Replenishing data descriptors in a DMA injection FIFO buffer 失效
    在DMA注入FIFO缓冲区中补充数据描述符

    公开(公告)号：US08037213B2

    公开(公告)日：2011-10-11

    申请号：US11755501

    申请日：2007-05-30

    申请人： Charles J. Archer ,  Michael A. Blocksome ,  Bob R. Cernohous ,  Philip Heidelberger ,  Sameer Kumar ,  Jeffrey J. Parker

    发明人： Charles J. Archer ,  Michael A. Blocksome ,  Bob R. Cernohous ,  Philip Heidelberger ,  Sameer Kumar ,  Jeffrey J. Parker

    IPC分类号： G06F3/00 ,  H04L12/28

    CPC分类号： G06F13/28

    摘要： Methods, apparatus, and products are disclosed for replenishing data descriptors in a Direct Memory Access (‘DMA’) injection first-in-first-out (‘FIFO’) buffer that include: determining, by a messaging module on an origin compute node, whether a number of data descriptors in a DMA injection FIFO buffer exceeds a predetermined threshold, each data descriptor specifying an application message for transmission to a target compute node; queuing, by the messaging module, a plurality of new data descriptors in a pending descriptor queue if the number of the data descriptors in the DMA injection FIFO buffer exceeds the predetermined threshold; establishing, by the messaging module, interrupt criteria that specify when to replenish the injection FIFO buffer with the plurality of new data descriptors in the pending descriptor queue; and injecting, by the messaging module, the plurality of new data descriptors into the injection FIFO buffer in dependence upon the interrupt criteria.

    摘要翻译： 公开了用于在直接存储器访问（“DMA”）注入先进先出（'FIFO'）缓冲器中补充数据描述符的方法，装置和产品，其包括：由原始计算节点 无论DMA注入FIFO缓冲器中的多个数据描述符是否超过预定阈值，每个数据描述符指定用于传输到目标计算节点的应用消息; 如果DMA注入FIFO缓冲器中的数据描述符的数量超过预定阈值，则由消息接发模块排队等待描述符队列中的多个新数据描述符; 由所述消息传递模块建立中断标准，所述中断标准指定何时用所述待处理描述符队列中的所述多个新数据描述符补充所述注入FIFO缓冲器; 以及根据所述中断标准，由所述消息收发模块将所述多个新数据描述符注入到所述注入FIFO缓冲器中。

    EXECUTING AN ALLGATHER OPERATION WITH AN ALLTOALLV OPERATION IN A PARALLEL COMPUTER
    7.
    发明申请
    EXECUTING AN ALLGATHER OPERATION WITH AN ALLTOALLV OPERATION IN A PARALLEL COMPUTER 审中-公开
    使用并行计算机中的ALLTOALLV操作执行全局操作

    公开(公告)号：US20080022079A1

    公开(公告)日：2008-01-24

    申请号：US11459387

    申请日：2006-07-24

    申请人： Charles J. Archer ,  Philip Heidelberger ,  Jose Eduardo Moreira ,  Joseph D. Ratterman

    发明人： Charles J. Archer ,  Philip Heidelberger ,  Jose Eduardo Moreira ,  Joseph D. Ratterman

    IPC分类号： G06F9/44

    CPC分类号： G06F9/542 ,  H04L49/90

    摘要： Executing an allgather operation on a parallel computer, including executing an alltoallv operation with a list of send displacements, where each send displacement is a send buffer segment pointer, each send displacement points to the same segment of a send buffer, the parallel computer includes a plurality of compute nodes, each compute node includes a send buffer, the compute nodes are organized into at least one operational group of compute nodes for collective operations, each compute node in the operational group is assigned a unique rank, and each send buffer is segmented according to the ranks.

    摘要翻译： 在并行计算机上执行allgather操作，包括执行具有发送位移列表的alltoallv操作，其中每个发送位移是发送缓冲区段指针，每个发送位移点指向发送缓冲器的相同段，并行计算机包括 多个计算节点，每个计算节点包括发送缓冲器，计算节点被组织成用于集合操作的计算节点的至少一个操作组，操作组中的每个计算节点被分配唯一的等级，并且每个发送缓冲器被分段 根据排名。

    Message Passing with Queues and Channels
    8.
    发明申请
    Message Passing with Queues and Channels 失效
    消息传递与队列和通道

    公开(公告)号：US20110265098A1

    公开(公告)日：2011-10-27

    申请号：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分类号： G06F9/54

    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.

    摘要翻译： 在一个实施例中，接收线程从应用接收源节点标识符，类型和数据指针，作为响应，创建接收请求。 如果源节点标识符指定源节点，则接收线程将接收请求添加到快速发送队列。 如果从网络接收到的消息与发布的队列上的接收请求不匹配，轮询线程将将消息的接收请求添加到意外队列。 如果快速发送队列包含接收请求，轮询线程将从快速发送队列中删除接收请求。 如果从快速发布队列中删除的接收请求与意外队列中的接收请求不匹配，轮询线程将从快速发布队列中删除的接收请求添加到发布的队列。 接收线程和轮询线程彼此异步执行。

    Message passing with queues and channels
    9.
    发明授权
    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.

    摘要翻译： 在一个实施例中，接收线程从应用接收源节点标识符，类型和数据指针，作为响应，创建接收请求。 如果源节点标识符指定源节点，则接收线程将接收请求添加到快速发送队列。 如果从网络接收到的消息与发布的队列上的接收请求不匹配，轮询线程将将消息的接收请求添加到意外队列。 如果快速发送队列包含接收请求，轮询线程将从快速发送队列中删除接收请求。 如果从快速发布队列中删除的接收请求与意外队列中的接收请求不匹配，轮询线程将从快速发布队列中删除的接收请求添加到发布的队列。 接收线程和轮询线程彼此异步执行。

    Message Passing with Queues and Channels
    10.
    发明申请
    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.

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