会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Efficient storage of memory version data
    • 高效存储内存版本数据
    • US08756363B2
    • 2014-06-17
    • US13178240
    • 2011-07-07
    • Zoran RadovicGraham Ricketson MurphyBharat K. Daga
    • Zoran RadovicGraham Ricketson MurphyBharat K. Daga
    • G06F12/00
    • G06F21/52G06F11/073G06F11/0763G06F11/1666
    • Systems and methods for efficient memory corruption detection in a processor. A processor detects a first data structure is to be allocated in a physical memory. The physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Either the processor or an operating system (OS) determines a first version number corresponding to the first data structure. During initialization of the first data structure, the first version number may be stored in a first location in the spare bank. The processor receives from the OS a pointer holding the first version number. When the processor executes memory access operations targeting the first data structure, the processor compares the first version number with a third version number stored in a location in the physical memory indicated by the memory access address. The processor may set a trap in response to determining a mismatch.
    • 处理器中有效的内存损坏检测的系统和方法。 处理器检测将在物理存储器中分配第一数据结构。 物理存储器可以是具有为硬件故障切换机制保留的备用存储体的DRAM。 处理器或操作系统(OS)都确定与第一数据结构对应的第一版本号。 在第一数据结构的初始化期间,第一版本号可以存储在备用存储体中的第一位置。 处理器从OS接收保持第一版本号的指针。 当处理器执行针对第一数据结构的存储器访问操作时,处理器将第一版本号与存储在由存储器访问地址指示的物理存储器中的位置中的第三版本号进行比较。 响应于确定不匹配,处理器可以设置陷阱。
    • 2. 发明申请
    • EFFICIENT STORAGE OF MEMORY VERSION DATA
    • 高效存储内存版本数据
    • US20130013843A1
    • 2013-01-10
    • US13178240
    • 2011-07-07
    • Zoran RadovicGraham Ricketson MurphyBharat K. Daga
    • Zoran RadovicGraham Ricketson MurphyBharat K. Daga
    • G06F12/06
    • G06F21/52G06F11/073G06F11/0763G06F11/1666
    • Systems and methods for efficient memory corruption detection in a processor. A processor detects a first data structure is to be allocated in a physical memory. The physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Either the processor or an operating system (OS) determines a first version number corresponding to the first data structure. During initialization of the first data structure, the first version number may be stored in a first location in the spare bank. The processor receives from the OS a pointer holding the first version number. When the processor executes memory access operations targeting the first data structure, the processor compares the first version number with a third version number stored in a location in the physical memory indicated by the memory access address. The processor may set a trap in response to determining a mismatch.
    • 处理器中有效的内存损坏检测的系统和方法。 处理器检测将在物理存储器中分配第一数据结构。 物理存储器可以是具有为硬件故障切换机制保留的备用存储体的DRAM。 处理器或操作系统(OS)都确定与第一数据结构对应的第一版本号。 在第一数据结构的初始化期间,第一版本号可以存储在备用存储体中的第一位置。 处理器从OS接收保持第一版本号的指针。 当处理器执行针对第一数据结构的存储器访问操作时,处理器将第一版本号与存储在由存储器访问地址指示的物理存储器中的位置中的第三版本号进行比较。 响应于确定不匹配,处理器可以设置陷阱。
    • 4. 发明授权
    • Instructions to set and read memory version information
    • 设置和读取内存版本信息的说明
    • US08751736B2
    • 2014-06-10
    • US13196514
    • 2011-08-02
    • Zoran RadovicDarryl J. GoveGraham Ricketson Murphy
    • Zoran RadovicDarryl J. GoveGraham Ricketson Murphy
    • G06F12/02
    • G06F11/0763G06F9/3824G06F9/3834G06F9/3851G06F11/073
    • Systems and methods for providing additional instructions for supporting efficient memory corruption detection in a processor. A physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Version numbers associated with data structures allocated in the memory may be generated so that version numbers of adjacent data structures are different. A processor determines that a fetched instruction is a memory access instruction corresponding to a first data structure within the memory. For instructions that are not a version update instruction, the processor compares the first version number and second version number stored in a location in the memory indicated by the generated address and flags an error if there is a mismatch. For version update instructions, the processor performs a memory access operation on the second version number with no comparison check.
    • 用于提供用于在处理器中支持有效的内存损坏检测的附加指令的系统和方法。 物理存储器可以是DRAM,其具有为硬件故障转移机制保留的备用存储体。 可以生成与分配在存储器中的数据结构相关联的版本号,使得相邻数据结构的版本号不同。 处理器确定所提取的指令是与存储器内的第一数据结构相对应的存储器访问指令。 对于不是版本更新指令的指令,处理器比较存储在由生成的地址指示的存储器中的位置中的第一版本号和第二版本号,并且如果存在不匹配则标记错误。 对于版本更新指令,处理器对第二版本号执行存储器访问操作,而不进行比较检查。
    • 5. 发明申请
    • INSTRUCTIONS TO SET AND READ MEMORY VERSION INFORMATION
    • 设置和读取存储器版本信息的说明
    • US20130036276A1
    • 2013-02-07
    • US13196514
    • 2011-08-02
    • Zoran RadovicDarryl J. GoveGraham Ricketson Murphy
    • Zoran RadovicDarryl J. GoveGraham Ricketson Murphy
    • G06F12/00G06F9/30
    • G06F11/0763G06F9/3824G06F9/3834G06F9/3851G06F11/073
    • Systems and methods for providing additional instructions for supporting efficient memory corruption detection in a processor. A physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Version numbers associated with data structures allocated in the memory may be generated so that version numbers of adjacent data structures are different. A processor determines that a fetched instruction is a memory access instruction corresponding to a first data structure within the memory. For instructions that are not a version update instruction, the processor compares the first version number and second version number stored in a location in the memory indicated by the generated address and flags an error if there is a mismatch. For version update instructions, the processor performs a memory access operation on the second version number with no comparison check.
    • 用于提供用于在处理器中支持有效的内存损坏检测的附加指令的系统和方法。 物理存储器可以是DRAM,其具有为硬件故障转移机制保留的备用存储体。 可以生成与分配在存储器中的数据结构相关联的版本号,使得相邻数据结构的版本号不同。 处理器确定所提取的指令是与存储器内的第一数据结构相对应的存储器访问指令。 对于不是版本更新指令的指令,处理器比较存储在由生成的地址指示的存储器中的位置中的第一版本号和第二版本号,并且如果存在不匹配则标记错误。 对于版本更新指令,处理器对第二版本号执行存储器访问操作,而不进行比较检查。
    • 8. 发明授权
    • System and method for reducing shared memory write overhead in multiprocessor systems
    • 在多处理器系统中减少共享内存写开销的系统和方法
    • US07080213B2
    • 2006-07-18
    • US10320758
    • 2002-12-16
    • Oskar GrenholmZoran RadovicErik E. Hagersten
    • Oskar GrenholmZoran RadovicErik E. Hagersten
    • G06F12/00
    • G06F12/0815
    • A system and method for reducing shared memory write overhead in multiprocessor system. In one embodiment, a multiprocessing system implements a method comprising storing an indication of obtained store permission corresponding to a particular address in a store buffer. The indication may be, for example, the address of a cache line for which a write permission has been obtained. Obtaining the write permission may include locking and modifying an MTAG or other coherence state entry. The method further comprises determining whether the indication of obtained store permission corresponds to an address of a write operation to be performed. In response to the indication corresponding to the address of the write operation to be performed, the write operation is performed without invoking corresponding global coherence operations.
    • 一种用于在多处理器系统中减少共享内存写开销的系统和方法。 在一个实施例中,多处理系统实现一种方法,包括将对应于特定地址的获得的存储许可的指示存储在存储缓冲器中。 该指示可以是例如已获得写入许可的高速缓存线的地址。 获取写入许可可以包括锁定和修改MTAG或其他相干状态条目。 该方法还包括确定获得的存储许可的指示是否对应于要执行的写入操作的地址。 响应于与要执行的写入操作的地址对应的指示,执行写入操作而不调用相应的全局相干操作。
    • 9. 发明申请
    • SOFTWARE-ACCESSIBLE HARDWARE SUPPORT FOR DETERMINING SET MEMBERSHIP
    • 软件可访问的硬件支持,用于确定设置成员
    • US20110202725A1
    • 2011-08-18
    • US12708376
    • 2010-02-18
    • John R. RoseLawrence A. SpracklenZoran Radovic
    • John R. RoseLawrence A. SpracklenZoran Radovic
    • G06F12/02G06F12/08
    • G06F9/30021G06F9/30018
    • A method and processor supporting architected instructions for tracking and determining set membership, such as by implementing Bloom filters. The apparatus includes storage arrays (e.g., registers) and an execution core configured to store an indication that a given value is a member of a set, including by executing an architected instruction having an operand specifying the given value, wherein executing comprises hashing applying a hash function to the value to determine an index into one of the storage arrays and setting a bit of the storage array corresponding to the index. An architected query instruction is later executed to determine if a query value is not a member of the set, including by applying the hash function to the query value to determine an index into the storage array and determining whether a bit at the index of the storage array is set.
    • 支持用于跟踪和确定集合成员资格的架构化指令的方法和处理器,例如通过实现Bloom过滤器。 该装置包括存储阵列(例如,寄存器)和被配置为存储给定值是组的成员的指示的执行核心,包括通过执行具有指定给定值的操作数的架构化指令,其中执行包括哈希应用 将hash函数的值确定为一个索引到一个存储阵列中,并设置一个与索引相对应的存储阵列。 稍后执行架构化查询指令以确定查询值是否不是该集合的成员,包括通过将哈希函数应用于查询值来确定存储阵列中的索引并确定存储器的索引处的位 数组被设置。
    • 10. 发明授权
    • Multiprocessing systems employing hierarchical back-off locks
    • 采用分级退回锁的多处理系统
    • US06985984B2
    • 2006-01-10
    • US10289822
    • 2002-11-07
    • Zoran RadovicErik Hagersten
    • Zoran RadovicErik Hagersten
    • G06F12/14
    • G06F9/52
    • A multiprocessing system including multiple processing nodes employs various implementations of hierarchical back-off locks. A thread attempting to obtain a software lock may determine whether the lock is currently owned by a different node than the node in which the thread is executing. If the lock is not owned by a different node, the thread executes code to perform a fast spin operation. On the other hand, if the lock is owned by a different node, the thread executes code to perform a slow spin operation. In this manner, node locality may result wherein a thread that is executing within the same node in which a lock has already been obtained will be more likely to subsequently acquire the lock when it is freed in relation to other contending threads executing in other nodes.
    • 包括多个处理节点的多处理系统采用分级退回锁的各种实现。 尝试获取软件锁的线程可以确定该锁当前是否与线程正在执行的节点不同的节点拥有。 如果锁不是由不同节点拥有的,则线程执行代码以执行快速自旋操作。 另一方面,如果锁由不同的节点拥有,则线程执行代码以执行缓慢的旋转操作。 以这种方式,可能导致节点位置,其中在已经获得锁的同一节点内正在执行的线程相对于在其他节点中执行的其他竞争线程释放时,更可能随后获取锁定。