会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Generating an executable version of an application using a distributed compiler operating on a plurality of compute nodes
    • 使用在多个计算节点上运行的分布式编译器生成应用程序的可执行版本
    • US08495603B2
    • 2013-07-23
    • US12189336
    • 2008-08-11
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanAlbert SidelnikBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanAlbert SidelnikBrian E. Smith
    • G06F9/44
    • G06F9/54G06F8/443
    • Methods, apparatus, and products are disclosed for generating an executable version of an application using a distributed compiler operating on a plurality of compute nodes that include: receiving, by each compute node, a portion of source code for an application; compiling, in parallel by each compute node, the portion of the source code received by that compute node into a portion of object code for the application; performing, in parallel by each compute node, inter-procedural analysis on the portion of the object code of the application for that compute node, including sharing results of the inter-procedural analysis among the compute nodes; optimizing, in parallel by each compute node, the portion of the object code of the application for that compute node using the shared results of the inter-procedural analysis; and generating the executable version of the application in dependence upon the optimized portions of the object code of the application.
    • 公开了用于使用在多个计算节点上操作的分布式编译器来生成应用程序的可执行版本的方法,装置和产品,其包括:由每个计算节点接收应用程序的一部分源代码; 由每个计算节点并行地将由该计算节点接收的源代码的部分编译成应用的目标代码的一部分; 由每个计算节点并行执行对该计算节点的应用的目标代码的部分的程序间分析,包括在计算节点之间共享过程间分析的结果; 使用所述程序间分析的共同结果,利用所述计算节点并行地优化所述计算节点的所述应用的所述目标代码的部分; 以及根据应用程序的目标代码的优化部分生成应用程序的可执行版本。
    • 62. 发明申请
    • Internode Data Communications In A Parallel Computer
    • 并行计算机中的国际数据通信
    • US20130117764A1
    • 2013-05-09
    • US13290642
    • 2011-11-07
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJeffrey J. ParkerJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJeffrey J. ParkerJoseph D. RattermanBrian E. Smith
    • G06F9/46
    • G06F9/544
    • Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory.
    • 并行计算机中的国际数据通信包括计算节点,每个计算节点包括主存储器和消息传送单元,消息传送单元包括计算机存储器和耦合用于数据通信的计算节点,其中针对计算节点启动时的每个计算节点:消息 单元在消息接发单元的计算机存储器中分配预定数量的消息缓冲器,每个消息缓冲器与在计算节点上被初始化的进程相关联; 在计算节点上的特定进程的初始化之前接收用于该特定进程的数据通信消息; 并将数据通信消息存储在与特定进程相关联的消息缓冲器中。 在特定进程的初始化时,该过程在计算节点的主存储器中建立消息缓存器,并将数据通信消息从消息传送单元的消息缓冲器复制到主存储器的消息缓冲器中。
    • 64. 发明授权
    • Message passing with queues and channels
    • 消息传递与队列和通道
    • US08381230B2
    • 2013-02-19
    • US12764315
    • 2010-04-21
    • Gabor J. DozsaPhilip HeidelbergerSameer KumarJoseph D. RattermanBurkhard Steinmacher-Burow
    • Gabor J. DozsaPhilip HeidelbergerSameer KumarJoseph D. RattermanBurkhard Steinmacher-Burow
    • G06F3/00
    • G06F9/546G06F2209/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.
    • 在一个实施例中,接收线程从应用接收源节点标识符,类型和数据指针,作为响应,创建接收请求。 如果源节点标识符指定源节点,则接收线程将接收请求添加到快速发送队列。 如果从网络接收到的消息与发布的队列上的接收请求不匹配,轮询线程将将消息的接收请求添加到意外队列。 如果快速发送队列包含接收请求,轮询线程将从快速发送队列中删除接收请求。 如果从快速发布队列中删除的接收请求与意外队列中的接收请求不匹配,轮询线程将从快速发布队列中删除的接收请求添加到发布的队列。 接收线程和轮询线程彼此异步执行。
    • 65. 发明申请
    • Performing A Local Barrier Operation
    • 执行局部屏障操作
    • US20130042254A1
    • 2013-02-14
    • US13206590
    • 2011-08-10
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F9/52
    • G06F9/54G06F9/522
    • Performing a local barrier operation with parallel tasks executing on a compute node including, for each task: retrieving a present value of a counter; calculating, in dependence upon the present value of the counter and a total number of tasks performing the local barrier operation, a base value of the counter, the base value representing the counter's value prior to any task joining the local barrier; calculating, in dependence upon the base value and the total number of tasks performing the local barrier operation, a target value of the counter, the target value representing the counter's value when all tasks have joined the local barrier; joining the local barrier, including atomically incrementing the value of the counter; and repetitively, until the present value of the counter is no less than the target value of the counter: retrieving the present value of the counter and determining whether the present value equals the target value.
    • 对于每个任务,执行在计算节点上执行并行任务的局部屏障操作,包括:检索计数器的当前值; 根据计数器的当前值和执行局部屏障操作的任务的总数,计算计数器的基值,表示在任务加入局部屏障之前的计数器值的基值; 根据基本值和执行局部屏障操作的任务的总数,计算计数器的目标值,当所有任务已经加入局部屏障时计算表示计数器值的目标值; 加入当地的障碍,包括原子地增加柜台的价值; 并且重复地,直到计数器的当前值不小于计数器的目标值:检索计数器的当前值并确定当前值是否等于目标值。
    • 69. 发明申请
    • Data Communications In A Parallel Active Messaging Interface Of A Parallel Computer
    • 并行计算机并行主动消息接口中的数据通信
    • US20120210094A1
    • 2012-08-16
    • US13027421
    • 2011-02-15
    • Michael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Michael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F12/10
    • G06F15/17337G06F12/109
    • Eager send data communications in a parallel active messaging interface (PAMI) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.
    • 渴望在并行计算机的并行活动消息接口(PAMI)中发送数据通信,PAMI由指定客户端,上下文和任务的数据通信端点组成,包括接收具有传送数据的传送数据的热切的发送数据通信指令 发送缓冲器,其特征在于在原点端点的读/写虚拟地址空间中的读/写发送缓冲存储器地址; 为发送缓冲区确定只读虚拟地址空间中的只读发送缓冲存储器地址,原始端点和目标端点共享的只读虚拟地址空间,物理内存的所有帧映射到 只读虚拟地址空间中的虚拟内存; 并且由源端点与目标端点进行通信,其包括只读发送缓冲存储器地址的热切发送消息头。
    • 70. 发明申请
    • Data Communications In A Parallel Active Messaging Interface Of A Parallel Computer
    • 并行计算机并行主动消息接口中的数据通信
    • US20120151485A1
    • 2012-06-14
    • US12963694
    • 2010-12-09
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F9/46
    • G06F9/546
    • Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a data communications instruction, the instruction characterized by an instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance with the instruction type, the transfer data from the origin endpoint to the target endpoint.
    • 并行计算机的并行主动消息接口(“PAMI”)中的数据通信,并行计算机包括执行并行应用的多个计算节点,由数据通信端点组成的PAMI,每个端点包括数据通信参数的规范 对于在计算节点上执行的线程,包括客户端,上下文和任务的规范,所述计算节点和端点被耦合用于通过PAMI进行数据通信,并且通过数据通信资源,包括在源终端中接收 PAMI数据通信指令,以指令类型为特征的指令,指示传输数据从原始端点传输到目标端点的指令,并根据指令类型将传输数据从原点终端发送到目标 端点。