公开(公告)号：US09280467B1

公开(公告)日：2016-03-08

申请号：US13834360

申请日：2013-03-15

申请人： EMC Corporation

发明人： Kumar Kanteti ,  William Davenport ,  Philippe Armangau

IPC分类号： G06F12/08 ,  G06F3/06

CPC分类号： G06F12/0808 ,  G06F3/0611 ,  G06F3/0659 ,  G06F3/0673 ,  G06F3/0689 ,  G06F12/0804 ,  G06F12/0813 ,  G06F12/0868 ,  G06F2212/1024 ,  G06F2212/261 ,  G06F2212/263 ,  G06F2212/281 ,  G06F2212/312 ,  G06F2212/466

摘要： A method and a system to dynamically determine how much of the total IO bandwidth may be used for flushing dirty metadata from the cache to the main memory without increasing the host memory access latency time, includes increasing the number of IO processes by adding a number of IO processes at short intervals and measuring host latency. If the host latency is acceptable, then increasing the number of IO processes again by the same number, and repeating until the host latency period reaches a limit. When the limit has been reached, reducing the number of IO processes by a multiplicative factor, and repeating the additive process from the reduced number of IO processes. The number of IO processes used for flushing dirty metadata may resemble a series of saw teeth, rising gradually and declining rapidly in response to the number of host IO processes needed.

摘要翻译： 一种方法和系统，用于动态地确定可以将多少总IO带宽用于将脏元数据从高速缓存刷新到主存储器，而不增加主机存储器访问延迟时间，包括通过添加若干个 IO处理时间短，测量主机延迟。 如果主机延迟可以接受，则再次增加IO进程的数量相同的数量，并重复，直到主机等待时间达到极限。 当达到极限时，通过乘法因子减少IO进程的数量，并从减少的IO进程数重复加法处理。 用于刷新脏元数据的IO进程的数量可能类似于一系列锯齿，其响应于所需的主机IO进程的数量逐渐上升并且迅速下降。

公开(公告)号：US09229864B1

公开(公告)日：2016-01-05

申请号：US13834385

申请日：2013-03-15

申请人： EMC Corporation

发明人： Kumar Kanteti ,  William Davenport ,  Philippe Armangau

IPC分类号： G06F12/08

CPC分类号： G06F12/0808 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/1024 ,  G06F2212/466

摘要： Flushing cache memory of dirty metadata in a plurality of file systems without either letting the caches reach their maximum capacity, or using so much of the total system IO process bandwidth that host system IO process requests are unreasonably delayed, may include determining the length of an interval between sync operations for each individual one of the plurality of file system, and how to divide a system wide maximum sync process IO operation bandwidth fairly between various ones of the plurality of file systems. A computer dynamically measures overall system operation rates, and calculates an available portion of a current calculated sync operation bandwidth for each file system. The computer also measures file system operation rates and determines how long a time period should be between sync operations in each file system.

摘要翻译： 在多个文件系统中刷新脏元数据的高速缓冲存储器，而不用让缓存达到其最大容量，或者使用主机系统IO处理请求无法延迟的整个系统IO进程带宽的大部分可能包括确定 多个文件系统中的每一个文件系统的同步操作之间的间隔，以及如何在多个文件系统中的各个文件系统之间公平地划分系统范围的最大同步处理IO操作带宽。 计算机动态地测量整个系统操作速率，并计算每个文件系统当前计算的同步操作带宽的可用部分。 计算机还测量文件系统操作速率，并确定每个文件系统中的同步操作之间的时间长度多长时间。