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

1. 发明授权

US06487638B2 System and method for time weighted access frequency based caching for memory controllers 有权
标题翻译：用于存储器控制器的基于时间加权访问频率的缓存的系统和方法
公开(公告)号：US06487638B2
公开(公告)日：2002-11-26
申请号：US09770146
申请日：2001-01-26
申请人： William Price Dawkins , Karl David Schubert
发明人： William Price Dawkins , Karl David Schubert
IPC分类号： C06F1200
CPC分类号： G06F12/122 , G06F12/0866 , G06F12/123 , G06F2212/312
摘要： A system and method for replacing cached data for a computer system utilizing one or more storage devices is disclosed. The storage devices are divided into a plurality of areas or bins. Each bin is preferably the same size. A Bin Access Table (BAT) is an array stored in memory that contains a frequency value for each bin corresponding to the number of times that the bin has been accessed during a predetermined time period. The BAT also contains a time stamp for each bin corresponding to the time that the bin was last accessed. A hot spot algorithm is used to calculate a hot spot factor or value hsf(x) for each bin based on its associated frequency value listed in the BAT. The frequency values may be weighted based on the time the bin was last accessed. Each line in cache will therefore correspond to a specific bin for which a time weighted hotspot factor hsf(x) has been calculated. These time weighted hot spot values are be stored in a hot spot table. When data is retrieved from a storage in response to a cache miss, a memory controller, such as a processor or RAID controller, will compare the hotspot factor hsf(a) of the bin associated with the new data to the lowest time weighted hotspot factor hsf(z) in the hot spot table. If the time weighted hsf(z) is greater than hsf(a), then this indicates that bin (z), the bin with the lowest time weighted hotspot factor, is accessed more frequently than bin (a), the bin containing the retrieved data. Thus if the time weighted hsf(z) is greater than hsf(a), then the cache line containing data from bin (z) will not be replaced. If hsf(a) is greater than the time weighted hsf(z) then the new data will replace the cached data from bin (z). The BAT table is updated after the I/O access.
摘要翻译：公开了一种用于替代利用一个或多个存储设备的计算机系统的缓存数据的系统和方法。存储装置被分成多个区域或仓。每个箱体最好是相同的尺寸。 bin访问表（BAT）是存储在存储器中的阵列，其包含与在预定时间段期间访问所述bin的次数相对应的每个bin的频率值。 BAT还包含对应于最后一次访问垃圾箱的时间的每个仓的时间戳。热点算法用于根据BAT中列出的相关频率值计算每个仓的热点因子或值hsf（x）。频率值可以基于上次访问槽的时间加权。因此，高速缓存中的每一行将对应于已经计算了时间加权热点因子hsf（x）的特定仓。这些时间加权热点值存储在热点表中。当响应于高速缓存未命中从存储器检索数据时，诸如处理器或RAID控制器的存储器控制器将将与新数据相关联的仓的热点因子hsf（a）与最低时间加权热点因子 hsf（z）在热点表中。如果时间加权hsf（z）大于hsf（a），则这表明bin（z）（bin）具有最低时间加权热点因子的bin比bin（a）更频繁地被访问，该bin包含检索到的数据。因此，如果时间加权hsf（z）大于hsf（a），则包含bin（z）数据的高速缓存行将不会被替换。如果hsf（a）大于加权hsf（z）的时间，则新数据将替换bin（z）中的缓存数据。在访问I / O之后，BAT表被更新。

2. 发明授权

US06507893B2 System and method for time window access frequency based caching for memory controllers 有权
标题翻译：用于存储器控制器的时间窗口访问基于频率的缓存的系统和方法
公开(公告)号：US06507893B2
公开(公告)日：2003-01-14
申请号：US09771248
申请日：2001-01-26
申请人： William Price Dawkins , Karl David Schubert
发明人： William Price Dawkins , Karl David Schubert
IPC分类号： G06F1200
CPC分类号： G06F12/122 , G06F3/0601 , G06F12/0866 , G06F2003/0697 , G06F2212/312
摘要： A system and method for replacing cached data for a computer system utilizing one or more storage devices is disclosed. The storage devices are divided into a plurality of areas or bins. Each bin is preferably the same size. A Window Access Table (WAT) is an array stored in memory that contains all the time windows for each bin. Each time window holds a frequency value corresponding to the number of times the bin has been accessed during the time period corresponding to that time window. A hot spot algorithm is used to calculate a hot spot value hsf(x) for each bin based on its associated frequency values listed in the WAT. The hot spot algorithm uses scaling coefficients to weight the frequency values based on the time window. Each line in cache will therefore have an associated bin for which a hot spot value hsf(x) has been calculated. This data may be stored in a hot spot table. When data is retrieved from a storage in response to a cache miss, the memory controller will compare the hot spot value hsf(a) of the bin associated with the new data to the lowest hot spot value hsf(z) in the hot spot table. If hsf(z) is greater than hsf(a), then this indicates that bin (z), the bin with the lowest hot spot value is accessed more frequently than bin (a), the bin containing the retrieved data. Thus if hsf(z) is greater than hsf(a), then the cache line containing data from bin (z) will not be replaced. If hsf(a) is greater than hsf(z) then the new data from bin (a) will replace the cached data from bin (z).
摘要翻译：公开了一种用于替代利用一个或多个存储设备的计算机系统的缓存数据的系统和方法。存储装置被分成多个区域或仓。每个箱体最好是相同的尺寸。窗口访问表（WAT）是存储在内存中的数组，包含每个bin的所有时间窗口。每个时间窗口保持与在该时间窗口对应的时间段期间访问该仓的次数对应的频率值。热点算法用于根据WAT中列出的相关频率值计算每个仓的热点值hsf（x）。热点算法使用缩放系数根据时间窗对频率值进行加权。因此，高速缓存中的每一行将具有已经计算出热点值hsf（x）的关联仓。该数据可以存储在热点表中。当响应于高速缓存未命中从存储器检索数据时，存储器控制器将与新数据相关联的仓的热点值hsf（a）与热点表中的最低热点值hsf（z）进行比较。如果hsf（z）大于hsf（a），则表示bin（z），具有最低热点值的bin比bin（a）更频繁地访问，该bin包含检索到的数据。因此，如果hsf（z）大于hsf（a），那么包含bin（z）数据的缓存行将不会被替换。如果hsf（a）大于hsf（z），则bin（a）中的新数据将替换bin（z）中的缓存数据。

3. 发明授权

US5668948A Media streamer with control node enabling same isochronous streams to appear simultaneously at output ports or different streams to appear simultaneously at output ports 失效
标题翻译：具有控制节点的媒体流传输器能够使同步的同步流同时出现在输出端口或不同的流中，同时出现在输出端口
公开(公告)号：US5668948A
公开(公告)日：1997-09-16
申请号：US302625
申请日：1994-09-08
申请人： William Russell Belknap , Louise Irene Cleary , James W. Eldridge , Larry William Fitchett , Stephen G. Luning , Christopher S. Murray , Howard T. Olnowich , Ashok Raj Saxena , Karl David Schubert , Buddy Floyd Stansbury
发明人： William Russell Belknap , Louise Irene Cleary , James W. Eldridge , Larry William Fitchett , Stephen G. Luning , Christopher S. Murray , Howard T. Olnowich , Ashok Raj Saxena , Karl David Schubert , Buddy Floyd Stansbury
IPC分类号： H04N5/93 , H04H20/42 , H04N5/765 , H04N7/173 , H04N21/218 , H04N21/226 , H04N21/238 , H04N21/262 , G06F9/00
CPC分类号： H04H20/42 , H04H60/04 , H04N21/21 , H04N21/23 , H04N7/17336 , H04H60/06
摘要： A media streamer (10) includes at least one storage node (16, 17) for storing a digital representation of a video presentation. The Video presentation requires a time T to present in its entirety, and is stored as a plurality of N data blocks, each data block storing data corresponding approximately to a T/N period of the video presentation. The media streamer further includes a plurality of communication nodes (14) each having at least one input port and at least one output port; a circuit switch (18) connected between the at least one storage node and input ports of the plurality of communication nodes, the circuit switch selectively coupling one or more of the input ports to the at least one storage node to enable the digital representation stored thereat to appear at one or more of the output ports; and at least one control node (18) coupled at least to the plurality of communication nodes and to the at least one storage node for enabling any one of the N blocks to appear at any output port of any of the plurality of communication nodes.
摘要翻译：媒体流分送器（10）包括用于存储视频呈现的数字表示的至少一个存储节点（16,17）。视频演示需要时间T来整体呈现，并且被存储为多个N个数据块，每个数据块存储大约对应于视频呈现的T / N周期的数据。媒体流传送器还包括多个通信节点（14），每个通信节点具有至少一个输入端口和至少一个输出端口; 连接在所述至少一个存储节点和所述多个通信节点的输入端口之间的电路开关（18），所述电路开关选择性地将所述输入端口中的一个或多个耦合到所述至少一个存储节点，以使得能够存储所述数字表示出现在一个或多个输出端口; 以及至少一个控制节点（18），其至少耦合到所述多个通信节点和所述至少一个存储节点，用于使所述N个块中的任何一个出现在所述多个通信节点中的任一个的任何输出端口处。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式