会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Apparatus and method for serialized set prediction
    • 串联集预测的装置和方法
    • US5966737A
    • 1999-10-12
    • US971630
    • 1997-11-17
    • Simon C. Steely, Jr.Joseph Dominic Macri
    • Simon C. Steely, Jr.Joseph Dominic Macri
    • G06F12/08G06F9/38
    • G06F12/0864G06F2212/6082
    • A prediction mechanism for improving direct-mapped cache performance is shown to include a direct-mapped cache, partitioned into a plurality of pseudo-banks. Prediction means are employed to provide a prediction index which is appended to the cache index to provide the entire address for addressing the direct mapped cache. One embodiment of the prediction means includes a prediction cache which is advantageously larger than the pseudo-banks of the direct-mapped cache and is used to store the prediction index for each cache location. A second embodiment includes a plurality of partial tag stores, each including a predetermined number of tag bits for the data in each bank. A comparison of the tags generates a match in one of the plurality of tag stores, and is used in turn to generate a prediction index. A third embodiment for use with a direct mapped cache divided into two partitions includes a distinguishing bit ram, which is used to provide the bit number of any bit which differs between the tags at the same location in the different banks. The bit number is used in conjunction with a complement signal to provide the prediction index for addressing the direct-mapped cache.
    • 示出了用于改善直接映射高速缓存性能的预测机制,其包括被划分成多个伪库的直接映射高速缓存。 预测装置被用于提供附加到高速缓存索引的预测索引,以提供用于寻址直接映射高速缓存的整个地址。 预测装置的一个实施例包括有利地大于直接映射高速缓存的伪库的预测高速缓存,并且用于存储每个高速缓存位置的预测索引。 第二实施例包括多个部分标签存储,每个部分标签存储器包括用于每个存储体中的数据的预定数量的标签位。 标签的比较在多个标签存储之一中产生匹配,并且依次用于生成预测索引。 用于分割成两个分区的直接映射高速缓存的第三实施例包括区分位RAM,其用于提供不同存储体中相同位置处的标签之间不同的任何位的位数。 位数与补码信号结合使用,以提供用于寻址直接映射高速缓存的预测索引。
    • 6. 发明授权
    • Cache spill management techniques using cache spill prediction
    • 缓存溢出管理技术使用缓存溢出预测
    • US08407421B2
    • 2013-03-26
    • US12639214
    • 2009-12-16
    • Simon C. Steely, Jr.William C. HasenplaughAamer JaleelGeorge Z. Chrysos
    • Simon C. Steely, Jr.William C. HasenplaughAamer JaleelGeorge Z. Chrysos
    • G06F12/00
    • G06F12/0806G06F12/12
    • An apparatus and method is described herein for intelligently spilling cache lines. Usefulness of cache lines previously spilled from a source cache is learned, such that later evictions of useful cache lines from a source cache are intelligently selected for spill. Furthermore, another learning mechanism—cache spill prediction—may be implemented separately or in conjunction with usefulness prediction. The cache spill prediction is capable of learning the effectiveness of remote caches at holding spilled cache lines for the source cache. As a result, cache lines are capable of being intelligently selected for spill and intelligently distributed among remote caches based on the effectiveness of each remote cache in holding spilled cache lines for the source cache.
    • 这里描述了用于智能地溢出高速缓存行的装置和方法。 了解先前从源缓存溢出的高速缓存行的有用性,从而智能地选择来自源缓存的随后驱逐的溢出。 此外,另一种学习机制 - 缓存溢出预测 - 可以单独实施或结合有用性预测来实现。 高速缓存溢出预测能够学习在为源缓存保留溢出的高速缓存行时远程高速缓存的有效性。 因此,基于每个远程高速缓存在保存用于源高速缓存的溢出高速缓存行的有效性的情况下,高速缓存行能够被智能地选择为溢出并且智能地分布在远程高速缓存中。
    • 9. 发明授权
    • High performance recoverable communication method and apparatus for
write-only networks
    • 用于只写网络的高性能可恢复通信方法和装置
    • US6049889A
    • 2000-04-11
    • US6115
    • 1998-01-13
    • Simon C. Steely, Jr.Glenn P. GarveyRichard B. Gillett, Jr.
    • Simon C. Steely, Jr.Glenn P. GarveyRichard B. Gillett, Jr.
    • H04L29/06H04L29/14G06F3/00
    • H04L29/06H04L69/40
    • A multi-node computer network includes a plurality of nodes coupled together via a data link. Each of the nodes includes a local memory, which further comprises a shared memory. Certain items of data that are to be shared by the nodes are stored in the shared portion of memory. Associated with each of the shared data items is a data structure. When a node sharing data with other nodes in the system seeks to modify the data, it transmits the modifications over the data link to the other nodes in the network. Each update is received in order by each node in the cluster. As part of the last transmission by the modifying node, an acknowledgement request is sent to the receiving nodes in the cluster. Each node that receives the acknowledgment request returns an acknowledgement to the sending node. The returned acknowledgement is written to the data structure associated with the shared data item. If there is an error during the transmission of the message, the receiving node does not transmit an acknowledgement, and the sending node is thereby notified that an error has occurred.
    • 多节点计算机网络包括通过数据链路耦合在一起的多个节点。 每个节点包括本地存储器,其还包括共享存储器。 要由节点共享的某些数据项存储在存储器的共享部分中。 与每个共享数据项相关联的是数据结构。 当与系统中的其他节点共享数据的节点寻求修改数据时,它将数据链路上的修改发送到网络中的其他节点。 群集中的每个节点按顺序接收每个更新。 作为修改节点的最后一次传输的一部分,向群集中的接收节点发送确认请求。 接收确认请求的每个节点向发送节点返回确认。 返回的确认被写入与共享数据项相关联的数据结构。 如果在消息的发送期间存在错误,则接收节点不发送确认,并且由此通知发送节点发生了错误。
    • 10. 发明授权
    • Multi-index multi-way set-associative cache
    • 多索引多路组合关联缓存
    • US5509135A
    • 1996-04-16
    • US951623
    • 1992-09-25
    • Simon C. Steely, Jr.
    • Simon C. Steely, Jr.
    • G06F12/08G06F13/00
    • G06F12/0864
    • A plurality of indexes are provided for a multi-way set-associate cache of a computer system. The cache is organized as a plurality of blocks for storing data which are a copies of main memory data. Each block has an associated tag for uniquely identifying the block. The blocks and the tags are addressed by indexes. The indexes are generated by a Boolean hashing function which converts a memory address to cache indexes by combining the bits of the memory address using an exclusive OR function. Different combination of bits are used to generate a plurality of different indexes to address the tags and the associated blocks to transfer data between the cache and the central processing unit of the computer system.
    • 为计算机系统的多路集合相关缓存提供多个索引。 高速缓存被组织为用于存储作为主存储器数据的副本的数据的多个块。 每个块都具有用于唯一标识块的关联标签。 块和标签由索引寻址。 索引由布尔散列函数生成,该函数通过使用异或函数组合存储器地址的位来将存储器地址转换为缓存索引。 使用不同的比特组合来生成多个不同的索引以寻址标签和相关联的块以在计算机系统的高速缓存和中央处理单元之间传送数据。