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

1. 发明授权

US06453404B1 Distributed data cache with memory allocation model 有权
标题翻译：具有内存分配模型的分布式数据缓存
公开(公告)号：US06453404B1
公开(公告)日：2002-09-17
申请号：US09321300
申请日：1999-05-27
申请人： Alexandre Bereznyi , Sanjeev Katariya
发明人： Alexandre Bereznyi , Sanjeev Katariya
IPC分类号： G06F1202
CPC分类号： G06F12/023
摘要： A cache system allocates memory for storage of data items by defining a series of small blocks that are uniform in size. The system allocates one or more blocks from memory and assigns them for storage of a data item. If the data item exceeds the predetermined block size, more blocks are assigned for storage. If a residual portion of the data item less than the predetermined the block size remains, the operating system may allocate an additional small storage block to store the residual portion of the data item. The operating system allocates a large number of small blocks with a plurality of blocks having different sizes where a first plurality of blocks has one block size and a second plurality of blocks has a different block size. The large number of blocks allocated by the operating system avoid contention from multiple users requesting access to the data cache. The predetermined blocks are allocated by the data cache software itself and are not allocated by the operating system. In an exemplary embodiment, the blocks allocated by the data cache software need not be contiguous within the memory. Rather, each block contains a pointer to the start of the next block for a particular data item and the last block of the predetermined size blocks contains a pointer to the residual portion. A status list contains data indicating whether the particular blocks are free or used. When allocating blocks for storage of a data item, the system will use the status list to determine which blocks are free. The status list is updated to indicate the blocks have been allocated when a data item is stored within the cache. When a data item is removed from the cache, the status list is again updated to indicate that the availability of the blocks.
摘要翻译：缓存系统通过定义一系列尺寸一致的小块来分配用于存储数据项的存储器。系统从内存中分配一个或多个块，并分配它们以存储数据项。如果数据项超过预定块大小，则分配更多的块用于存储。如果数据项的剩余部分小于预定的块大小保留，则操作系统可以分配附加的小存储块来存储数据项的剩余部分。操作系统分配具有不同尺寸的多个块的大量小块，其中第一多个块具有一个块大小，并且第二多个块具有不同的块大小。由操作系统分配的大量块避免了来自请求访问数据高速缓存的多个用户的竞争。预定的块由数据高速缓存软件本身分配，并且不由操作系统分配。在示例性实施例中，由数据高速缓存软件分配的块不需要在存储器内是连续的。相反，每个块包含指向特定数据项的下一个块的开始的指针，并且预定大小块的最后一个块包含指向剩余部分的指针。状态列表包含指示特定块是空闲还是使用的数据。当分配块以存储数据项时，系统将使用状态列表来确定哪些块是空闲的。状态列表被更新以指示当数据项存储在高速缓存中时已经分配了块。当从高速缓存中删除数据项时，状态列表将再次被更新，以指示块的可用性。

2. 发明授权

US06449695B1 Data cache using plural lists to indicate sequence of data storage 有权
标题翻译：使用多个列表的数据高速缓存来指示数据存储的顺序
公开(公告)号：US06449695B1
公开(公告)日：2002-09-10
申请号：US09321301
申请日：1999-05-27
申请人： Alexandre Bereznyi , Sanjeev Katariya
发明人： Alexandre Bereznyi , Sanjeev Katariya
IPC分类号： G06F1212
CPC分类号： G06F17/30902 , G06F12/123
摘要： A cache system controls the insertion and deletion of data items using a plurality of utilization lists. When a data item is stored within the data cache, a corresponding data pointer, or other indicator, is stored within the utilization list in a manner indicative of the sequence in which data items were stored in the data cache. When a data item is subsequently retrieved from the data cache, the corresponding data pointer may be altered or moved to indicate that the data item has recently been retrieved. The data pointers corresponding to data items that have never been retrieved will indicate the sequence with which the data items were stored in the cache such that data items may be identified as least recently used (LRU) data items. The data pointers corresponding to data items that have been retrieved provide an indication of the sequence with which the data items have been retrieved such that the most recently retrieved data item is considered the most recently used (MRU) data item. The system controls the deletion of data items from the cache by deleting the LRU data items. A large number of utilization lists may operate independently to accommodate a large number of users. An entry pointer selects one of the utilization lists to store the data pointer corresponding to a data item stored within the cache. A deletion pointer selects one of the utilization lists. The system deletes the LRU data item based on the utilization list currently selected by the deletion pointer.
摘要翻译：高速缓存系统使用多个利用列表来控制数据项的插入和删除。当数据项存储在数据高速缓存中时，相应的数据指针或其他指示符以指示数据项存储在数据高速缓存中的顺序的方式存储在利用列表内。当随后从数据高速缓存中检索数据项时，相应的数据指针可以被改变或移动，以指示最近已经检索出数据项。对应于从未被检索到的数据项的数据指针将指示数据项被存储在高速缓存中的顺序，使得数据项可被识别为最近最少使用（LRU）数据项。对应于已被检索的数据项的数据指针提供数据项被检索的序列的指示，使得最近检索的数据项被认为是最近使用的（MRU）数据项。系统通过删除LRU数据项来控制从缓存中删除数据项。大量的利用列表可以独立地操作以容纳大量的用户。条目指针选择一个使用列表来存储对应于存储在高速缓存中的数据项的数据指针。删除指针选择一个利用率列表。系统根据删除指针当前选择的利用率列表删除LRU数据项。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式