专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明申请

US20120254550A1 BYPASS AND INSERTION ALGORITHMS FOR EXCLUSIVE LAST-LEVEL CACHES 有权
标题翻译：旁路和插入算法用于独特的最后级别的高速缓存
公开(公告)号：US20120254550A1
公开(公告)日：2012-10-04
申请号：US13078415
申请日：2011-04-01
申请人： Jayesh Gaur , Mainak Chaudhuri , Sreenivas Subramoney
发明人： Jayesh Gaur , Mainak Chaudhuri , Sreenivas Subramoney
IPC分类号： G06F12/08
CPC分类号： G06F12/0888 , G06F12/0897 , G06F12/122 , G06F12/123 , G06F12/128
摘要： An apparatus and method are described for implementing an exclusive lower level cache (LLC) policy within a computer processor. For example, one embodiment of a computer processor comprises: a mid-level cache circuit (MLC) for storing a first set of cache lines containing instructions and/or data; a lower level cache circuit (LLC) for storing a second set of cache lines of instructions and/or data; and an insertion circuit for implementing a policy for inserting or replacing cache lines within the LLC based on values of use recency and use frequency associated with the lines.
摘要翻译：描述了用于在计算机处理器内实现专用低级缓存（LLC）策略的装置和方法。例如，计算机处理器的一个实施例包括：用于存储包含指令和/或数据的第一组高速缓存行的中级高速缓存电路（MLC）; 用于存储第二组指令和/或数据的高速缓存行的低级缓存电路（LLC）; 以及插入电路，用于基于与线路相关联的使用新近度和使用频率的值来实现用于在LLC内插入或替换高速缓存线的策略。

22. 发明授权

US06950837B2 Method for using non-temporal streaming to improve garbage collection algorithm 失效
标题翻译：使用非时间流提高垃圾收集算法的方法
公开(公告)号：US06950837B2
公开(公告)日：2005-09-27
申请号：US09885745
申请日：2001-06-19
申请人： Sreenivas Subramoney , Richard L. Hudson
发明人： Sreenivas Subramoney , Richard L. Hudson
IPC分类号： G06F12/02 , G06F12/08 , G06F17/00
CPC分类号： G06F12/0888 , G06F12/0253 , Y10S707/99957
摘要： An improved moving garbage collection algorithm is described. The algorithm allows efficient use of non-temporal stores to reduce the required time for garbage collection. Non-temporal stores (or copies) are a CPU feature that allows the copy of data objects within main memory with no interference or pollution of the cache memory. The live objects copied to new memory locations will not be accessed again in the near future and therefore need not be copied to cache. This avoids copy operations and avoids taxing the CPU with cache determinations. In a preferred embodiment, the algorithm of the present invention exploits the fact that live data objects will be stored to consecutive new memory locations in order to perform streaming copies. Since each copy procedure has an associated CPU overhead, the process of streaming the copies reduces the degradation of system performance and thus reduces the time for garbage collection.
摘要翻译：描述了改进的移动垃圾收集算法。该算法允许有效地使用非时间存储来减少垃圾收集所需的时间。非时间存储（或副本）是一种CPU功能，允许在主存储器内复制数据对象，而不会对高速缓冲存储器造成干扰或污染。复制到新内存位置的实时对象在不久的将来不再被访问，因此不需要复制到缓存中。这避免了复制操作，并避免了使用缓存确定对CPU进行征税。在优选实施例中，本发明的算法利用实时数据对象将被存储到连续的新存储器位置以便执行流拷贝的事实。由于每个复制过程都具有相关的CPU开销，所以流式传输副本的过程减少了系统性能的降级，从而减少了垃圾回收的时间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式