公开(公告)号：US20080147974A1

公开(公告)日：2008-06-19

申请号：US11612296

申请日：2006-12-18

申请人： Justin P. Madison ,  Ghousuddin Syed ,  Omar Syed ,  Thomas R. Kee ,  Sastry Anipindi ,  Karl J. Juhnke

发明人： Justin P. Madison ,  Ghousuddin Syed ,  Omar Syed ,  Thomas R. Kee ,  Sastry Anipindi ,  Karl J. Juhnke

IPC分类号： G06F12/00

CPC分类号： G06F12/0897 ,  G06F12/0866 ,  G06F2212/264 ,  G06F2212/463

摘要： The present disclosure describes caching systems and methods for managing the storage of data file in different caching levels. Each caching level represents a faster, but more expensive, storage device or location, with the lowest level, or order, of a cache being the fastest, but also most expensive, and the highest being the slowest cache. Even slower than the various system cache levels are external file storage systems referred to as filers, such as database servers. The caching algorithm used by the system is designed so that more frequently requested items migrate to the faster cache areas. The algorithm immediately brings any requested file that is not in the cache into the fastest possible cache area if space is available or else into the next fastest if space is available there. If all cache areas are full, then the file is cached to the highest ‘order’ number cache area.

摘要翻译： 本公开描述了用于管理不同缓存级别中的数据文件的存储的缓存系统和方法。 每个缓存级别表示更快，但更昂贵的存储设备或位置，缓存的最低级别或顺序是最快的，但也是最昂贵的，而最慢的缓存是最高的缓存。 甚至比各种系统缓存级别慢的是称为文件管理器的外部文件存储系统，例如数据库服务器。 系统使用的缓存算法被设计为使得更频繁地请求的项目迁移到更快的缓存区域。 如果空间可用，则算法立即将任何不在缓存中的请求文件带入最快的缓存区域，否则，如果有空间可用，则该算法可以进入下一个最快的缓存区域。 如果所有高速缓存区域都已满，则该文件将缓存到最高“订单”数字缓存区域。