会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Storage array allowing for multiple, simultaneous write accesses
    • 存储阵列允许多个并发写入访问
    • US6032233A
    • 2000-02-29
    • US886304
    • 1997-07-01
    • Peter LofflerErwin PfefferThomas PflugerHans-Werner Tast
    • Peter LofflerErwin PfefferThomas PflugerHans-Werner Tast
    • G11C8/16G06F12/02
    • G11C8/16
    • A set of storage devices together with a method for storing data to the storage devices and retrieving data from the storage devices is presented. The set of storage devices provide the function of a multi-writeport cell through the use of a set of single-writeport cells. The storage devices allow for multiple write accesses. Information contained in the set of storage device is represented by all of the devices together. The stored information may be retrieved via a read operation which accesses a subset of the set of storage devices. A write operation is a staged operation: First, the contents of all of the storage devices which are not to be modified are read. Next, the values that are to be written to a subset B of the set of storage devices are calculated in a way that the contents and the values of subset B together represent the desired result.
    • 提供一组存储设备以及用于将数据存储到存储设备并从存储设备检索数据的方法。 该组存储设备通过使用一组单写入单元提供多写入单元的功能。 存储设备允许多次写访问。 包含在该组存储设备中的信息由所有设备一起表示。 存储的信息可以通过访问该组存储设备的子集的读取操作来检索。 写入操作是分阶段操作:首先,读取所有不被修改的存储设备的内容。 接下来,以将子集B的内容和值一起表示期望结果的方式计算要写入该组存储装置的子集B的值。
    • 2. 发明授权
    • Token-based serialisation of instructions in a multiprocessor system
    • 多处理器系统中基于令牌的指令序列化
    • US5761734A
    • 1998-06-02
    • US689762
    • 1996-08-13
    • Erwin PfefferKlaus-Joerg GetzlaffUte GaertnerHans-Werner Tast
    • Erwin PfefferKlaus-Joerg GetzlaffUte GaertnerHans-Werner Tast
    • G06F9/46G06F12/10G06F12/16
    • G06F9/52G06F12/1072
    • A process is disclosed to serialize instructions that are to be processed serially in a multiprocessor system, with the use of a token, where the token can be assigned on request to one of the processors, which thereupon has the right to execute the command. If the command consists of dristibuted tasks, the token remains blocked until the last dependent task belonging to the command has also been executed. It is only then that the token can be assigned to another instruction. Moreover, a device is described to manage this token, which features three states: a first state, in which the token is available, a second state, in which the token is assigned to one of the processors, and a third state, in which the token is blocked, because dependent tasks still have to be carried out. Moreover, a circuit is disclosed with which the token principle that is introduced can be implemented in a simple manner. The token is only available if none of the processors i is in possession of the token and if no dependent task is pending at any of the processors. The OR chaining of signals to form a signal C which is set if the token is not available represents the basic circuitry with which the serialisation of commands consisting of distributed tasks is carried out. The invention is applied particularly in the case of commands such as IPTE (invalidate page-table entry) and SSKE (set storage key extended), which modify the address translation tables in the memory that are used in common by all processors.
    • 公开了一种过程,其使用令牌来序列化要在多处理器系统中串行处理的指令,其中令牌可以根据请求分配给一个处理器,其中有一个执行命令。 如果命令由dristibuted任务组成,令牌将保持阻塞,直到属于命令的最后一个任务也已被执行。 只有令牌可以分配给另一个指令。 此外,描述了一种用于管理该令牌的设备,其特征在于三个状态:其中令牌可用的第一状态,其中将令牌分配给处理器之一的第二状态和第三状态,其中 令牌被阻止,因为依赖的任务仍然需要执行。 此外,公开了可以以简单的方式实现引入的令牌原理的电路。 该令牌仅在没有任何一个处理器拥有该令牌并且任何一个处理器中未依赖任务的情况下可用。 如果令牌不可用,则形成信号C的OR链接形成表示执行由分散任务组成的命令的串行化的基本电路。 本发明特别适用于诸如IPTE(无效页表条目)和SSKE(设置存储密钥扩展)的命令的情况,其修改由所有处理器共同使用的存储器中的地址转换表。
    • 10. 发明授权
    • Translation lookaside buffer for virtual memory systems
    • 用于虚拟内存系统的翻译后备缓冲区
    • US06418522B1
    • 2002-07-09
    • US09501741
    • 2000-02-11
    • Ute GaertnerJohn MacDougallErwin PfefferKerstin Schelm
    • Ute GaertnerJohn MacDougallErwin PfefferKerstin Schelm
    • G06F1210
    • G06F12/1027G06F2212/681
    • The basic idea comprised of the present invention is to provide a translation lookaside buffer (TLB) arrangement which advantageously uses two buffers, a small first level TLB1 and a larger second level TLB2. The second level TLB feeds address information to the first level TLB when the desired virtual address is not contained in the first level TLB. According to the invention the second level TLB is structured advantageously comprising two n-way set-associative sub-units of which one, a higher level unit covers some higher level address translation levels and the other one, a lower level unit, covers some lower level translation level. According to the present invention, some address information holds some number of middle level virtual address (MLVA) bits, i.e., 8 bits, for example, being able to serve as an index address covering the address range of the higher level sub-unit. Thus, the same information is used as a tag information in the lower-level sub-unit and is used herein as a quick reference in any look-up operation in order to find the absolute address of the concerned virtual address. Further, the commonly used status bits, like; e.g., valid bits, are used in both TLB structures, too.
    • 由本发明构成的基本思想是提供一种有利地使用两个缓冲器,小的第一级TLB1和较大的第二级TLB2的翻译后备缓冲器(TLB)装置。 当所需的虚拟地址不包含在第一级TLB中时,第二级TLB将地址信息馈送到第一级TLB。 根据本发明,第二级TLB有利地包括两个n路组合关联子单元,其中一个较高级别单元覆盖一些较高级地址转换级别,而另一级单元覆盖一些较低级别的地址转换级别 级别翻译水平。 根据本发明,一些地址信息例如保持一些中间虚拟地址(MLVA)位,即8位,能够用作覆盖上位子单元的地址范围的索引地址。 因此,相同的信息用作下级子单元中的标签信息,并且在本文中用作任何查找操作中的快速参考,以便找到相关虚拟地址的绝对地址。 此外,常用的状态位,如; 例如有效位也用在两个TLB结构中。