会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • 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.
    • 公开了用于使用在多个计算节点上操作的分布式编译器来生成应用程序的可执行版本的方法,装置和产品,其包括:由每个计算节点接收应用程序的一部分源代码; 由每个计算节点并行地将由该计算节点接收的源代码的部分编译成应用的目标代码的一部分; 由每个计算节点并行执行对该计算节点的应用的目标代码的部分的程序间分析,包括在计算节点之间共享过程间分析的结果; 使用所述程序间分析的共同结果,利用所述计算节点并行地优化所述计算节点的所述应用的所述目标代码的部分; 以及根据应用程序的目标代码的优化部分生成应用程序的可执行版本。
    • 9. 发明申请
    • 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.
    • 并行计算机中的国际数据通信包括计算节点,每个计算节点包括主存储器和消息传送单元,消息传送单元包括计算机存储器和耦合用于数据通信的计算节点,其中针对计算节点启动时的每个计算节点:消息 单元在消息接发单元的计算机存储器中分配预定数量的消息缓冲器,每个消息缓冲器与在计算节点上被初始化的进程相关联; 在计算节点上的特定进程的初始化之前接收用于该特定进程的数据通信消息; 并将数据通信消息存储在与特定进程相关联的消息缓冲器中。 在特定进程的初始化时,该过程在计算节点的主存储器中建立消息缓存器,并将数据通信消息从消息传送单元的消息缓冲器复制到主存储器的消息缓冲器中。
    • 10. 发明申请
    • 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.
    • 对于每个任务,执行在计算节点上执行并行任务的局部屏障操作,包括:检索计数器的当前值; 根据计数器的当前值和执行局部屏障操作的任务的总数,计算计数器的基值,表示在任务加入局部屏障之前的计数器值的基值; 根据基本值和执行局部屏障操作的任务的总数,计算计数器的目标值,当所有任务已经加入局部屏障时计算表示计数器值的目标值; 加入当地的障碍,包括原子地增加柜台的价值; 并且重复地,直到计数器的当前值不小于计数器的目标值:检索计数器的当前值并确定当前值是否等于目标值。