会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明授权
    • Using vector atomic memory operation to handle data of different lengths
    • 使用向量原子内存操作来处理不同长度的数据
    • US08826252B2
    • 2014-09-02
    • US12483908
    • 2009-06-12
    • Terry D. Greyzck
    • Terry D. Greyzck
    • G06F9/45G06F15/00G06F9/30G06F12/00G06F9/38
    • G06F9/30029G06F8/445G06F9/3004G06F9/30087G06F9/3834
    • A system and method of compiling program code, wherein the program code includes an operation on an array of data elements stored in memory of a computer system. The program code is scanned for an equation which operates on data of lengths other than the limited number of vector supported data lengths. The equation is then replaced with vectorized machine executable code, wherein the machine executable code comprises a nested loop and wherein the nested loop comprises an exterior loop and a virtual interior loop. The exterior loop decomposes the equation into a plurality of loops of length N, wherein N is an integer greater than one. The virtual interior loop executes vector operations corresponding to the N length loop to form a result vector of length N, wherein the virtual interior loop includes one or more vector atomic memory operation (AMO) instructions, used to resolve false conflicts.
    • 一种编译程序代码的系统和方法,其中所述程序代码包括对存储在计算机系统的存储器中的数据元素阵列的操作。 对程序代码进行扫描,以对除了有限数量的向量支持的数据长度以外的长度的数据进行操作。 该方程然后用矢量化机器可执行代码替换,其中机器可执行代码包括嵌套循环,并且其中嵌套循环包括外部循环和虚拟内部循环。 外部环路将方程分解成长度为N的多个环,其中N是大于1的整数。 虚拟内环执行对应于N长度循环的向量操作以形成长度为N的结果向量,其中虚拟内部循环包括用于解决错误冲突的一个或多个向量原子存储器操作(AMO)指令。
    • 52. 发明申请
    • DYNAMIC GRAPH SYSTEM FOR A SEMANTIC DATABASE
    • 用于语义数据库的动态图形系统
    • US20140244657A1
    • 2014-08-28
    • US13777884
    • 2013-02-26
    • CRAY INC.
    • David Mizell
    • G06F17/30
    • G06T11/206G06F17/30321G06F17/30958
    • A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
    • 公开了一种用于通过矩阵接口动态地提供条目的数据存储的图形表示的计算机系统中的方法和系统。 动态图系统提供了一个矩阵接口,向应用程序公开存储在数据存储器中的数据的图形表示,例如存储三元组的语义数据库。 对于应用程序,矩阵接口将图形表示为以压缩形式存储的稀疏邻接矩阵。 数据存储的每个条目被认为表示图形的节点之间的链接。 每个条目具有标识通过链路连接的节点的第一字段和第二字段,以及连接所识别的节点的链接的值的第三字段。 第一,第二和第三字段表示邻接矩阵的行,列和元素。
    • 53. 发明申请
    • DYNAMIC UPDATES TO A SEMANTIC DATABASE USING FINE-GRAIN LOCKING
    • 动态更新到使用细粒度锁定的语义数据库
    • US20140081934A1
    • 2014-03-20
    • US13623688
    • 2012-09-20
    • CRAY INC.
    • David Mizell
    • G06F17/30
    • G06F17/30348G06F17/30321G06F17/3033G06F17/30917
    • A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.
    • 提供了一种用于将索引更新为元组的元组表的系统。 索引系统使用索引的细粒度锁定将索引更新为元组表。 索引包括一个值表,其中包含索引字段的每个索引值的条目,该索引字段引用一个值元组表,该值包含具有索引值的每个元组,该行用于标识具有该索引值的元组表的元组。 在使用值添加到元组表的新元组之后,通过将值表中的条目锁定,更新该值的值 - 元组表,然后解锁该条目来更新该索引。 当访问用于定位具有值的元组的索引时,访问器将该值锁定在值表中的值,使用value-tuple表来定位元组,并解锁该条目。
    • 54. 发明授权
    • Method and apparatus for switched electrostatic discharge protection
    • 开关静电放电保护方法及装置
    • US08654489B2
    • 2014-02-18
    • US13175387
    • 2011-07-01
    • Raymond J. FarbarikJeremy StephensGerald J. Twomey
    • Raymond J. FarbarikJeremy StephensGerald J. Twomey
    • H02H3/20H02H9/04
    • H02H9/046
    • One embodiment includes an integrated circuit including an input circuit, a first diode including a first anode and a first cathode, with the first cathode coupled to a first voltage, the first anode coupled to the input circuit at a node via a first mechanical switch, a second diode including a second anode and a second cathode, with the second cathode coupled to the node via a second mechanical switch, the second anode coupled to a ground and a resistor coupled to the input circuit between the integrated circuit and the node, wherein in a first mode of operating, the first mechanical switch and the second mechanical switch are conducting, and in a second mode of operating, the first and second mechanical switches are nonconducting.
    • 一个实施例包括集成电路,其包括输入电路,包括第一阳极和第一阴极的第一二极管,其中第一阴极耦合到第一电压,第一阳极经由第一机械开关耦合到节点处的输入电路, 第二二极管,包括第二阳极和第二阴极,其中第二阴极经由第二机械开关耦合到节点,第二阳极耦合到地和耦合到集成电路和节点之间的输入电路的电阻器,其中 在第一操作模式中,第一机械开关和第二机械开关导通,并且在第二操作模式中,第一和第二机械开关是不导通的。
    • 57. 发明授权
    • Method and apparatus for memory read-refresh, scrubbing and variable-rate refresh
    • 用于存储器读取刷新,擦除和可变速率刷新的方法和装置
    • US08347176B2
    • 2013-01-01
    • US13237676
    • 2011-09-20
    • David R. ResnickVan L. SnyderMichael F. Higgins
    • David R. ResnickVan L. SnyderMichael F. Higgins
    • H03M13/00
    • G06F11/106G11C11/401G11C29/44G11C29/4401G11C29/848G11C2029/0401
    • A memory controller and method that provide a read-refresh (also called “distributed-refresh”) mode of operation, in which every row of memory is read within the refresh-rate requirements of the memory parts, with data from different columns within the rows being read on subsequent read-refresh cycles until all rows for each and every column address have been read, scrubbing errors if found, thus providing a scrubbing function that is integrated into the read-refresh operation, rather than being an independent operation. For scrubbing, an atomic read-correct-write operation is scheduled. A variable-priority, variable-timing refresh interval is described. An integrated card self-tester and/or card reciprocal-tester is described. A memory bit-swapping-within-address-range circuit, and a method and apparatus for bit swapping on the fly and testing are described.
    • 提供读刷新(也称为分布式刷新)操作模式的存储器控​​制器和方法,其中在存储器部件的刷新速率要求内读取每一行存储器,其中来自行内不同列的数据为 在随后的读取刷新循环中读取,直到读取每个列地址的所有行,如果找到,则清除错误,从而提供集成到读取刷新操作中的擦除功能,而不是独立操作。 为了进行擦除,安排了原子读取 - 正确写入操作。 描述了可变优先级的可变定时刷新间隔。 描述了集成卡自测试器和/或卡互换测试器。 描述了地址范围内的存储器位交换电路,以及用于在飞行和测试中进行位交换的方法和装置。
    • 59. 发明授权
    • System and method for mapping between resource consumers and resource providers in a computing system
    • 在计算系统中资源使用者和资源提供者之间进行映射的系统和方法
    • US08296771B2
    • 2012-10-23
    • US10643740
    • 2003-08-18
    • Stephan Kurt Gipp
    • Stephan Kurt Gipp
    • G06F9/46G06F15/173
    • G06F9/5016
    • A system and method for allocating system resources is described herein. In one embodiment, the method comprises creating, in a computer system, a resource consumer and assigning the resource consumer one of a set of flavors. The method further includes determining whether the resource consumer is limited to receiving resources from a certain one of a set of resource providers, wherein each of the set of resource providers has one of the set of flavors. The method further includes marking a field to indicate that the resource consumer is limited to receiving resources from the certain one of the set of resource providers, if the resource consumer is limited to receiving resources from the certain one of the set of resource providers. The method further includes allocating a resource to the resource consumer from one of the set of resource providers whose flavor matches the flavor assigned to the resource consumer.
    • 这里描述了用于分配系统资源的系统和方法。 在一个实施例中,该方法包括在计算机系统中创建资源消费者并且分配资源消费者一组风格之一。 该方法还包括确定资源消费者是否被限于从一组资源提供者中的某一个接收资源,其中资源提供者集合中的每一个具有一组风格之一。 该方法还包括:如果资源消费者被限制为从资源提供者集合中的某一个接收资源,则标记字段以指示资源消费者被限制为从该资源提供者集合中的某一个接收资源。 该方法还包括从资源消耗者的风味与分配给资源消费者的风味相匹配的一组资源提供者中的一个资源消费者分配资源。