公开(公告)号：US09043542B2

公开(公告)日：2015-05-26

申请号：US14087557

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  Randy Pafford ,  Rajesh Sundaram

IPC: G06F12/00 ,  G06F12/12 ,  G06F12/02

CPC classification number: G06F12/12 ,  G06F12/0246 ,  G06F2212/222 ,  G06F2212/7211

Abstract: Described is a technique for managing the content of a nonvolatile solid-state memory data cache to improve cache performance while at the same time, and in a complementary manner, providing for automatic wear leveling. A modified circular first-in first-out (FIFO) log/algorithm is generally used to determine cache content replacement. The algorithm is used as the default mechanism for determining cache content to be replaced when the cache is full but is subject to modification in some instances. In particular, data are categorized according to different data classes prior to being written to the cache, based on usage. Once cached, data belonging to certain classes are treated differently than the circular FIFO replacement algorithm would dictate. Further, data belonging to each class are localized to designated regions within the cache.

Abstract translation: 描述了一种用于管理非易失性固态存储器数据高速缓存的内容以提高高速缓存性能的技术，同时以互补的方式提供自动磨损均衡。 修改的循环先进先出（FIFO）日志/算法通常用于确定高速缓存内容替换。 该算法用作在高速缓存已满的情况下确定要替换的缓存内容的默认机制，但在某些情况下可能会进行修改。 特别地，根据使用情况，在写入缓存之前，根据不同的数据类对数据进行分类。 一旦缓存，属于某些类的数据的处理方式与循环FIFO替换算法将会有所不同。 此外，属于每个类的数据被定位到高速缓存内的指定区域。

公开(公告)号：US20140181377A1

公开(公告)日：2014-06-26

申请号：US14087557

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  Randy Pafford ,  Rajesh S. Sundaram

IPC: G06F12/12 ,  G06F12/02

CPC classification number: G06F12/12 ,  G06F12/0246 ,  G06F2212/222 ,  G06F2212/7211

Abstract: Described is a technique for managing the content of a nonvolatile solid-state memory data cache to improve cache performance while at the same time, and in a complementary manner, providing for automatic wear leveling. A modified circular first-in first-out (FIFO) log/algorithm is generally used to determine cache content replacement. The algorithm is used as the default mechanism for determining cache content to be replaced when the cache is full but is subject to modification in some instances. In particular, data are categorized according to different data classes prior to being written to the cache, based on usage. Once cached, data belonging to certain classes are treated differently than the circular FIFO replacement algorithm would dictate. Further, data belonging to each class are localized to designated regions within the cache.

Abstract translation: 描述了一种用于管理非易失性固态存储器数据高速缓存的内容以提高高速缓存性能的技术，同时以互补的方式提供自动磨损均衡。 修改的循环先进先出（FIFO）日志/算法通常用于确定高速缓存内容替换。 该算法用作在高速缓存已满的情况下确定要替换的缓存内容的默认机制，但在某些情况下可能会进行修改。 特别地，根据使用情况，在写入缓存之前，根据不同的数据类对数据进行分类。 一旦缓存，属于某些类的数据的处理方式与循环FIFO替换算法将会有所不同。 此外，属于每个类的数据被定位到高速缓存内的指定区域。