公开(公告)号：US20160371225A1

公开(公告)日：2016-12-22

申请号：US14743322

申请日：2015-06-18

Applicant: NetApp, Inc.

Inventor： Peter Denz ,  Matthew Curtis-Maury

IPC: G06F15/167 ,  H04L29/08

CPC classification number: G06F15/167 ,  H04L49/90 ,  H04L67/1097

Abstract: A method, non-transitory computer readable medium, and data storage computing device that obtains data to be stored in a buffer in a buffer cache, determines a priority of the buffer based on the data, identifies one of a set of global recycle queues based on the priority, and inserts the buffer and metadata into the global recycle queue. When the global recycle queue is determined to be a lowest priority global recycle queue and the buffer is determined to be a least recently used buffer, the buffer is removed from the global recycle queue and inserted into a per-thread recycle queue. When the buffer is least recently used in the per-thread recycle queue, the buffer is removed from the per-thread recycle queue and placed in a free pool. With this technology, buffer cache can be more efficiently managed, particularly with respect to aging and scavenging operations, among other advantages.

Abstract translation: 获取要存储在缓冲器高速缓冲存储器中的数据的方法，非暂时性计算机可读介质和数据存储计算设备，基于该数据确定缓冲器的优先级，识别一组全局循环队列中的一个， 优先级，并将缓冲区和元数据插入到全局回收队列中。 当全局回收队列被确定为最低优先级的全局回收队列并且缓冲器被确定为最近最少使用的缓冲器时，将该缓冲器从全局回收队列中移除并插入到每线程循环队列中。 当缓冲区最近在每个线程循环队列中使用时，缓冲区将从每线程循环队列中删除并放置在一个空闲池中。 利用这种技术，可以更有效地管理缓冲区缓存，特别是在老化和清除操作方面以及其他优点。

公开(公告)号：US10606795B2

公开(公告)日：2020-03-31

申请号：US14743322

申请日：2015-06-18

Applicant: NetApp, Inc

Inventor： Peter Denz ,  Matthew Curtis-Maury

IPC: G06F15/16 ,  G06F15/167 ,  H04L29/08 ,  H04L12/861

Abstract: A method, non-transitory computer readable medium, and data storage computing device that obtains data to be stored in a buffer in a buffer cache, determines a priority of the buffer based on the data, identifies one of a set of global recycle queues based on the priority, and inserts the buffer and metadata into the global recycle queue. When the global recycle queue is determined to be a lowest priority global recycle queue and the buffer is determined to be a least recently used buffer, the buffer is removed from the global recycle queue and inserted into a per-thread recycle queue. When the buffer is least recently used in the per-thread recycle queue, the buffer is removed from the per-thread recycle queue and placed in a free pool. With this technology, buffer cache can be more efficiently managed, particularly with respect to aging and scavenging operations, among other advantages.

公开(公告)号：US09996470B2

公开(公告)日：2018-06-12

申请号：US14839450

申请日：2015-08-28

Applicant: NetApp, Inc.

Inventor： Peter Denz ,  Matthew Curtis-Maury ,  Peter Wyckoff

IPC: G06F12/08 ,  G06F12/0871 ,  G06F12/0875 ,  G06F12/0813 ,  G06F12/0868

CPC classification number: G06F12/0871 ,  G06F3/06 ,  G06F12/0813 ,  G06F12/0868 ,  G06F12/0875 ,  G06F12/0893 ,  G06F2212/314 ,  G06F2212/452 ,  G06F2212/604

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a workload management scheme for a file system buffer cache with a global recycle queue infrastructure. Methods for allocating a certain portion of the buffer cache without physically partitioning the buffer resources are disclosed which include: identifying a workload from a plurality of workloads; allocating the buffer cache in the data storage network for usage by the identified workload; tagging a buffer from within the buffer cache with a workload identifier and track each buffer; determining if the workload is exceeding its allocated buffer cache; and wherein determining the workload is exceeding its allocated percentage of buffer cache, enabling the workload's exceeded buffer to be available to scavenge; determining if the workload is exceeding a soft-limit on the allowable usage of the buffer cache, and wherein determining the workload is exceeding its soft-limit, degrading the prioritization of subsequent buffers, preventing the workload from thrashing out buffers of other workloads.