会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Prefetch miss indicator for cache coherence directory misses on external caches
    • 高速缓存一致性目录丢失的外部缓存的预取缺失指示符
    • US20060101209A1
    • 2006-05-11
    • US10983350
    • 2004-11-08
    • Eric LaisDonald DeSotaRob Joersz
    • Eric LaisDonald DeSotaRob Joersz
    • G06F13/28
    • G06F12/082G06F2212/507
    • A system, method and article of manufacture for reducing latencies associated with cache coherence directory misses on external caches in a shared distributed memory data processing system. A cache coherence directory is evaluated for possible prefetching of a directory entry into a directory cache. A prefetch miss indicator is set if the prefetch evaluated results in a directory miss. The prefetch miss indicator is consulted during subsequent processing of a memory block request corresponding to the directory entry. An accelerated snoop response action is taken if the prefetch miss indicator is set. The latency of a second lookup into the cache coherence directory, which would otherwise be required, is thereby avoided.
    • 用于减少与共享分布式存储器数据处理系统中的外部高速缓存上的高速缓存一致性目录丢失相关的延迟的系统,方法和制品。 评估缓存一致性目录可能将目录条目预取到目录缓存中。 如果预取的预取导致目录错过,则设置预取缺失指示符。 在随后处理与目录条目相对应的存储器块请求时,查阅预取缺失指示符。 如果预取缺失指示符被设置,则采取加速侦听响应动作。 从而避免了否则将要求的缓存一致性目录中的第二次查找的等待时间。
    • 4. 发明申请
    • Method controller having tables mapping memory addresses to memory modules
    • 方法控制器具有将存储器地址映射到存储器模块的表
    • US20060129739A1
    • 2006-06-15
    • US11010205
    • 2004-12-11
    • Eric LaisDonald DeSotaMichael GrassiBruce Gilbert
    • Eric LaisDonald DeSotaMichael GrassiBruce Gilbert
    • G06F12/06
    • G06F12/0653G06F13/1668
    • A memory controller includes ports and corresponding tables. Each port is receptive to one or more memory modules. Each table includes entries mapping memory addresses to the memory modules. Each entry corresponds to no more than one of the memory modules. The tables support asymmetric population of the memory modules within the ports; each port is capable of having a different number of memory modules relative to the other ports. The tables impose no restrictions on where the memory modules are to be inserted within the ports, both number-wise and position-wise. The tables are independently configurable; the configuration of each table is modifiable independently of the configurations of the other tables. Each table is dynamically configurable. The entries of a table are modifiable to reflect changes in the number and type of the memory modules connected, without restarting or temporarily halting the computer system containing the memory controller.
    • 存储器控制器包括端口和对应的表。 每个端口都接受一个或多个内存模块。 每个表包括将内存地址映射到内存模块的条目。 每个条目对应于不超过一个内存模块。 这些表支持端口内存模块的非对称数量; 每个端口能够相对于其他端口具有不同数量的存储器模块。 这些表对数字和位置方面的内存模块在端口中插入的位置没有任何限制。 表可独立配置; 每个表的配置可以独立于其他表的配置进行修改。 每个表都是可动态配置的。 表的条目是可修改的,以反映连接的内存模块的数量和类型的变化,而不会重新启动或暂时中止包含内存控制器的计算机系统。
    • 6. 发明申请
    • Local region table for storage of information regarding memory access by other nodes
    • 用于存储有关其他节点存储器访问的信息的本地区域表
    • US20050120183A1
    • 2005-06-02
    • US10725853
    • 2003-12-01
    • Donald DeSotaWilliam DurrRobert JoerszDavis Miller
    • Donald DeSotaWilliam DurrRobert JoerszDavis Miller
    • G06F12/08G06F12/00
    • G06F12/0817G06F12/082
    • The local storage of information regarding memory access by other nodes within a coherency controller of a node is disclosed. The coherency controller receives a transaction relating a line of local memory of the node. In response to locally determining that the line of the local memory is not being cached by another node and/or has not been modified by another node, the coherency controller processes the transaction without accessing tag directory information regarding the line. A table within the controller may store entries corresponding to local memory sections. Each entry includes a count value tracking a number of lines of the section being cached by other nodes, and a count value tracking a number of lines of the section that have been modified by other nodes. The table may also include flags corresponding to the sections, each flag indicating the validity of the section's contents.
    • 公开了关于节点的一致性控制器内的其他节点的存储器访问的信息的本地存储。 一致性控制器接收与该节点的一行本地存储器相关的事务。 响应于本地确定本地存储器的行不被另一个节点缓存和/或尚未被另一个节点修改,一致性控制器处理该事务而不访问关于该行的标签目录信息。 控制器内的表可以存储对应于本地存储器部分的条目。 每个条目包括跟踪由其他节点缓存的段的数量的计数值,以及跟踪由其他节点修改的段的数量的计数值。 该表还可以包括对应于这些部分的标志,每个标志指示该部分的内容的有效性。
    • 7. 发明申请
    • Implementation-efficient multiple-counter value hardware performance counter
    • 实现高效的多计数器硬件性能计数器
    • US20070286327A1
    • 2007-12-13
    • US11738497
    • 2007-04-22
    • Carl LoveDonald DeSotaJaeheon JeongRussell Clapp
    • Carl LoveDonald DeSotaJaeheon JeongRussell Clapp
    • H03K21/38
    • G06F11/3466G06F2201/88
    • An implementation-efficient, multiple-counter value hardware performance counter is disclosed. A hardware counter of one embodiment includes a memory array and a hardware incrementer. The array stores counter values that are indexable by an index constructed based at least on the number of events to which the counter values correspond. The index may be constructed as a concatenation of a number of bits binarily representing the number of events, and a number of bits binarily representing the number of qualifiers to the events. The incrementer reads the counter values from the array, increments the counter values, and writes the resulting counter values back into the array. The array may be divided into banks over which the counter values are stored, where each bank has a separate instance of the incrementer. Each bank may have a separate instance of the index that indexes only those counters stored in the bank.
    • 公开了一种实现高效的多计数器硬件性能计数器。 一个实施例的硬件计数器包括存储器阵列和硬件递增器。 阵列存储可由至少基于计数器值对应的事件数构成的索引可索引的计数器值。 索引可以被构造为二进制数表示事件数量的位数的连接,以及二进制表示事件的限定符的数目的位数。 增量器从数组中读取计数器值,增加计数器值,并将生成的计数器值写入数组。 阵列可以被划分为存储有计数器值的存储体,其中每个存储体具有加法器的单独实例。 每个银行可能有一个单独的索引实例,仅索引存储在银行中的那些计数器。
    • 10. 发明申请
    • Queuing of conflicted remotely received transactions
    • 排队冲突的远程接收交易
    • US20050149603A1
    • 2005-07-07
    • US10739699
    • 2003-12-18
    • Donald DeSotaRobert JoerszDavis MillerMaged Michael
    • Donald DeSotaRobert JoerszDavis MillerMaged Michael
    • G06F15/16
    • G06F15/173
    • A method of queuing of received transactions that have a resource conflict is disclosed. A first node receives a first transaction from a second node, where the first transaction relates to a resource of the first node. The transaction may be a request relating to a memory line of the first node, for instance. It is determined that a second transaction that relates to this resource of the first node is already being processed by the first node. Therefore, the first transaction is enqueued in a conflict queue within the first node. The queuing may be a linked list, a priority queue, or another type of queue. Once the second transaction has been processed, the first transaction is restarted for processing by the first node. The first transaction is then processed by the first node.
    • 公开了对资源冲突的接收到的事务进行排队的方法。 第一节点从第二节点接收第一事务,其中第一事务涉及第一节点的资源。 例如,事务可以是与第一节点的存储器线有关的请求。 确定与第一节点的该资源相关的第二事务已被第一节点处理。 因此,第一个事务在第一个节点内的冲突队列中排队。 排队可以是链接列表,优先级队列或其他类型的队列。 一旦处理了第二个事务,第一个事务就被重新启动,由第一个节点处理。 第一个事务由第一个节点处理。