会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 43. 发明申请
    • Remote Direct Memory Access
    • 远程直接内存访问
    • US20080267066A1
    • 2008-10-30
    • US11740361
    • 2007-04-26
    • Charles J. ArcherMichael A. Blocksome
    • Charles J. ArcherMichael A. Blocksome
    • H04B7/204
    • G06F13/28
    • Methods, parallel computers, and computer program products are disclosed for remote direct memory access. Embodiments include transmitting, from an origin DMA engine on an origin compute node to a plurality target DMA engines on target compute nodes, a request to send message, the request to send message specifying a data to be transferred from the origin DMA engine to data storage on each target compute node; receiving, by each target DMA engine on each target compute node, the request to send message; preparing, by each target DMA engine, to store data according to the data storage reference and the data length, including assigning a base storage address for the data storage reference; sending, by one or more of the target DMA engines, an acknowledgment message acknowledging that all the target DMA engines are prepared to receive a data transmission from the origin DMA engine; receiving, by the origin DMA engine, the acknowledgement message from the one or more of the target DMA engines; and transferring, by the origin DMA engine, data to data storage on each of the target compute nodes according to the data storage reference using a single direct put operation.
    • 公开了用于远程直接存储器访问的方法,并行计算机和计算机程序产品。 实施例包括从源计算节点上的原始DMA引擎向目标计算节点上的多个目标DMA引擎发送发送消息的请求,发送消息的请求,该消息指定要从原始DMA引擎传输的数据到数据存储 在每个目标计算节点上; 由每个目标计算节点上的每个目标DMA引擎接收发送消息的请求; 通过每个目标DMA引擎准备根据数据存储参考和数据长度存储数据,包括分配用于数据存储参考的基本存储地址; 由一个或多个目标DMA引擎发送确认消息,确认所有目标DMA引擎准备好从原始DMA引擎接收数据传输; 由原始DMA引擎从一个或多个目标DMA引擎接收确认消息; 并且由原始DMA引擎使用单个直接放置操作根据数据存储参考将数据传送到每个目标计算节点上的数据存储。
    • 48. 发明授权
    • 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.
    • 公开了用于使用在多个计算节点上操作的分布式编译器来生成应用程序的可执行版本的方法,装置和产品,其包括:由每个计算节点接收应用程序的一部分源代码; 由每个计算节点并行地将由该计算节点接收的源代码的部分编译成应用的目标代码的一部分; 由每个计算节点并行执行对该计算节点的应用的目标代码的部分的程序间分析,包括在计算节点之间共享过程间分析的结果; 使用所述程序间分析的共同结果,利用所述计算节点并行地优化所述计算节点的所述应用的所述目标代码的部分; 以及根据应用程序的目标代码的优化部分生成应用程序的可执行版本。
    • 49. 发明申请
    • 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.
    • 对于每个任务,执行在计算节点上执行并行任务的局部屏障操作,包括:检索计数器的当前值; 根据计数器的当前值和执行局部屏障操作的任务的总数,计算计数器的基值,表示在任务加入局部屏障之前的计数器值的基值; 根据基本值和执行局部屏障操作的任务的总数,计算计数器的目标值,当所有任务已经加入局部屏障时计算表示计数器值的目标值; 加入当地的障碍,包括原子地增加柜台的价值; 并且重复地,直到计数器的当前值不小于计数器的目标值:检索计数器的当前值并确定当前值是否等于目标值。