公开(公告)号：WO2017132623A1

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

申请号：PCT/US2017/015509

申请日：2017-01-27

Applicant: NETAPP, INC.

Inventor： JAIN, Sharad ,  NAGARAJ, Sudhindra, Prasad Tirupati ,  HANGUD, Vinay

IPC: G06F3/06

CPC classification number: G06F3/0631 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0644 ,  G06F3/0671 ,  G06F3/0673 ,  G06F3/0683 ,  G06F17/30339

Abstract: Embodiments address the problem of disk fragmentation by using the heuristics of write operations to assign block sizes. As write requests are received, a storage system may register a size of the write request. Using the registered sizes, the storage system may identify one or more clusters of sizes at which write requests are particularly prevalent. The storage system may calculate a distribution or variance for block sizes centered on each cluster. The distribution or variance may be used to distribute the block sizes such that the block sizes change by a small amount in the vicinity of the cluster, and by a larger amount as the blocks move away from the center of the cluster. When it comes time to allocate new blocks, the clusters and distribution may be consulted to determine what sizes of blocks to allocate, and how many blocks of each size.

Abstract translation: 实施例通过使用写入操作的启发式来分配块大小来解决磁盘碎片化的问题。 当接收到写请求时，存储系统可以注册写请求的大小。 使用所登记的大小，存储系统可以识别写入请求特别普遍的一个或多个大小簇。 存储系统可以计算以每个集群为中心的块大小的分布或方差。 可以使用分布或方差来分布块大小，使得块大小在集群附近以少量变化，并且随着块从集群中心移开而变大量。 当需要分配新块时，可以查询簇和分布以确定要分配的块的大小以及每个大小的块数。