会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • DMA engine for repeating communication patterns
    • 用于重复通信模式的DMA引擎
    • US07802025B2
    • 2010-09-21
    • US11768795
    • 2007-06-26
    • Dong ChenAlan G. GaraMark E. GiampapaPhilip HeidelbergerBurkhard Steinmacher-BurowPavlos Vranas
    • Dong ChenAlan G. GaraMark E. GiampapaPhilip HeidelbergerBurkhard Steinmacher-BurowPavlos Vranas
    • G06F13/28
    • G06F15/163
    • A parallel computer system is constructed as a network of interconnected compute nodes to operate a global message-passing application for performing communications across the network. Each of the compute nodes includes one or more individual processors with memories which run local instances of the global message-passing application operating at each compute node to carry out local processing operations independent of processing operations carried out at other compute nodes. Each compute node also includes a DMA engine constructed to interact with the application via Injection FIFO Metadata describing multiple Injection FIFOs where each Injection FIFO may containing an arbitrary number of message descriptors in order to process messages with a fixed processing overhead irrespective of the number of message descriptors included in the Injection FIFO.
    • 并行计算机系统被构造为互连的计算节点的网络,以操作用于在整个网络上执行通信的全局消息传递应用。 每个计算节点包括具有存储器的一个或多个单独处理器,该存储器运行在每个计算节点处操作的全局消息传递应用的本地实例,以独立于在其他计算节点执行的处理操作来执行本地处理操作。 每个计算节点还包括构造成通过描述多个注入FIFO的注入FIFO元数据与应用交互的DMA引擎,其中每个注入FIFO可以包含任意数量的消息描述符,以便处理具有固定处理开销的消息,而不管消息的数量 描述符包含在注入FIFO中。
    • 63. 发明授权
    • Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer
    • 在分布式存储器并行多节点计算机上高效实现多维快速傅里叶变换
    • US07315877B2
    • 2008-01-01
    • US10468998
    • 2002-02-25
    • Gyan V. BhanotDong ChenAlan G. GaraMark E. GiampapaPhilip HeidelbergerBurkhard D. Steinmacher-BurowPavlos M. Vranas
    • Gyan V. BhanotDong ChenAlan G. GaraMark E. GiampapaPhilip HeidelbergerBurkhard D. Steinmacher-BurowPavlos M. Vranas
    • G06F17/14
    • H05K7/20836F24F11/77G06F9/52G06F9/526G06F15/17381G06F17/142G09G5/008H04L7/0338
    • The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via “all-to-all” distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The “all-to-all” re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.
    • 发明内容涉及一种用于有效地实现多维阵列的多维快速傅里叶变换(FFT)的方法,系统和程序存储设备,所述多维阵列包括最初分布在多节点计算机系统中的多个元素,所述多节点包括多个节点 通过网络进行通信,包括:通过所述网络在所述计算机系统的所述多个节点之间以第一维度分布所述阵列的所述多个元素以促进第一一维FFT; 对分布在第一维度中的每个节点的阵列的元素执行第一个一维FFT; 通过网络上的计算机系统的其他节点以随机顺序的“全对全”分布,在第二维度中的每个节点处重新分布一维FFT变换的元素; 以及对在所述第二维度中的每个节点处重新分布的阵列的元素执行第二一维FFT,其中所述随机顺序有助于所述网络的有效利用,从而有效地实现所述多维FFT。 在分布式存储器并行超级计算机上的多维FFT以外的应用中,数组元素的“全部”重新分配进一步有效地实现。
    • 64. 发明授权
    • Fault isolation through no-overhead link level CRC
    • 通过无架空链路级CRC进行故障隔离
    • US07210088B2
    • 2007-04-24
    • US10468996
    • 2002-02-25
    • Dong ChenPaul W. CoteusAlan G. Gara
    • Dong ChenPaul W. CoteusAlan G. Gara
    • G06F11/00G06F13/00G06F7/02H03M13/00
    • H03M13/091G11B20/1833H04L1/0061
    • A fault isolation technique for checking the accuracy of data packets transmitted between nodes of a parallel processor. An independent crc is kept of all data sent from one processor to another, and received from one processor to another. At the end of each checkpoint, the crcs are compared. If they do not match, there was an error. The crcs may be cleared and restarted at each checkpoint. In the preferred embodiment, the basic functionality is to calculate a CRC of all packet data that has been successfully transmitted across a given link. This CRC is done on both ends of the link, thereby allowing an independent check on all data believed to have been correctly transmitted. Preferably, all links have this CRC coverage, and the CRC used in this link level check is different from that used in the packet transfer protocol. This independent check, if successfully passed, virtually eliminates the possibility that any data errors were missed during the previous transfer period.
    • 用于检查并行处理器节点之间传输的数据包的精度的故障隔离技术。 保持从一个处理器发送到另一个处理器的所有数据的独立crc,并从一个处理器接收另一个处理器。 在每个检查点的末尾,比较crcs。 如果它们不匹配,则出现错误。 可以在每个检查点清除并重新启动crcs。 在优选实施例中,基本功能是计算已经通过给定链路成功发送的所有分组数据的CRC。 该CRC在链路的两端完成,从而允许对所有被认为已被正确发送的数据进行独立的检查。 优选地,所有链路具有该CRC覆盖,并且在该链路级检查中使用的CRC与在分组传送协议中使用的不同。 这种独立检查,如果成功通过,几乎消除了在以前的传输期间错过任何数据错误的可能性。