Dataset space reclamation

Information

  • Patent Grant
  • 11886707
  • Patent Number
    11,886,707
  • Date Filed
    Thursday, September 29, 2022
    a year ago
  • Date Issued
    Tuesday, January 30, 2024
    3 months ago
Abstract
Systems, methods, and computer readable storage mediums for discovering volumes which are good candidates for space reclamation. A storage subsystem identifies the file system storage capacity for a given volume from the file system metadata of the given volume. Then, the storage subsystem compares the file system capacity of the given volume to the allocated capacity on the storage subsystem. If the allocated capacity is greater than the file system capacity by a given threshold, the storage subsystem marks the given volume as a candidate for space reclamation and generates an alert to the user to reclaim the space of the given volume.
Description
TECHNICAL FIELD

Embodiments described herein relate to storage systems, and more particularly, to techniques for detecting conflicting storage capacity between a host and a storage system and characterizing the potential space reclamation.


BACKGROUND ART

As computer memory storage and data bandwidth increase, so does the amount and complexity of data that businesses daily manage. Large-scale distributed storage systems, such as data centers, typically run many business operations. A data center, which also may be referred to as a server room, is a centralized repository, either physical or virtual, for the storage, management, and dissemination of data pertaining to one or more businesses.


A file system may be defined as the part of an operating system which translates file-based accesses into logical block addresses corresponding to storage locations on one or more storage devices. A file system may also be defined as software which organizes sectors of one or more storage devices into datasets (e.g., files, volumes), directories, and/or folders. The term “file system” may also refer to the organized datasets, directories, or folders. Commonly used file systems include File Allocation Table (FAT), New Technology File System (NTFS), Network File System (NFS), Hierarchical File System (HFS), International Organization for Standardization (ISO) 9960, High-Performance File System (HPFS), Unix File System (UFS), Veritas File System (VxFS), Virtual Machine File System (VMFS), Third Extended Filesystem (Ext3), Fourth Extended Filesystem (Ext4) and others.


In data centers utilizing block-based storage arrays, the file system is typically managed by the host and not by the storage array. Accordingly, the storage array does not know when a file has been deleted or moved from a storage volume and therefore does not know when or if to release the space. This situation is especially detrimental in thinly-provisioned environments where that space could be immediately allocated to another device or application or just returned to the pool of available storage.


SUMMARY

Various embodiments of systems and methods for detecting capacity and identifying volumes containing space which can be reclaimed on a storage subsystem are contemplated.


In one embodiment, a storage subsystem may include one or more storage controllers and one or more storage devices. The storage subsystem may be coupled to one or more servers and/or other computing devices via one or more networks. The storage controller may receive read and write operations from one or more hosts and/or one or more clients. The storage controller may be configured to store a plurality of datasets (e.g., volumes, virtual machines) for the one or more hosts and/or one or more clients.


In one embodiment, a first file system resident on a server external to the storage subsystem may organize and provide access to a first dataset on the storage subsystem. The first dataset may have a first capacity from the perspective of the storage subsystem. Over time, one or more files may be deleted or moved from the first dataset. After the one or more files have been deleted from the first dataset, the first dataset may have a second capacity as perceived by the first file system, wherein the second capacity is less than the first capacity. In one embodiment, the first file system may not automatically notify the storage subsystem when files are deleted within the first dataset. The storage subsystem may be configured to detect the discrepancy between the first capacity and the second capacity of the first dataset. In response to detecting the discrepancy, the storage subsystem may generate an alert for a user, wherein the alert includes a recommendation that a space reclamation process targeting the first dataset be performed.


In one embodiment, a plurality of file systems may simultaneously utilize the storage subsystem to store a plurality of datasets. The storage subsystem may be configured to scan the plurality of datasets on a periodic basis to determine if any of the datasets have a storage subsystem capacity which exceeds the file system capacity. If the storage subsystem detects that a given dataset has a storage subsystem capacity which exceeds the file system capacity, the storage subsystem may mark the given dataset as a candidate for space reclamation. The storage subsystem may also communicate to the user that the given dataset is a candidate for space reclamation.


In one embodiment, the storage subsystem may generate an alert in response to detecting that a given dataset is a candidate for space reclamation. The storage subsystem may communicate the alert through one or more channels (e.g., email, simple network management protocol (SNMP) trap). In one embodiment, the storage subsystem may be configured to generate an alert when the reclaimable capacity for any dataset reaches a given threshold. In another embodiment, the storage subsystem may generate an alert when a given threshold of reclaimable capacity for the entire storage subsystem is reached.


The storage subsystem may also be configured to generate a report showing the datasets with the highest potential for capacity reclamation. In one embodiment, the storage subsystem may generate a list which displays datasets from the highest potential to lowest potential for reclamation, and the storage subsystem may display the list in a storage subsystem graphical user interface (GUI). In one embodiment, the storage subsystem GUI may include a graphical control element, which when selected by the user, initiates a script to reclaim space for one or more selected datasets. The storage subsystem may also be configured to determine the file system names of the plurality of datasets stored on the storage subsystem. The storage subsystem may display the file system name and/or the storage subsystem name of a given dataset in the storage subsystem GUI.


These and other embodiments will become apparent upon consideration of the following description and accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a generalized block diagram illustrating one embodiment of a storage system.



FIG. 2 is a block diagram of another embodiment of a storage system.



FIG. 3 illustrates a logical block diagram of one embodiment of a storage system.



FIG. 4 is a generalized flow diagram illustrating one embodiment of a method for alert generation.



FIG. 5 is a generalized flow diagram illustrating one embodiment of a method for generating a report of the best dataset candidates for performing space reclamation.



FIG. 6 is a generalized flow diagram illustrating one embodiment of a method for reclaiming space of a first dataset.



FIG. 7 is a generalized flow diagram illustrating one embodiment of a method for generating a recommendation.



FIG. 8 illustrates one embodiment of a storage subsystem status GUI.



FIG. 9 illustrates another embodiment of a storage subsystem status GUI.



FIG. 10 illustrates another embodiment of a storage subsystem status GUI.



FIG. 11 illustrates another embodiment of a storage subsystem status GUI.





While the methods and mechanisms described herein are susceptible to various modifications and alternative forms, specific embodiments are shown by way of example in the drawings and are herein described in detail. It should be understood, however, that drawings and detailed description thereto are not intended to limit the methods and mechanisms to the particular form disclosed, but on the contrary, are intended to cover all modifications, equivalents and alternatives apparent to those skilled in the art once the disclosure is fully appreciated.


DETAILED DESCRIPTION

In the following description, numerous specific details are set forth to provide a thorough understanding of the methods and mechanisms presented herein. However, one having ordinary skill in the art should recognize that the various embodiments may be practiced without these specific details. In some instances, well-known structures, components, signals, computer program instructions, and techniques have not been shown in detail to avoid obscuring the approaches described herein. It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements.


This specification includes references to “one embodiment”. The appearance of the phrase “in one embodiment” in different contexts does not necessarily refer to the same embodiment. Particular features, structures, or characteristics may be combined in any suitable manner consistent with this disclosure. Furthermore, as used throughout this application, the word “may” is used in a permissive sense (i.e., meaning having the potential to), rather than the mandatory sense (i.e., meaning must). Similarly, the words “include”, “including”, and “includes” mean including, but not limited to.


Terminology. The following paragraphs provide definitions and/or context for terms found in this disclosure (including the appended claims):


“Comprising.” This term is open-ended. As used in the appended claims, this term does not foreclose additional structure or steps. Consider a claim that recites: “A system comprising a storage controller . . . .” Such a claim does not foreclose the system from including additional components (e.g., a network, a server, a display device).


“Configured To.” Various units, circuits, or other components may be described or claimed as “configured to” perform a task or tasks. In such contexts, “configured to” is used to connote structure by indicating that the units/circuits/components include structure (e.g., circuitry) that performs the task or tasks during operation. As such, the unit/circuit/component can be said to be configured to perform the task even when the specified unit/circuit/component is not currently operational (e.g., is not on). The units/circuits/components used with the “configured to” language include hardware—for example, circuits, memory storing program instructions executable to implement the operation, etc. Reciting that a unit/circuit/component is “configured to” perform one or more tasks is expressly intended not to invoke 35 U.S.C. § 112, paragraph (f), for that unit/circuit/component. Additionally, “configured to” can include generic structure (e.g., generic circuitry) that is manipulated by software and/or firmware (e.g., an FPGA or a general-purpose processor executing software) to operate in a manner that is capable of performing the task(s) at issue. “Configured to” may also include adapting a manufacturing process (e.g., a semiconductor fabrication facility) to fabricate devices (e.g., integrated circuits) that are adapted to implement or perform one or more tasks.


“Based On.” As used herein, this term is used to describe one or more factors that affect a determination. This term does not foreclose additional factors that may affect a determination. That is, a determination may be solely based on those factors or based, at least in part, on those factors. Consider the phrase “determine A based on B.” While B may be a factor that affects the determination of A, such a phrase does not foreclose the determination of A from also being based on C. In other instances, A may be determined based solely on B.


Referring now to FIG. 1, a generalized block diagram of one embodiment of a storage system 100 is shown. Storage system 100 may include storage subsystem 105 and any number of other storage subsystems (not shown). Storage subsystem 105 may be any type of storage subsystem (e.g., storage array, storage server, storage shelf, storage device, Peripheral Component Interconnect Express (PCIe) card, flash drive, SSD) depending on the embodiment. For example, in one embodiment, storage subsystem 105 may be a storage array. The storage array may utilize different types of storage device technology, depending on the embodiment. For example, in one embodiment, the storage array may utilize flash (or solid-state) storage devices and may be an all-flash storage array. In other embodiments, the storage array may utilize other types of storage device technology.


Storage subsystem 105 may be configured to generate a graphical user interface (GUI) 110 to allow a local administrator or other users to view the status of storage subsystem 105 and to manage the performance of storage subsystem 105. Storage subsystem 105 may be coupled to client computer systems 130A-N via server 115 and network 125. Although storage subsystem 105 is shown as being connected directly to server 115, it is noted that one or more components (e.g., switch, fibre channel switch) and/or one or more networks may be located between storage subsystem 105 and server 115, depending on the embodiment. Server 115 is representative of any number and type (e.g., file server, application server, block server, database server) of servers which may be coupled to storage subsystem 105. Server 115 may be configured to enable storage and retrieval of data from storage subsystem 105 by clients 130A-N. Additionally, any number and type of virtual servers may be hosted by server 115, depending on the embodiment. Clients 130A-N are representative of any number of clients which may utilize storage subsystem 105 for storing and accessing data.


Network 125 may utilize a variety of techniques including wireless connection, direct local area network (LAN) connections, wide area network (WAN) connections such as the Internet, a router, storage area network (SAN), Ethernet, and others. Network 125 may further include remote direct memory access (RDMA) hardware and/or software, transmission control protocol/internet protocol (TCP/IP) hardware and/or software, router, repeaters, switches, grids, and/or others. Protocols such as Fibre Channel, Fibre Channel over Ethernet (FCoE), iSCSI, and so forth may be used in network 125. The network 125 may interface with a set of communications protocols used for the Internet such as the Transmission Control Protocol (TCP) and the Internet Protocol (IP), or TCP/IP.


Client computer systems 130A-N are representative of any number of stationary or mobile computers such as desktop personal computers (PCs), servers, server farms, workstations, laptops, handheld computers, terminals, servers, personal digital assistants (PDAs), smart phones, tablets, and so forth. Generally speaking, client computer systems 130A-N include one or more processors comprising one or more processor cores. Each processor core may include circuitry for executing instructions according to a predefined general-purpose instruction set. The processor cores may access cache memory subsystems for data and computer program instructions. The cache subsystems may be coupled to a memory hierarchy comprising random access memory (RAM) and a storage device.


It is noted that in alternative embodiments, the number and type of storage subsystems, client computers, networks, and servers is not limited to those shown in FIG. 1. At various times one or more clients may operate offline. In addition, during operation, individual client computer connection types may change as users connect, disconnect, and reconnect to system 100. Furthermore, the systems and methods described herein may be applied to directly attached storage systems or network attached storage systems and may include a host operating system configured to perform one or more aspects of the described methods. Numerous such alternatives are possible and are contemplated.


In one embodiment, storage subsystem 105 may be configured to identify potential candidates for space reclamation among the datasets (e.g., volumes, virtual machines, files) stored on storage subsystem 105. Storage subsystem 105 may be configured to perform this function independently (i.e., without any input) from server 115 and any of clients 130A-N. For example, storage subsystem 105 may be configured to identify candidates for space reclamation while storage subsystem 105 is disconnected from server 115, network 125, clients 130A-N, and any other networks, servers, computing devices, etc.


In one embodiment, storage subsystem 105 may maintain a list of datasets which are stored on storage subsystem 105. The list of datasets may include one or more volumes, virtual machines, files, or other logical groupings of data. Storage subsystem 105 may periodically scan the datasets from the list to determine good candidates for space reclamation. For example, in one embodiment, storage subsystem 105 may identify a first dataset from the list, and then storage subsystem 105 may locate file system metadata (e.g., file system header, table of contents) from the blocks assigned to the first dataset and stored in storage subsystem 105. Storage subsystem 105 may identify the file system type, file system name of the first dataset, and file system capacity of the first dataset from the file system metadata. Storage subsystem 105 may identify the number of physical storage blocks allocated to the first dataset and compare this to the size of the first dataset from the perspective of the host file system. In one embodiment, if storage subsystem 105 determines that the storage capacity allocated to the first dataset is greater than the file system capacity of the first dataset, storage subsystem 105 may alert a user that the first dataset has space that can be reclaimed. In another embodiment, if storage subsystem 105 determines that the first dataset has space available to be reclaimed, storage subsystem 105 may generate a request to the corresponding file system to reclaim the available blocks.


In various embodiments, storage subsystem 105 may be configured to discover the file system type of a given dataset without receiving this information from the host file system or server 115. In one embodiment, storage subsystem 105 may generate a first guess as to what the file system type is for the given dataset and then look for metadata (e.g., file system header, table of contents) that confirms the given dataset is the first file system type. If the first file system type does not match the metadata of the given dataset, then storage subsystem 105 may guess that the given dataset has a second file system type, wherein the second file system type is different from the first file system type. Storage subsystem 105 may be configured to continue this process until storage subsystem 105 is able to determine the file system type of the given dataset. Once storage subsystem 105 has determined the file system type of the given dataset, storage subsystem 105 may be configured to determine additional information (e.g., file system name, file system capacity) from the metadata associated with the given dataset.


In one embodiment, storage subsystem 105 may utilize a recursive process to discover the file system type of a given dataset. For example, if the file system type of a given dataset is a virtual machine file system (VMFS), then the given dataset may be composed of a plurality of virtual machines, each of which may be analyzed to discover if the corresponding virtual machine includes recoverable space. Generally speaking, storage subsystem 105 may be configured to analyze a first dataset within a second dataset to determine if the first dataset has recoverable space and is a good candidate for performing space reclamation, wherein the second dataset is part of a third dataset, wherein the third dataset is part of a fourth dataset, and so on. For example, in one embodiment, storage subsystem 105 may discover a file system inside of a virtual machine that is part of a VMFS, wherein the VMFS is part of a volume on storage subsystem 105. Storage subsystem 105 may be configured to generate specific alerts to target a single virtual machine disk (VMDK), of a plurality of VMDKs, for space reclamation within the VMFS. More generally, for a single given dataset, storage subsystem 105 may generate a plurality of alerts for reclaimable space corresponding to datasets within the single given dataset, wherein the plurality of alerts may be associated with a plurality of different types of file systems.


In another embodiment, storage subsystem 105 may discover an extended (ext3) file system inside a VMFS. Storage subsystem 105 may determine that the ext3 file system is using a first storage capacity on storage subsystem 105, and the VMDK inside VMFS may report a second storage capacity for the ext3 file system, wherein the second storage capacity is less than the first storage capacity. In one embodiment, storage subsystem 105 may discover the discrepancy between the first storage capacity and the second storage capacity by discovering that the number of non-zero blocks stored in the VMDK file exceeds the size according to the file system inside the virtual machine. In response to discovering the discrepancy, storage subsystem 105 may be configured to mark the ext3 file system as a candidate for space reclamation and/or generate a corresponding alert to the user.


Turning now to FIG. 2, a block diagram of another embodiment of a storage system 200 is shown. Storage system 200 may include storage array 205, server 220, clients 215 and 225, and network 250. Storage array 205 may include storage controller 210 and storage device groups 230 and 240, which are representative of any number of storage device groups. As shown, storage device group 230 includes storage devices 235A-N, which are representative of any number and type of storage devices (e.g., solid-state drives (SSDs), PCIe cards, hard disk drives (HDDs), USB drives). It should be understood that while storage system 200 is shown as including one storage array, in other embodiments, storage system 200 may include a plurality of storage arrays. It is noted that storage array 205 may also be referred to as a storage subsystem. Although not shown in FIG. 2, it is noted that storage array 205 may include two or more storage controllers in other embodiments.


Storage controller 210 may include software and/or hardware configured to provide access to storage devices 235A-N. Although storage controller 210 is shown as being separate from storage device groups 230 and 240, in some embodiments, storage controller 210 may be located within one or each of storage device groups 230 and 240. Storage controller 210 may include or be coupled to a base operating system (OS), a volume manager, and additional control logic for implementing the various techniques disclosed herein.


Storage controller 210 may include and/or execute on any number of processors and may include and/or execute on a single host computing device or be spread across multiple host computing devices, depending on the embodiment. In some embodiments, storage controller 210 may generally include or execute on one or more file servers and/or block servers. Storage controller 210 may use any of various techniques for replicating data across devices 235A-N to prevent loss of data due to the failure of a device or the failure of storage locations within a device. Storage controller 210 may also utilize any of various deduplication and/or compression techniques for reducing the amount of data stored in devices 235A-N.


Storage array 205 may be configured to determine if any of a plurality of datasets stored on storage array 205 is a good candidate for space reclamation. In one embodiment, storage array 205 may also be configured to determine if a portion or subset of any dataset is a good candidate for space reclamation. In one embodiment, the plurality of datasets stored on storage array 205 may correspond to a plurality of different file systems. Storage array 205 may be configured to manage separate datasets differently based on the type of file system to which the dataset corresponds.


For example, a first file system may automatically perform space reclamation for the datasets it manages. Therefore, when storage array 205 is searching for a good dataset candidate for performing space reclamation, storage array 205 may skip any datasets managed by the first file system. This may be advantageous when storage array 205 has a limited time window for identifying good candidates for performing space reclamation.


Storage array 205 may identify a subset of datasets, of the plurality of datasets, as potential candidates for space reclamation, wherein the subset of datasets is chosen based at least in part on the types of file systems to which they belong. Storage array 205 may then read the file system metadata for this subset of datasets and determine the amount of space which can be reclaimed for these datasets. In one embodiment, if any dataset from the subset has a threshold amount of reclaimable space, then storage array 205 may mark the dataset as a candidate for space reclamation and generate an alert. In response to receiving the alert, the user may launch a script targeting only the marked dataset for space reclamation. In one embodiment, the alert may be configured to modify the script by specifying which dataset to target for space reclamation.


Referring now to FIG. 3, a logical block diagram of one embodiment of a storage system 300 is shown. Storage system 300 may include at least servers 305A-N, switch 330, and storage subsystem 320. Servers 305A-N are representative of any number and type of servers. In one embodiment, one or more of servers 305A-N may be virtual servers. Server 305A may include at least file systems 310A-B, server 305B may include at least file systems 310C-D, and server 305N may include at least file system 310N and volume manager 315. File systems 310A-N are representative of any number and type (e.g., NTFS, VMFS, Ext3, Ext4) of file systems which may be utilized on servers 305A-N. Servers 305A-N may be configured to utilize storage subsystem 320 for storing data associated with the operating systems, file systems, volume managers, hypervisors, and other applications and programs executing on servers 305A-N.


Storage subsystem 320 may store datasets 325A-N, which are representative of any number and type of datasets (e.g., volumes, virtual machines, files). For each dataset of datasets 325A-N, storage subsystem 320 may be configured to identify the file system type of the dataset as well as other characteristics such as dataset name (from the file system perspective) and file system capacity of the dataset. Storage subsystem 320 may be configured to identify dataset candidates for space reclamation based on detecting a discrepancy between the file system capacity of a given dataset and the storage subsystem capacity of the given dataset. In various embodiments, storage subsystem 320 may be configured to generate alerts, notify users, and/or launch space reclamation tasks in response to detecting one or more conditions associated with datasets 325A-N.


Referring now to FIG. 4, one embodiment of a method 400 for performing alert generation is shown. The components embodied in systems 100, 200, or 300 described above (e.g., storage controller 210) may generally operate in accordance with method 400. In addition, the steps in this embodiment are shown in sequential order. However, some steps may occur in a different order than shown, some steps may be performed concurrently, some steps may be combined with other steps, and some steps may be absent in another embodiment.


A storage controller, of a storage subsystem (e.g., storage array), may locate metadata of a file system associated with a logical storage unit (block 405). The logical storage unit may be a dataset, volume, virtual machine, file, or other logical grouping of data. In one embodiment, the storage controller may not know the file system type of the logical storage unit prior to locating the metadata. Next, the storage controller may read the file system metadata of the logical storage unit (block 410). In various embodiments, the storage controller may determine the file system type, the file system name of the logical storage unit, the amount of storage space utilized by the file system for the logical storage unit, and one or more other factors associated with the logical storage unit by reading the file system metadata.


Next, the storage controller may detect a discrepancy between the amount of storage space utilized by the logical storage unit and the amount of storage space allocated to the logical storage unit (block 415). The storage controller may detect the discrepancy independently of the host (or server) and file system associated with the logical storage unit. For example, if the storage subsystem is disconnected from the host, the storage controller would still be able to detect the discrepancy. In one embodiment, the storage controller may detect the discrepancy by comparing the amount of storage space utilized by the logical storage unit and the amount of storage space allocated to the logical storage unit and detecting that the amount of storage space utilized by the logical storage unit is less than the amount of storage space allocated to the logical storage unit.


In response to detecting the discrepancy, the storage controller may identify the first logical storage unit as a potential candidate for space reclamation (block 420). Next, the storage controller may generate an alert for users of the storage subsystem in response to one or more conditions (block 425). The alert may be communicated through one or more of various alerting channels (e.g., emails, SNMP traps). Depending on the embodiment, the one or more conditions may include the storage controller detecting that a given percentage threshold (e.g., 5%, 10%) of the logical storage unit's allocated storage space has been reached, a given storage space threshold (e.g., 100 GB) has been reached, a given percentage threshold or storage space threshold of total storage subsystem capacity has been reached, and/or one or more other conditions. After block 425, method 400 may end. It is noted that method 400 may be performed a plurality of times for a plurality of logical storage units (e.g., volumes, virtual machines, files).


Referring now to FIG. 5, one embodiment of a method 500 for generating a report of the best dataset candidates for performing space reclamation is shown. The components embodied in systems 100, 200, or 300 described above (e.g., storage controller 210) may generally operate in accordance with method 500. In addition, the steps in this embodiment are shown in sequential order. However, some steps may occur in a different order than shown, some steps may be performed concurrently, some steps may be combined with other steps, and some steps may be absent in another embodiment.


The storage controller of a storage subsystem (e.g., storage array) may be configured to identify which datasets of a plurality of datasets have a storage subsystem capacity which exceeds the file system capacity (block 505). Next, the storage controller may generate a report of the best candidates for space reclamation (block 510). In one embodiment, the report may list the best candidates with the most space to reclaim at the top of the list. In some embodiments, the report may only list candidates with at least a threshold amount or a threshold percentage (as a total of the corresponding dataset's allocated capacity) of space to be reclaimed.


Next, the storage controller may display the report to a user or administrator of the storage subsystem (block 515). In one embodiment, the report may be displayed in a storage subsystem status GUI. In some embodiments, the storage subsystem status GUI may also include graphical control elements to allow a user to launch a script to reclaim space on one or more of the best dataset candidates. After block 515, method 500 may end. Executing method 500 may be advantageous for the storage subsystem by allowing for a more efficient space reclamation process by targeting the best candidates for space reclamation rather than trying to reclaim space from a large number of datasets, some of which may have little or no space to reclaim.


Referring now to FIG. 6, one embodiment of a method 600 for reclaiming space of a first dataset is shown. The components embodied in systems 100, 200, or 300 described above (e.g., storage controller 210) may generally operate in accordance with method 600. In addition, the steps in this embodiment are shown in sequential order. However, some steps may occur in a different order than shown, some steps may be performed concurrently, some steps may be combined with other steps, and some steps may be absent in another embodiment.


A storage subsystem (e.g., storage array) may detect a discrepancy between the capacity of a first dataset as seen from a host and the actual capacity utilized by the first dataset on the storage subsystem (block 605). The storage subsystem may generate an alert responsive to detecting the capacity discrepancy (block 610). The alert may be communicated through one or more of various alerting channels (e.g., emails, SNMP traps).


In response to the alert being generated, a space reclamation script may be launched (block 615). In one embodiment, a user may launch the space reclamation alert in response to receiving the alert. Alternatively, in another embodiment, the space reclamation script may be launched automatically in response to the alert. The space reclamation script may determine which blocks of the first dataset are no longer in use (block 620). In one embodiment, the script may obtain the identity of the blocks from the file system associated with the first dataset. Then, the space reclamation script may issue commands to the storage subsystem to free the identified blocks (block 625). In one embodiment, the script may issue small computer system interface (SCSI) UNMAP commands to the storage subsystem. In one embodiment, freeing the identified blocks may comprise removing references from the first dataset to the identified blocks. These blocks may be freed at a later point in time as part of garbage collection operations if the blocks are not referenced by any other datasets. After block 625, method 600 may end.


Referring now to FIG. 7, one embodiment of a method 700 for generating a recommendation is shown. The components embodied in systems 100, 200, or 300 described above (e.g., storage controller 210) may generally operate in accordance with method 700. In addition, the steps in this embodiment are shown in sequential order. However, some steps may occur in a different order than shown, some steps may be performed concurrently, some steps may be combined with other steps, and some steps may be absent in another embodiment.


A storage subsystem may identify one or more datasets as candidates for space reclamation (block 705). The storage subsystem may calculate the amount of space that can be reclaimed for the one or more datasets (block 710). In one embodiment, the amount of space that can be reclaimed may be equal to the difference between the file system utilized capacity of the one or more datasets and the storage subsystem allocated capacity of the one or more datasets.


The storage subsystem may also calculate an estimate of the amount of time needed for reclaiming the calculated amount of space (block 715). The storage subsystem may calculate the estimate based on the amount of space to reclaim, the type of file system associated with each dataset of the one or more datasets, and/or one or more other factors. Then, the storage subsystem may generate an alert for a user to recommend that space reclamation be performed (block 720). In one embodiment, the alert may include an indication of the amount of space that can be reclaimed along with an indication of the estimate of the amount of time needed for reclaiming this amount of space. In some embodiments, the storage subsystem may generate a graphical control element for the storage subsystem GUI, and the graphical control element may allow the user to initiate space reclamation for the one or more datasets identified in block 705. After block 720, method 700 may end.


Turning now to FIG. 8, one embodiment of a storage subsystem status GUI 800 is shown. The storage subsystem GUI may be generated by a storage subsystem to allow a user to view the status of the storage subsystem and the various volumes and other datasets stored therein. Each volume stored by the storage subsystem may have both a file system name and a storage subsystem name, wherein the file system name is different from the storage subsystem name. Five different volumes are shown in GUI 800, with each volume showing the file system name followed by the storage subsystem name. These five volumes include: VMFS-5 (file system name) or LUN 6 (storage subsystem name), Production 1 (file system name) or LUN 2 (storage subsystem name), Demo Volume (file system name) or LUN 14 (storage subsystem name), Clone 1 (file system name) or LUN 25 (storage subsystem name), and VMFS-3 (file system name) or LUN 3 (storage subsystem name).


The use of different names for the same volume can potentially cause confusion for users of the storage subsystem. Accordingly, the storage subsystem GUI may include graphical control elements 805, 810, and 815 to allow the user to choose which names of volumes are shown. The user may select graphic control element 805 to show only the file system names of the volumes, the user may select graphic control element 810 to show only the storage subsystem names of the volumes, or the user may select graphic control element 815 to show both the file system names and the storage subsystem names of the volumes. It is noted that GUI 800 is intended to represent a storage subsystem status GUI in accordance with one embodiment. In other embodiments, the storage subsystem status GUI may be organized differently and/or may include additional information.


In one embodiment, when a server coupled to the storage subsystem uses a logical volume manager, the storage subsystem may be configured to group together volumes belonging to the same volume group in GUI 800. By grouping together volumes belonging to the same volume group in GUI 800, users may be able to manage these volumes as a single entity without having to declare this entity at the storage level.


Referring now to FIG. 9, another embodiment of a storage subsystem status GUI 900 is shown. GUI 900 shows the best candidates for space reclamation as shown in GUI 800 of FIG. 8. Additionally, GUI 900 shows a window 905 which may be generated when the storage subsystem generates an alert in response to a given volume reaching a threshold amount of reclaimable storage capacity. In one embodiment, the threshold may be 20 GB, while in other embodiments, the threshold may be higher or lower than 20 GB.


In response to the volume “VMFS-5” (or “LUN 6” from the storage subsystem perspective) reaching a threshold amount of space which is available to be reclaimed, the storage subsystem may be configured to generate window 905 in the GUI 900. In various embodiments, window 905 may include a plurality of graphical control elements to allow the user to initiate one or more actions in response to the alert. For example, in one embodiment, the storage subsystem may be configured to generate graphical control element 910 to allow the user to launch a space reclamation script for the volume “VMFS-5”. In one embodiment, the storage subsystem may be configured to create and then execute the space reclamation script in response to detecting the user selecting graphical control element 910. In another embodiment, a space reclamation script may already exist, and the storage subsystem may be configured to modify the script so that the script targets one or more specific volumes associated with the alert.


The storage subsystem may also be configured to generate graphical control element 915 to allow the user to wait to reclaim the space for the volume “VMFS-5” until the next scheduled maintenance window. The storage subsystem may also be configured to generate graphical control element 920 to allow the user to ignore the alert. It is noted that in other embodiments, GUI 900, window 905, and graphical control elements 910, 915, and 920 may appear differently and/or may include additional information. For example, although window 905 is shown as being displayed in a separate window in front of GUI 900, in other embodiments, the information shown in window 905 may be displayed within GUI 900. Also, other numbers of graphical control elements may be generated in other embodiments.


Turning now to FIG. 10, another embodiment of a storage subsystem status GUI 1000 is shown. GUI 1000 may show a list of volumes and other datasets which are the best candidates for performing space reclamation. GUI 1000 may also include various details associated with the best candidate datasets, including an amount of space to reclaim and an estimate for how long it will take to reclaim the available space in the dataset.


In one embodiment, the estimate 1005 for each dataset may be calculated independently by the storage subsystem without any input from the corresponding host. In another embodiment, the estimate 1005 for each dataset may be calculated using inputs from both the storage subsystem and the corresponding host. The estimate 1005 for each dataset may be calculated based on the file system type, the amount of capacity to be reclaimed, the status of the target storage devices, and/or one or more other factors.


Referring now to FIG. 11, another embodiment of a storage subsystem status GUI 1100 is shown. In one embodiment, the storage subsystem may be configured to generate window 1105 to enable the user to select individual volumes for performing space reclamation and/or select an amount of time for performing space reclamation. The user may select individual volumes to perform space reclamation on, using box 1110. The user may select multiple volumes at the same time. Alternatively, the user may specify that the storage subsystem should select which volumes to perform space reclamation on based on the amount of time selected (in graphical control element 1115) for performing space reclamation. Although not shown in graphical control element 1115, the user may also specify a specific day and time when the space reclamation should occur.


In one embodiment, the storage subsystem may be configured to select which volumes to perform space reclamation on based on the amount of time selected by the user in graphical control element 1115. In another embodiment, the user may select one or more volumes for performing space reclamation and an amount of time for performing space reclamation. The storage subsystem may be configured to generate a warning for the user if the storage subsystem predicts that space reclamation on the one or more selected volumes will not be able to be completed in the amount of time selected by the user.


It is noted that the above-described embodiments may comprise software. In such an embodiment, the program instructions that implement the methods and/or mechanisms may be conveyed or stored on a non-transitory computer readable medium. Numerous types of media which are configured to store program instructions are available and include hard disks, floppy disks, CD-ROM, DVD, flash memory, Programmable ROMs (PROM), random access memory (RAM), and various other forms of volatile or non-volatile storage.


In various embodiments, one or more portions of the methods and mechanisms described herein may form part of a cloud-computing environment. In such embodiments, resources may be provided over the Internet as services according to one or more various models. Such models may include Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). In IaaS, computer infrastructure is delivered as a service. In such a case, the computing equipment is generally owned and operated by the service provider. In the PaaS model, software tools and underlying equipment used by developers to develop software solutions may be provided as a service and hosted by the service provider. SaaS typically includes a service provider licensing software as a service on demand. The service provider may host the software, or may deploy the software to a customer for a given period of time. Numerous combinations of the above models are possible and are contemplated.


Although the embodiments above have been described in considerable detail, numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.

Claims
  • 1. A method comprising: determining, by a controller in a storage system, that a storage capacity allocated to a file system for a dataset is greater than a utilized capacity for the dataset;providing an alert that the storage capacity allocated to the file system for the dataset is greater than the utilized capacity for the dataset;identifying, by the controller, one or more portions of storage space that are no longer in use by the dataset; andissuing, by the controller based on an amount of reclaimable space in the one or more portions of storage space, a command to free the identified one or more portions of storage space.
  • 2. The method of claim 1, further comprising determining, by the controller, an amount of reclaimable space in the one or more portions of storage space.
  • 3. The method of claim 1, further comprising estimating, by the controller, an amount of time needed to reclaim the one or more portions of storage space.
  • 4. The method of claim 1, further comprising identifying whether the amount of reclaimable space is greater than a threshold.
  • 5. The method of claim 1, wherein the command to free the identified one or more portions of storage space causes references from the dataset to the one or more portions of storage space to be removed.
  • 6. The method of claim 1, wherein identifying the one or more portions of storage space that are no longer in use by the dataset comprises obtaining an identity of blocks from the file system associated with the dataset.
  • 7. The method of claim 1, wherein the alert identifies an amount of reclaimable space for the dataset.
  • 8. The method of claim 1, wherein the alert identifies an estimated amount of time to reclaim space for the dataset.
  • 9. The method of claim 1, wherein the alert allows a user to initiate space reclamation for the dataset.
  • 10. A storage system including a computer memory and a computer processor, the computer processor including computer program instructions that, when executed by the computer processor, cause the storage system to carry out the steps of: determining, by a controller in the storage system, that a storage capacity allocated to a file system for a dataset is greater than a utilized capacity for the dataset;providing an alert that the storage capacity allocated to the file system for the dataset is greater than the utilized capacity for the dataset;identifying one or more portions of storage space that are no longer in use by the dataset; andissuing, based on an amount of reclaimable space in the one or more portions of storage space, a command to free the identified one or more portions of storage space.
  • 11. The storage system of claim 10, wherein the computer program instructions further cause the storage system to carry out the step of determining an amount of reclaimable space in the one or more portions of storage space.
  • 12. The storage system of claim 10, wherein the computer program instructions further cause the storage system to carry out the step of estimating an amount of time needed to reclaim the one or more portions of storage space.
  • 13. The storage system of claim 10, wherein the computer program instructions further cause the storage system to carry out the step of identifying whether the amount of reclaimable space is greater than a threshold.
  • 14. The storage system of claim 10, wherein the command to free the identified one or more portions of storage space causes references from the dataset to the one or more portions of storage space to be removed.
  • 15. The storage system of claim 10, wherein identifying the one or more portions of storage space that are no longer in use by the dataset comprises obtaining an identity of blocks from the file system associated with the dataset.
  • 16. The storage system of claim 10, wherein the alert identifies an amount of reclaimable space for the dataset.
  • 17. The storage system of 10, wherein the alert identifies an estimated amount of time to reclaim space for the dataset.
  • 18. An apparatus including a computer memory and a computer processor, the computer processor including computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of: determining, by a controller in a storage system, that a storage capacity allocated to a file system for a dataset is greater than a utilized capacity for the dataset;providing an alert that the storage capacity allocated to the file system for the dataset is greater than the utilized capacity for the dataset;identifying one or more portions of storage space that are no longer in use by the dataset; andissuing, based on an amount of reclaimable space in the one or more portions of storage space, a command to free the identified one or more portions of storage space.
  • 19. The apparatus of claim 18, wherein the computer program instructions further cause the apparatus to carry out the step of determining an amount of reclaimable space in the one or more portions of storage space.
  • 20. The apparatus of claim 18, wherein the computer program instructions further cause the apparatus to carry out the step of estimating an amount of time needed to reclaim the one or more portions of storage space.
CROSS-REFERENCE TO RELATED APPLICATIONS

This is a continuation application for patent entitled to a filing date and claiming the benefit of earlier-filed U.S. patent application Ser. No. 17/025,036, filed Sep. 18, 2020, herein incorporated by reference in its entirety, which is a continuation of U.S. Pat. No. 10,809,921, issued Oct. 20, 2020, which is a continuation of U.S. Pat. No. 10,782,892, issued Sep. 22, 2020, which is a continuation of U.S. Pat. No. 9,710,165, issued Jul. 18, 2017.

US Referenced Citations (175)
Number Name Date Kind
5208813 Stallmo May 1993 A
5403639 Belsan et al. Apr 1995 A
5940838 Schmuck et al. Aug 1999 A
6263350 Wollrath et al. Jul 2001 B1
6412045 DeKoning et al. Jun 2002 B1
6718448 Ofer Apr 2004 B1
6757769 Ofer Jun 2004 B1
6799283 Tamai et al. Sep 2004 B1
6834298 Singer et al. Dec 2004 B1
6850938 Sadjadi Feb 2005 B1
6915434 Kuroda et al. Jul 2005 B1
6973549 Testardi Dec 2005 B1
7028216 Aizawa et al. Apr 2006 B2
7028218 Schwarm et al. Apr 2006 B2
7039827 Meyer et al. May 2006 B2
7216164 Whitmore et al. May 2007 B1
7783682 Patterson Aug 2010 B1
7873619 Faibish et al. Jan 2011 B1
7913300 Flank et al. Mar 2011 B1
7933936 Aggarwal et al. Apr 2011 B2
7975115 Wayda et al. Jul 2011 B2
7979613 Zohar et al. Jul 2011 B2
8086652 Bisson et al. Dec 2011 B1
8117464 Kogelnik Feb 2012 B1
8200887 Bennett Jun 2012 B2
8205065 Matze Jun 2012 B2
8352540 Anglin et al. Jan 2013 B2
8504797 Mimatsu Aug 2013 B2
8527544 Colgrove et al. Sep 2013 B1
8560747 Tan et al. Oct 2013 B1
8621241 Stephenson Dec 2013 B1
8700875 Barron et al. Apr 2014 B1
8751463 Chamness Jun 2014 B1
8806160 Colgrove et al. Aug 2014 B2
8822155 Sukumar et al. Sep 2014 B2
8874850 Goodson et al. Oct 2014 B1
8881144 Banerjee Nov 2014 B1
8943027 Dwan et al. Jan 2015 B1
8959305 LeCrone et al. Feb 2015 B1
9081713 Bennett Jul 2015 B1
9189334 Bennett Nov 2015 B2
9280678 Redberg Mar 2016 B2
9311182 Bennett Apr 2016 B2
9383924 Fullbright et al. Jul 2016 B1
9395922 Nishikido et al. Jul 2016 B2
9423967 Colgrove et al. Aug 2016 B2
9436396 Colgrove et al. Sep 2016 B2
9436720 Colgrove et al. Sep 2016 B2
9454476 Colgrove et al. Sep 2016 B2
9454477 Colgrove et al. Sep 2016 B2
9513820 Shalev Dec 2016 B1
9516016 Colgrove et al. Dec 2016 B2
9552248 Miller et al. Jan 2017 B2
9632870 Bennett Apr 2017 B2
9710165 Lherault et al. Jul 2017 B1
10324639 Seo Jun 2019 B2
10567406 Astigarraga et al. Feb 2020 B2
10782892 Lherault et al. Sep 2020 B1
10802965 Stephens Oct 2020 B2
10809921 Lherault et al. Oct 2020 B1
10846137 Vallala et al. Nov 2020 B2
10877683 Wu et al. Dec 2020 B2
11076509 Alissa et al. Jul 2021 B2
11106810 Natanzon et al. Aug 2021 B2
11194707 Stalzer Dec 2021 B2
20020038436 Suzuki Mar 2002 A1
20020087544 Selkirk et al. Jul 2002 A1
20020178335 Selkirk et al. Nov 2002 A1
20030140209 Testardi Jul 2003 A1
20040049572 Yamamoto et al. Mar 2004 A1
20040181562 Findeisen Sep 2004 A1
20050066095 Mullick et al. Mar 2005 A1
20050216535 Saika et al. Sep 2005 A1
20050223154 Uemura Oct 2005 A1
20060074940 Craft et al. Apr 2006 A1
20060136365 Kedem et al. Jun 2006 A1
20060155946 Ji Jul 2006 A1
20070067585 Ueda et al. Mar 2007 A1
20070162954 Pela Jul 2007 A1
20070171562 Maejima et al. Jul 2007 A1
20070174673 Kawaguchi et al. Jul 2007 A1
20070220313 Katsuragi et al. Sep 2007 A1
20070245090 King et al. Oct 2007 A1
20070266037 Terry et al. Nov 2007 A1
20070266179 Chavan et al. Nov 2007 A1
20080059699 Kubo et al. Mar 2008 A1
20080065852 Moore et al. Mar 2008 A1
20080134174 Sheu et al. Jun 2008 A1
20080155191 Anderson et al. Jun 2008 A1
20080178040 Kobayashi Jul 2008 A1
20080209096 Lin et al. Aug 2008 A1
20080244205 Amano et al. Oct 2008 A1
20080256141 Wayda et al. Oct 2008 A1
20080275928 Shuster Nov 2008 A1
20080285083 Aonuma Nov 2008 A1
20080307270 Li Dec 2008 A1
20090006587 Richter Jan 2009 A1
20090037662 La Frese et al. Feb 2009 A1
20090125572 Cannon May 2009 A1
20090204858 Kawaba Aug 2009 A1
20090228648 Wack Sep 2009 A1
20090300084 Whitehouse Dec 2009 A1
20100057673 Savov Mar 2010 A1
20100058026 Heil et al. Mar 2010 A1
20100067706 Anan et al. Mar 2010 A1
20100077205 Ekstrom et al. Mar 2010 A1
20100082879 McKean et al. Apr 2010 A1
20100106905 Kurashige et al. Apr 2010 A1
20100153620 McKean et al. Jun 2010 A1
20100153641 Jagadish et al. Jun 2010 A1
20100191897 Zhang et al. Jul 2010 A1
20100250802 Waugh et al. Sep 2010 A1
20100250882 Hutchison et al. Sep 2010 A1
20100281225 Chen et al. Nov 2010 A1
20100287327 Li et al. Nov 2010 A1
20100306500 Mimatsu Dec 2010 A1
20110035540 Fitzgerald et al. Feb 2011 A1
20110072300 Rousseau Mar 2011 A1
20110145598 Smith et al. Jun 2011 A1
20110161559 Yurzola et al. Jun 2011 A1
20110167221 Pangal et al. Jul 2011 A1
20110238634 Kobara Sep 2011 A1
20120023375 Dutta et al. Jan 2012 A1
20120036309 Dillow et al. Feb 2012 A1
20120117029 Gold May 2012 A1
20120198175 Atkisson Aug 2012 A1
20120324277 Weston-Lewis Dec 2012 A1
20120330954 Sivasubramanian et al. Dec 2012 A1
20130042052 Colgrove et al. Feb 2013 A1
20130046995 Movshovitz Feb 2013 A1
20130047029 Ikeuchi et al. Feb 2013 A1
20130091102 Nayak Apr 2013 A1
20130205110 Kettner Aug 2013 A1
20130227236 Flynn et al. Aug 2013 A1
20130275391 Batwara et al. Oct 2013 A1
20130275656 Talagala et al. Oct 2013 A1
20130283058 Fiske et al. Oct 2013 A1
20130290648 Shao et al. Oct 2013 A1
20130318314 Markus et al. Nov 2013 A1
20130339303 Potter et al. Dec 2013 A1
20140052946 Kimmel Feb 2014 A1
20140068211 Fiske et al. Mar 2014 A1
20140068791 Resch Mar 2014 A1
20140089730 Watanabe et al. Mar 2014 A1
20140101361 Gschwind Apr 2014 A1
20140143517 Jin et al. May 2014 A1
20140172929 Sedayao et al. Jun 2014 A1
20140201150 Kumarasamy et al. Jul 2014 A1
20140201492 Luan Jul 2014 A1
20140215129 Kuzmin et al. Jul 2014 A1
20140220561 Sukumar et al. Aug 2014 A1
20140229131 Cohen et al. Aug 2014 A1
20140229452 Serita et al. Aug 2014 A1
20140281308 Lango et al. Sep 2014 A1
20140325115 Ramsundar et al. Oct 2014 A1
20140365719 Kuzmin et al. Dec 2014 A1
20150154418 Redberg Jun 2015 A1
20150234709 Koarashi Aug 2015 A1
20150244775 Vibhor et al. Aug 2015 A1
20150278534 Thiyagarajan et al. Oct 2015 A1
20150347295 Ihm Dec 2015 A1
20160019114 Han et al. Jan 2016 A1
20160026397 Nishikido et al. Jan 2016 A1
20160077964 Chang Mar 2016 A1
20160098191 Golden et al. Apr 2016 A1
20160098199 Golden et al. Apr 2016 A1
20160182542 Staniford Jun 2016 A1
20160248631 Duchesneau Aug 2016 A1
20170262202 Seo Sep 2017 A1
20180054454 Astigarraga et al. Feb 2018 A1
20180081562 Vasudevan Mar 2018 A1
20190220315 Vallala et al. Jul 2019 A1
20200034560 Natanzon et al. Jan 2020 A1
20200326871 Wu et al. Oct 2020 A1
20210360833 Alissa et al. Nov 2021 A1
Foreign Referenced Citations (14)
Number Date Country
103370685 Oct 2013 CN
103370686 Oct 2013 CN
104025010 Nov 2016 CN
3066610 Sep 2016 EP
3082047 Oct 2016 EP
3120235 Jan 2017 EP
2007087036 Apr 2007 JP
2007094472 Apr 2007 JP
2008250667 Oct 2008 JP
2010211681 Sep 2010 JP
1995002349 Jan 1995 WO
1999013403 Mar 1999 WO
2008102347 Aug 2008 WO
2010071655 Jun 2010 WO
Non-Patent Literature Citations (5)
Entry
Hwang et al., “RAID-x: A New Distributed Disk Array for I/O-Centric Cluster Computing”, Proceedings of The Ninth International Symposium On High-performance Distributed Computing, Aug. 2000, pp. 279-286, The Ninth International Symposium on High-Performance Distributed Computing, IEEE Computer Society, Los Alamitos, CA.
Microsoft Corporation, “Fundamentals of Garbage Collection”, Retrieved Aug. 30, 2013 via the WayBack Machine, 11 pages.
Microsoft Corporation, “GCSettings.IsServerGC Property”, Retrieved Oct. 27, 2013 via the WayBack Machine, 3 pages.
Stalzer, “FlashBlades: System Architecture and Applications”, Proceedings of the 2nd Workshop on Architectures and Systems for Big Data, Jun. 2012, pp. 10-14, Association for Computing Machinery, New York, NY.
Storer et al., “Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage”, FAST'08: Proceedings of the 6th USENIX Conference on File and Storage Technologies, Article No. 1, Feb. 2008, pp. 1-16, USENIX Association, Berkeley, CA.
Related Publications (1)
Number Date Country
20230014142 A1 Jan 2023 US
Continuations (4)
Number Date Country
Parent 17025036 Sep 2020 US
Child 17936484 US
Parent 16034445 Jul 2018 US
Child 17025036 US
Parent 15420198 Jan 2017 US
Child 16034445 US
Parent 14624752 Feb 2015 US
Child 15420198 US