会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 73. 发明申请
    • Method and apparatus for detecting a cache wrap condition
    • 用于检测缓存包装条件的方法和装置
    • US20060230239A1
    • 2006-10-12
    • US11093132
    • 2005-03-29
    • Matthias BlumrichAlan GaraMark GiampapaMartin OhmachtValentina Salapura
    • Matthias BlumrichAlan GaraMark GiampapaMartin OhmachtValentina Salapura
    • G06F13/28
    • G06F12/0822G06F12/0831
    • A method and apparatus for detecting a cache wrap condition in a computing environment having a processor and a cache. A cache wrap condition is detected when the entire contents of a cache have been replaced, relative to a particular starting state. A set-associative cache is considered to have wrapped when all of the sets within the cache have been replaced. The starting point for cache wrap detection is the state of the cache sets at the time of the previous cache wrap. The method and apparatus is preferably implemented in a snoop filter having filter mechanisms that rely upon detecting the cache wrap condition. These snoop filter mechanisms requiring this information are operatively coupled with cache wrap detection logic adapted to detect the cache wrap event, and perform an indication step to the snoop filter mechanisms. In the various embodiments, cache wrap detection logic is implemented using registers and comparators, loadable counters, or a scoreboard data structure.
    • 一种用于在具有处理器和高速缓存的计算环境中检测高速缓存包装条件的方法和装置。 当高速缓存的全部内容相对于特定的启动状态被替换时,检测到缓存包装条件。 当缓存中的所有集合已被替换时,集合关联缓存被认为已被包装。 高速缓存包检测的起始点是先前高速缓存包装时高速缓存集的状态。 该方法和装置优选地在具有依赖于检测高速缓存包装条件的过滤机构的窥探过滤器中实现。 这些需要该信息的窥探过滤机构可操作地与适用于检测高速缓存包裹事件的高速缓存包检测逻辑耦合,并且向窥探过滤机构执行指示步骤。 在各种实施例中,使用寄存器和比较器,可加载计数器或记分板数据结构来实现高速缓存封包检测逻辑。
    • 78. 发明授权
    • Optimizing layout of an application on a massively parallel supercomputer
    • 在大型并行超级计算机上优化应用程序的布局
    • US08117288B2
    • 2012-02-14
    • US10963101
    • 2004-10-12
    • Gyan V. BhanotAlan GaraPhilip HeidelbergerEoin M. LawlessJames C. SextonRobert E. Walkup
    • Gyan V. BhanotAlan GaraPhilip HeidelbergerEoin M. LawlessJames C. SextonRobert E. Walkup
    • G06F15/177
    • G06F9/5066
    • A general computer-implement method and apparatus to optimize problem layout on a massively parallel supercomputer is described. The method takes as input the communication matrix of an arbitrary problem in the form of an array whose entries C(i, j) are the amount to data communicated from domain i to domain j. Given C(i, j), first implement a heuristic map is implemented which attempts sequentially to map a domain and its communications neighbors either to the same supercomputer node or to near-neighbor nodes on the supercomputer torus while keeping the number of domains mapped to a supercomputer node constant (as much as possible). Next a Markov Chain of maps is generated from the initial map using Monte Carlo simulation with Free Energy (cost function) F=Σi,jC(i,j)H(i,j)− where H(i,j) is the smallest number of hops on the supercomputer torus between domain i and domain j. On the cases tested, found was that the method produces good mappings and has the potential to be used as a general layout optimization tool for parallel codes. At the moment, the serial code implemented to test the method is un-optimized so that computation time to find the optimum map can be several hours on a typical PC. For production implementation, good parallel code for our algorithm would be required which could itself be implemented on supercomputer.
    • 描述了在大型并行超级计算机上优化问题布局的通用计算机实现方法和装置。 该方法采用数组形式的任意问题的通信矩阵作为输入,其条目C(i,j)是从域i到域j传送的数据量。 给定C(i,j),首先实现启发式映射,其尝试顺序地将域及其通信邻居映射到超级计算机节点或超级计算机环面上的近邻节点,同时保持域的数量映射到 超级计算机节点常数(尽可能多)。 接下来,使用具有自由能的蒙特卡罗模拟(成本函数)F =&Sgr; i,jC(i,j)H(i,j),从初始映射生成马尔科夫链映射。其中H(i,j) 域i和域j之间的超级计算机环面上的最小跳数。 在测试的情况下,发现该方法产生良好的映射,并且有可能被用作并行代码的通用布局优化工具。 此时,实现测试方法的序列号未优化,以便在典型的PC上找到最佳映射的计算时间可以为几个小时。 对于生产实现,将需要我们的算法的良好的并行代码,这本身可以在超级计算机上实现。
    • 79. 发明授权
    • Bad data packet capture device
    • 坏数据包捕获设备
    • US07701846B2
    • 2010-04-20
    • US11768572
    • 2007-06-26
    • Dong ChenAlan GaraPhilip HeidelbergerPavlos Vranas
    • Dong ChenAlan GaraPhilip HeidelbergerPavlos Vranas
    • H04L1/00
    • H04L43/0847
    • An apparatus and method for capturing data packets for analysis on a network computing system includes a sending node and a receiving node connected by a bi-directional communication link. The sending node sends a data transmission to the receiving node on the bi-directional communication link, and the receiving node receives the data transmission and verifies the data transmission to determine valid data and invalid data and verify retransmissions of invalid data as corresponding valid data. A memory device communicates with the receiving node for storing the invalid data and the corresponding valid data. A computing node communicates with the memory device and receives and performs an analysis of the invalid data and the corresponding valid data received from the memory device.
    • 用于捕获数据分组以用于在网络计算系统上进行分析的装置和方法包括通过双向通信链路连接的发送节点和接收节点。 发送节点向双向通信链路上的接收节点发送数据传输,接收节点接收数据传输,验证数据传输,确定有效数据和无效数据,并验证无效数据的重传是对应的有效数据。 存储装置与接收节点进行通信,用于存储无效数据和对应的有效数据。 计算节点与存储器件进行通信,并且接收并执行从存储器件接收的无效数据和对应的有效数据的分析。
    • 80. 发明申请
    • MULTIPROCESSOR SWITCH WITH SELECTIVE PAIRING
    • 具有选择性配对的多处理器开关
    • US20120210172A1
    • 2012-08-16
    • US13027882
    • 2011-02-15
    • Alan GaraMichael Karl GschwindValentina Salapura
    • Alan GaraMichael Karl GschwindValentina Salapura
    • G06F11/07
    • G06F11/1641G06F11/1654G06F2201/845
    • System, method and computer program product for a multiprocessing system to offer selective pairing of processor cores for increased processing reliability. A selective pairing facility is provided that selectively connects, i.e., pairs, multiple microprocessor or processor cores to provide one highly reliable thread (or thread group). Each paired microprocessor or processor cores that provide one highly reliable thread for high-reliability connect with a system components such as a memory “nest” (or memory hierarchy), an optional system controller, and optional interrupt controller, optional I/O or peripheral devices, etc. The memory nest is attached to a selective pairing facility via a switch or a bus.
    • 用于多处理系统的系统,方法和计算机程序产品,以提供处理器核心的选择性配对,以提高处理可靠性。 提供选择性配对设施,其选择性地连接,即配对多个微处理器或处理器核,以提供一个高度可靠的线程(或线程组)。 每个成对的微处理器或处理器核心提供一个高度可靠的线程,用于高可靠性与诸如存储器“嵌套”(或存储器层级),可选系统控制器和可选中断控制器的系统组件连接,可选的I / O或外设 设备等。存储器套件通过开关或总线连接到选择性配对设施。