Batch data deletion

Abstract

A method for distributed file deletion or truncation, performed by a storage system, is provided. The method includes determining, by an authority owning an inode of a file, which authorities own data portions to be deleted, responsive to a request for the file deletion or truncation. The method includes recording, by the authority owning the inode, the file deletion or truncation in a first memory, and deleting, in background by the authorities that own the data portions to be deleted, the data portions in one of a first memory or a second memory. A system and computer readable media are also provided.

Description

BACKGROUND

Solid-state memory, such as flash, is currently in use in solid-state drives (SSD) to augment or replace conventional hard disk drives (HDD), writable CD (compact disk) or writable DVD (digital versatile disk) drives, collectively known as spinning media, and tape drives, for storage of large amounts of data. Flash and other solid-state memories have characteristics that differ from spinning media. Yet, many solid-state drives are designed to conform to hard disk drive standards for compatibility reasons, which makes it difficult to provide enhanced features or take advantage of unique aspects of flash and other solid-state memory.

When deleting or truncating a file, acknowledgement of the deletion or truncation as soon as possible to the requesting client is desirable. It is undesirable to have to find all of the “to be deleted” portions of a file, which may be distributed across a storage cluster or storage system. Under this mechanism the system must wait until after each of the pieces to be deleted is acknowledged, and only then report the deletion or truncation to the requesting client. It is within this context that the embodiments arise.

SUMMARY

In some embodiments, a method for distributed file deletion or truncation, performed by a storage system, is provided. The method includes determining, by an authority owning an inode of a file, which authorities own data portions to be deleted, responsive to a request for the file deletion or truncation. The method includes recording, by the authority owning the inode, the file deletion or truncation in a first memory, and deleting, in background by the authorities that own the data portions to be deleted, the data portions in a second memory. In some embodiments, the method operations may be embodied as code on a computer readable medium.

In some embodiments, a storage system with distributed file deletion and truncation is provided. The storage system includes a first memory, distributed in the storage system and having RAM (random-access memory) configured to hold metadata and a second memory, distributed in the storage system and having solid-state storage memory, configured to hold data and metadata. The storage system includes a plurality of processors, configured to record in the first memory, by an authority that owns an inode of a file, deletion of the file, responsive to a request for the deletion of the file. The plurality of processors is further configured to record in the first memory, by an authority that owns an inode of a further file, truncation of the further file, responsive to a request for the truncation of the further file. The plurality of processors is further configured to have a plurality of authorities, each authority of the plurality of authorities owns a data portion to be deleted, the plurality of processors further configured to delete the data portions in the second memory, in background, resulting from the request for the deletion of the file and the request for the truncation of the further file.

Other aspects and advantages of the embodiments will become apparent from the following detailed description taken in conjunction with the accompanying drawings which illustrate, by way of example, the principles of the described embodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

The described embodiments and the advantages thereof may best be understood by reference to the following description taken in conjunction with the accompanying drawings. These drawings in no way limit any changes in form and detail that may be made to the described embodiments by one skilled in the art without departing from the spirit and scope of the described embodiments.

FIG. 1 is a perspective view of a storage cluster with multiple storage nodes and internal storage coupled to each storage node to provide network attached storage, in accordance with some embodiments.

FIG. 2 is a block diagram showing an interconnect switch coupling multiple storage nodes in accordance with some embodiments.

FIG. 3 is a multiple level block diagram, showing contents of a storage node and contents of one of the non-volatile solid state storage units in accordance with some embodiments.

FIG. 4 shows a storage server environment, which uses embodiments of the storage nodes and storage units of FIGS. 1-3 in accordance with some embodiments.

FIG. 5 is a blade hardware block diagram, showing a control plane, compute and storage planes, and authorities interacting with underlying physical resources, in accordance with some embodiments.

FIG. 6 is a system and action diagram showing distributed file deletion in a storage system, in accordance with some embodiments.

FIG. 7 is a system and action diagram showing distributed file truncation in a storage system, in accordance with some embodiments.

FIG. 8 is a flow diagram of a method for distributed file deletion and truncation, which can be practiced in the storage cluster of FIGS. 1-7 and further storage systems, in accordance with some embodiments.

FIG. 9 is an illustration showing an exemplary computing device which may implement the embodiments described herein.

DETAILED DESCRIPTION

A storage cluster, and more generally a storage system, described herein can perform distributed file deletion and/or distributed file truncation. Various pieces of a file, i.e., data that is distributed throughout the storage cluster or storage system, are deleted by various background tasks, speeding up the acknowledgment of deletion or truncation of the file to the requesting client. This acknowledgment does not have to wait until the pieces or portions of the file are physically deleted. Thus, the system improves response time or latency from when a client makes a request to delete or truncate a file, until the storage system acknowledges the file deletion or truncation.

Different pieces of data, or portions of a file, are owned and recorded by authorities under inodes, in storage nodes in the storage system. The authority that owns the inode for the file also has responsibility for file extents for that file in some embodiments. When a client deletes a file (i.e., requests a file be deleted), the request is routed to the authority that is the owner of the inode for the file. The authority that owns the inode for the file records the deletion of the inode as a single record in NVRAM (non-volatile random-access memory), and records a “to do” cleanup record (e.g., a work or cleanup task list or other data structure, such as a record of cleanup tasks) in NVRAM. Once the deletion of the inode is recorded as the single record in NVRAM and the “to do” cleanup is recorded in NVRAM, the authority that owns the inode for the file reports back to the client acknowledging the file deletion. In the background, cleanup work is picked up in batches shared with all of the authorities that might have pieces of each file. Once the authority that owns the inode for the file being deleted confirms that all of the cleanup is completed, that authority deletes the “to do” cleanup task record. Initially, the fact that the inode is deleted is recorded in NVRAM, and then this record is flushed (e.g., within 30 seconds, in some embodiments) to flash (i.e., flash memory in a storage unit), as driven by the processor of the storage node.

When a client truncates a file (i.e., requests a file be truncated), the request is routed to the authority that is the owner of the inode for the file. That authority sends or broadcasts the messages to all authorities that have ownership of pieces of data or portions of the file (e.g., ranges of segments), and each receiving authority sends a single message to NVRAM. Each NVRAM record behaves logically like a write of all zeros. Any read from such an authority will receive back all zeros reported by that authority. An example flow, for some embodiments, is as follows:

• • send message to all authorities that may have data for a file
  • each receiving authority writes a truncation record to NVRAM
  • when all responses have been gathered from receiving authorities, the authority that is the owner of the inode for the file acknowledges the truncation operation to the client
  • after such acknowledgment, a return of all zeros is guaranteed to any read of the truncated portion of the file
  • cleaning up data is handled the same way as if an overwrite, i.e., once NVRAM is flushed to flash, a cleanup operation overwrites the flash with zeros.

The embodiments below describe a storage cluster that stores user data, such as user data originating from one or more user or client systems or other sources external to the storage cluster. The storage cluster distributes user data across storage nodes housed within a chassis, using erasure coding and redundant copies of metadata. Erasure coding refers to a method of data protection or reconstruction in which data is stored across a set of different locations, such as disks, storage nodes or geographic locations. Flash memory is one type of solid-state memory that may be integrated with the embodiments, although the embodiments may be extended to other types of solid-state memory or other storage medium, including non-solid state memory. Control of storage locations and workloads are distributed across the storage locations in a clustered peer-to-peer system. Tasks such as mediating communications between the various storage nodes, detecting when a storage node has become unavailable, and balancing I/Os (inputs and outputs) across the various storage nodes, are all handled on a distributed basis. Data is laid out or distributed across multiple storage nodes in data fragments or stripes that support data recovery in some embodiments. Ownership of data can be reassigned within a cluster, independent of input and output patterns. This architecture described in more detail below allows a storage node in the cluster to fail, with the system remaining operational, since the data can be reconstructed from other storage nodes and thus remain available for input and output operations. In various embodiments, a storage node may be referred to as a cluster node, a blade, or a server. Various system aspects are discussed below with reference to FIGS. 1-5 and 9. Distributed file deletion and truncation are described with reference to FIGS. 6-8.

The storage cluster is contained within a chassis, i.e., an enclosure housing one or more storage nodes. A mechanism to provide power to each storage node, such as a power distribution bus, and a communication mechanism, such as a communication bus that enables communication between the storage nodes are included within the chassis. The storage cluster can run as an independent system in one location according to some embodiments. In one embodiment, a chassis contains at least two instances of both the power distribution and the communication bus which may be enabled or disabled independently. The internal communication bus may be an Ethernet bus, however, other technologies such as Peripheral Component Interconnect (PCI) Express, InfiniBand, and others, are equally suitable. The chassis provides a port for an external communication bus for enabling communication between multiple chassis, directly or through a switch, and with client systems. The external communication may use a technology such as Ethernet, InfiniBand, Fibre Channel, etc. In some embodiments, the external communication bus uses different communication bus technologies for inter-chassis and client communication. If a switch is deployed within or between chassis, the switch may act as a translation between multiple protocols or technologies. When multiple chassis are connected to define a storage cluster, the storage cluster may be accessed by a client using either proprietary interfaces or standard interfaces such as network file system (NFS), common internet file system (CIFS), small computer system interface (SCSI) or hypertext transfer protocol (HTTP). Translation from the client protocol may occur at the switch, chassis external communication bus or within each storage node.

Each storage node may be one or more storage servers and each storage server is connected to one or more non-volatile solid state memory units, which may be referred to as storage units or storage devices. One embodiment includes a single storage server in each storage node and between one to eight non-volatile solid state memory units, however this one example is not meant to be limiting. The storage server may include a processor, dynamic random access memory (DRAM) and interfaces for the internal communication bus and power distribution for each of the power buses. Inside the storage node, the interfaces and storage unit share a communication bus, e.g., PCI Express, in some embodiments. The non-volatile solid state memory units may directly access the internal communication bus interface through a storage node communication bus, or request the storage node to access the bus interface. The non-volatile solid state memory unit contains an embedded central processing unit (CPU), solid state storage controller, and a quantity of solid state mass storage, e.g., between 2-32 terabytes (TB) in some embodiments. An embedded volatile storage medium, such as DRAM, and an energy reserve apparatus are included in the non-volatile solid state memory unit. In some embodiments, the energy reserve apparatus is a capacitor, super-capacitor, or battery that enables transferring a subset of DRAM contents to a stable storage medium in the case of power loss. In some embodiments, the non-volatile solid state memory unit is constructed with a storage class memory, such as phase change or magnetoresistive random access memory (MRAM) that substitutes for DRAM and enables a reduced power hold-up apparatus.

One of many features of the storage nodes and non-volatile solid state storage is the ability to proactively rebuild data in a storage cluster. The storage nodes and non-volatile solid state storage can determine when a storage node or non-volatile solid state storage in the storage cluster is unreachable, independent of whether there is an attempt to read data involving that storage node or non-volatile solid state storage. The storage nodes and non-volatile solid state storage then cooperate to recover and rebuild the data in at least partially new locations. This constitutes a proactive rebuild, in that the system rebuilds data without waiting until the data is needed for a read access initiated from a client system employing the storage cluster. These and further details of the storage memory and operation thereof are discussed below.

FIG. 1 is a perspective view of a storage cluster 160, with multiple storage nodes 150 and internal solid-state memory coupled to each storage node to provide network attached storage or storage area network, in accordance with some embodiments. A network attached storage, storage area network, or a storage cluster, or other storage memory, could include one or more storage clusters 160, each having one or more storage nodes 150, in a flexible and reconfigurable arrangement of both the physical components and the amount of storage memory provided thereby. The storage cluster 160 is designed to fit in a rack, and one or more racks can be set up and populated as desired for the storage memory. The storage cluster 160 has a chassis 138 having multiple slots 142. It should be appreciated that chassis 138 may be referred to as a housing, enclosure, or rack unit. In one embodiment, the chassis 138 has fourteen slots 142, although other numbers of slots are readily devised. For example, some embodiments have four slots, eight slots, sixteen slots, thirty-two slots, or other suitable number of slots. Each slot 142 can accommodate one storage node 150 in some embodiments. Chassis 138 includes flaps 148 that can be utilized to mount the chassis 138 on a rack. Fans 144 provide air circulation for cooling of the storage nodes 150 and components thereof, although other cooling components could be used, or an embodiment could be devised without cooling components. A switch fabric 146 couples storage nodes 150 within chassis 138 together and to a network for communication to the memory. In an embodiment depicted in FIG. 1, the slots 142 to the left of the switch fabric 146 and fans 144 are shown occupied by storage nodes 150, while the slots 142 to the right of the switch fabric 146 and fans 144 are empty and available for insertion of storage node 150 for illustrative purposes. This configuration is one example, and one or more storage nodes 150 could occupy the slots 142 in various further arrangements. The storage node arrangements need not be sequential or adjacent in some embodiments. Storage nodes 150 are hot pluggable, meaning that a storage node 150 can be inserted into a slot 142 in the chassis 138, or removed from a slot 142, without stopping or powering down the system. Upon insertion or removal of storage node 150 from slot 142, the system automatically reconfigures in order to recognize and adapt to the change. Reconfiguration, in some embodiments, includes restoring redundancy and/or rebalancing data or load.

Each storage node 150 can have multiple components. In the embodiment shown here, the storage node 150 includes a printed circuit board 158 populated by a CPU 156, i.e., processor, a memory 154 coupled to the CPU 156, and a non-volatile solid state storage 152 coupled to the CPU 156, although other mountings and/or components could be used in further embodiments. The memory 154 has instructions which are executed by the CPU 156 and/or data operated on by the CPU 156. As further explained below, the non-volatile solid state storage 152 includes flash or, in further embodiments, other types of solid-state memory.

Referring to FIG. 1, storage cluster 160 is scalable, meaning that storage capacity with non-uniform storage sizes is readily added, as described above. One or more storage nodes 150 can be plugged into or removed from each chassis and the storage cluster self-configures in some embodiments. Plug-in storage nodes 150, whether installed in a chassis as delivered or later added, can have different sizes. For example, in one embodiment a storage node 150 can have any multiple of 4 TB, e.g., 8 TB, 12 TB, 16 TB, 32 TB, etc. In further embodiments, a storage node 150 could have any multiple of other storage amounts or capacities. Storage capacity of each storage node 150 is broadcast, and influences decisions of how to stripe the data. For maximum storage efficiency, an embodiment can self-configure as wide as possible in the stripe, subject to a predetermined requirement of continued operation with loss of up to one, or up to two, non-volatile solid state storage units 152 or storage nodes 150 within the chassis.

FIG. 2 is a block diagram showing a communications interconnect 170 and power distribution bus 172 coupling multiple storage nodes 150. Referring back to FIG. 1, the communications interconnect 170 can be included in or implemented with the switch fabric 146 in some embodiments. Where multiple storage clusters 160 occupy a rack, the communications interconnect 170 can be included in or implemented with a top of rack switch, in some embodiments. As illustrated in FIG. 2, storage cluster 160 is enclosed within a single chassis 138. External port 176 is coupled to storage nodes 150 through communications interconnect 170, while external port 174 is coupled directly to a storage node. External power port 178 is coupled to power distribution bus 172. Storage nodes 150 may include varying amounts and differing capacities of non-volatile solid state storage 152 as described with reference to FIG. 1. In addition, one or more storage nodes 150 may be a compute only storage node as illustrated in FIG. 2. Authorities 168 are implemented on the non-volatile solid state storages 152, for example as lists or other data structures stored in memory. In some embodiments the authorities are stored within the non-volatile solid state storage 152 and supported by software executing on a controller or other processor of the non-volatile solid state storage 152. In a further embodiment, authorities 168 are implemented on the storage nodes 150, for example as lists or other data structures stored in the memory 154 and supported by software executing on the CPU 156 of the storage node 150. Authorities 168 control how and where data is stored in the non-volatile solid state storages 152 in some embodiments. This control assists in determining which type of erasure coding scheme is applied to the data, and which storage nodes 150 have which portions of the data. Each authority 168 may be assigned to a non-volatile solid state storage 152. Each authority may control a range of inode numbers, segment numbers, or other data identifiers which are assigned to data by a file system, by the storage nodes 150, or by the non-volatile solid state storage 152, in various embodiments.

Every piece of data, and every piece of metadata, has redundancy in the system in some embodiments. In addition, every piece of data and every piece of metadata has an owner, which may be referred to as an authority. If that authority is unreachable, for example through failure of a storage node, there is a plan of succession for how to find that data or that metadata. In various embodiments, there are redundant copies of authorities 168. Authorities 168 have a relationship to storage nodes 150 and non-volatile solid state storage 152 in some embodiments. Each authority 168, covering a range of data segment numbers or other identifiers of the data, may be assigned to a specific non-volatile solid state storage 152. In some embodiments the authorities 168 for all of such ranges are distributed over the non-volatile solid state storages 152 of a storage cluster. Each storage node 150 has a network port that provides access to the non-volatile solid state storage(s) 152 of that storage node 150. Data can be stored in a segment, which is associated with a segment number and that segment number is an indirection for a configuration of a RAID (redundant array of independent disks) stripe in some embodiments. The assignment and use of the authorities 168 thus establishes an indirection to data. Indirection may be referred to as the ability to reference data indirectly, in this case via an authority 168, in accordance with some embodiments. A segment identifies a set of non-volatile solid state storage 152 and a local identifier into the set of non-volatile solid state storage 152 that may contain data. In some embodiments, the local identifier is an offset into the device and may be reused sequentially by multiple segments. In other embodiments the local identifier is unique for a specific segment and never reused. The offsets in the non-volatile solid state storage 152 are applied to locating data for writing to or reading from the non-volatile solid state storage 152 (in the form of a RAID stripe). Data is striped across multiple units of non-volatile solid state storage 152, which may include or be different from the non-volatile solid state storage 152 having the authority 168 for a particular data segment.

If there is a change in where a particular segment of data is located, e.g., during a data move or a data reconstruction, the authority 168 for that data segment should be consulted, at that non-volatile solid state storage 152 or storage node 150 having that authority 168. In order to locate a particular piece of data, embodiments calculate a hash value for a data segment or apply an inode number or a data segment number. The output of this operation points to a non-volatile solid state storage 152 having the authority 168 for that particular piece of data. In some embodiments there are two stages to this operation. The first stage maps an entity identifier (ID), e.g., a segment number, inode number, or directory number to an authority identifier. This mapping may include a calculation such as a hash or a bit mask. The second stage is mapping the authority identifier to a particular non-volatile solid state storage 152, which may be done through an explicit mapping. The operation is repeatable, so that when the calculation is performed, the result of the calculation repeatably and reliably points to a particular non-volatile solid state storage 152 having that authority 168. The operation may include the set of reachable storage nodes as input. If the set of reachable non-volatile solid state storage units changes the optimal set changes. In some embodiments, the persisted value is the current assignment (which is always true) and the calculated value is the target assignment the cluster will attempt to reconfigure towards. This calculation may be used to determine the optimal non-volatile solid state storage 152 for an authority in the presence of a set of non-volatile solid state storage 152 that are reachable and constitute the same cluster. The calculation also determines an ordered set of peer non-volatile solid state storage 152 that will also record the authority to non-volatile solid state storage mapping so that the authority may be determined even if the assigned non-volatile solid state storage is unreachable. A duplicate or substitute authority 168 may be consulted if a specific authority 168 is unavailable in some embodiments.

With reference to FIGS. 1 and 2, two of the many tasks of the CPU 156 on a storage node 150 are to break up write data, and reassemble read data. When the system has determined that data is to be written, the authority 168 for that data is located as above. When the segment ID for data is already determined the request to write is forwarded to the non-volatile solid state storage 152 currently determined to be the host of the authority 168 determined from the segment. The host CPU 156 of the storage node 150, on which the non-volatile solid state storage 152 and corresponding authority 168 reside, then breaks up or shards the data and transmits the data out to various non-volatile solid state storage 152. The transmitted data is written as a data stripe in accordance with an erasure coding scheme. In some embodiments, data is requested to be pulled, and in other embodiments, data is pushed. In reverse, when data is read, the authority 168 for the segment ID containing the data is located as described above. The host CPU 156 of the storage node 150 on which the non-volatile solid state storage 152 and corresponding authority 168 reside requests the data from the non-volatile solid state storage and corresponding storage nodes pointed to by the authority. In some embodiments the data is read from flash storage as a data stripe. The host CPU 156 of storage node 150 then reassembles the read data, correcting any errors (if present) according to the appropriate erasure coding scheme, and forwards the reassembled data to the network. In further embodiments, some or all of these tasks can be handled in the non-volatile solid state storage 152. In some embodiments, the segment host requests the data be sent to storage node 150 by requesting pages from storage and then sending the data to the storage node making the original request.

In some systems, for example in UNIX-style file systems, data is handled with an index node or inode, which specifies a data structure that represents an object in a file system. The object could be a file or a directory, for example. Metadata may accompany the object, as attributes such as permission data and a creation timestamp, among other attributes. A segment number could be assigned to all or a portion of such an object in a file system. In other systems, data segments are handled with a segment number assigned elsewhere. For purposes of discussion, the unit of distribution is an entity, and an entity can be a file, a directory or a segment. That is, entities are units of data or metadata stored by a storage system. Entities are grouped into sets called authorities. Each authority has an authority owner, which is a storage node that has the exclusive right to update the entities in the authority. In other words, a storage node contains the authority, and that the authority, in turn, contains entities.

A segment is a logical container of data in accordance with some embodiments. A segment is an address space between medium address space and physical flash locations, i.e., the data segment number, are in this address space. Segments may also contain meta-data, which enable data redundancy to be restored (rewritten to different flash locations or devices) without the involvement of higher level software. In one embodiment, an internal format of a segment contains client data and medium mappings to determine the position of that data. Each data segment is protected, e.g., from memory and other failures, by breaking the segment into a number of data and parity shards, where applicable. The data and parity shards are distributed, i.e., striped, across non-volatile solid state storage 152 coupled to the host CPUs 156 (See FIG. 5) in accordance with an erasure coding scheme. Usage of the term segments refers to the container and its place in the address space of segments in some embodiments. Usage of the term stripe refers to the same set of shards as a segment and includes how the shards are distributed along with redundancy or parity information in accordance with some embodiments.

A series of address-space transformations takes place across an entire storage system. At the top are the directory entries (file names) which link to an inode. Modes point into medium address space, where data is logically stored. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Medium addresses may be mapped through a series of indirect mediums to spread the load of large files, or implement data services like deduplication or snapshots. Segment addresses are then translated into physical flash locations. Physical flash locations have an address range bounded by the amount of flash in the system in accordance with some embodiments. Medium addresses and segment addresses are logical containers, and in some embodiments use a 128 bit or larger identifier so as to be practically infinite, with a likelihood of reuse calculated as longer than the expected life of the system. Addresses from logical containers are allocated in a hierarchical fashion in some embodiments. Initially, each non-volatile solid state storage unit 152 may be assigned a range of address space. Within this assigned range, the non-volatile solid state storage 152 is able to allocate addresses without synchronization with other non-volatile solid state storage 152.

Data and metadata is stored by a set of underlying storage layouts that are optimized for varying workload patterns and storage devices. These layouts incorporate multiple redundancy schemes, compression formats and index algorithms. Some of these layouts store information about authorities and authority masters, while others store file metadata and file data. The redundancy schemes include error correction codes that tolerate corrupted bits within a single storage device (such as a NAND flash chip), erasure codes that tolerate the failure of multiple storage nodes, and replication schemes that tolerate data center or regional failures. In some embodiments, low density parity check (LDPC) code is used within a single storage unit. Reed-Solomon encoding is used within a storage cluster, and mirroring is used within a storage grid in some embodiments. Metadata may be stored using an ordered log structured index (such as a Log Structured Merge Tree), and large data may not be stored in a log structured layout.

In order to maintain consistency across multiple copies of an entity, the storage nodes agree implicitly on two things through calculations: (1) the authority that contains the entity, and (2) the storage node that contains the authority. The assignment of entities to authorities can be done by pseudo randomly assigning entities to authorities, by splitting entities into ranges based upon an externally produced key, or by placing a single entity into each authority. Examples of pseudorandom schemes are linear hashing and the Replication Under Scalable Hashing (RUSH) family of hashes, including Controlled Replication Under Scalable Hashing (CRUSH). In some embodiments, pseudo-random assignment is utilized only for assigning authorities to nodes because the set of nodes can change. The set of authorities cannot change so any subjective function may be applied in these embodiments. Some placement schemes automatically place authorities on storage nodes, while other placement schemes rely on an explicit mapping of authorities to storage nodes. In some embodiments, a pseudorandom scheme is utilized to map from each authority to a set of candidate authority owners. A pseudorandom data distribution function related to CRUSH may assign authorities to storage nodes and create a list of where the authorities are assigned. Each storage node has a copy of the pseudorandom data distribution function, and can arrive at the same calculation for distributing, and later finding or locating an authority. Each of the pseudorandom schemes requires the reachable set of storage nodes as input in some embodiments in order to conclude the same target nodes. Once an entity has been placed in an authority, the entity may be stored on physical devices so that no expected failure will lead to unexpected data loss. In some embodiments, rebalancing algorithms attempt to store the copies of all entities within an authority in the same layout and on the same set of machines.

Examples of expected failures include device failures, stolen machines, datacenter fires, and regional disasters, such as nuclear or geological events. Different failures lead to different levels of acceptable data loss. In some embodiments, a stolen storage node impacts neither the security nor the reliability of the system, while depending on system configuration, a regional event could lead to no loss of data, a few seconds or minutes of lost updates, or even complete data loss.

In the embodiments, the placement of data for storage redundancy is independent of the placement of authorities for data consistency. In some embodiments, storage nodes that contain authorities do not contain any persistent storage. Instead, the storage nodes are connected to non-volatile solid state storage units that do not contain authorities. The communications interconnect between storage nodes and non-volatile solid state storage units consists of multiple communication technologies and has non-uniform performance and fault tolerance characteristics. In some embodiments, as mentioned above, non-volatile solid state storage units are connected to storage nodes via PCI express, storage nodes are connected together within a single chassis using Ethernet backplane, and chassis are connected together to form a storage cluster. Storage clusters are connected to clients using Ethernet or fiber channel in some embodiments. If multiple storage clusters are configured into a storage grid, the multiple storage clusters are connected using the Internet or other long-distance networking links, such as a “metro scale” link or private link that does not traverse the internet.

Authority owners have the exclusive right to modify entities, to migrate entities from one non-volatile solid state storage unit to another non-volatile solid state storage unit, and to add and remove copies of entities. This allows for maintaining the redundancy of the underlying data. When an authority owner fails, is going to be decommissioned, or is overloaded, the authority is transferred to a new storage node. Transient failures make it non-trivial to ensure that all non-faulty machines agree upon the new authority location. The ambiguity that arises due to transient failures can be achieved automatically by a consensus protocol such as Paxos, hot-warm failover schemes, via manual intervention by a remote system administrator, or by a local hardware administrator (such as by physically removing the failed machine from the cluster, or pressing a button on the failed machine). In some embodiments, a consensus protocol is used, and failover is automatic. If too many failures or replication events occur in too short a time period, the system goes into a self-preservation mode and halts replication and data movement activities until an administrator intervenes in accordance with some embodiments.

As authorities are transferred between storage nodes and authority owners update entities in their authorities, the system transfers messages between the storage nodes and non-volatile solid state storage units. With regard to persistent messages, messages that have different purposes are of different types. Depending on the type of the message, the system maintains different ordering and durability guarantees. As the persistent messages are being processed, the messages are temporarily stored in multiple durable and non-durable storage hardware technologies. In some embodiments, messages are stored in RAM, NVRAM and on NAND flash devices, and a variety of protocols are used in order to make efficient use of each storage medium. Latency-sensitive client requests may be persisted in replicated NVRAM, and then later NAND, while background rebalancing operations are persisted directly to NAND.

Persistent messages are persistently stored prior to being transmitted. This allows the system to continue to serve client requests despite failures and component replacement. Although many hardware components contain unique identifiers that are visible to system administrators, manufacturer, hardware supply chain and ongoing monitoring quality control infrastructure, applications running on top of the infrastructure address virtualize addresses. These virtualized addresses do not change over the lifetime of the storage system, regardless of component failures and replacements. This allows each component of the storage system to be replaced over time without reconfiguration or disruptions of client request processing.

In some embodiments, the virtualized addresses are stored with sufficient redundancy. A continuous monitoring system correlates hardware and software status and the hardware identifiers. This allows detection and prediction of failures due to faulty components and manufacturing details. The monitoring system also enables the proactive transfer of authorities and entities away from impacted devices before failure occurs by removing the component from the critical path in some embodiments.

FIG. 3 is a multiple level block diagram, showing contents of a storage node 150 and contents of a non-volatile solid state storage 152 of the storage node 150. Data is communicated to and from the storage node 150 by a network interface controller (NIC) 202 in some embodiments. Each storage node 150 has a CPU 156, and one or more non-volatile solid state storage 152, as discussed above. Moving down one level in FIG. 3, each non-volatile solid state storage 152 has a relatively fast non-volatile solid state memory, such as nonvolatile random access memory (NVRAM) 204, and flash memory 206. In some embodiments, NVRAM 204 may be a component that does not require program/erase cycles (DRAM, MRAM, PCM), and can be a memory that can support being written vastly more often than the memory is read from. Moving down another level in FIG. 3, the NVRAM 204 is implemented in one embodiment as high speed volatile memory, such as dynamic random access memory (DRAM) 216, backed up by energy reserve 218. Energy reserve 218 provides sufficient electrical power to keep the DRAM 216 powered long enough for contents to be transferred to the flash memory 206 in the event of power failure. In some embodiments, energy reserve 218 is a capacitor, super-capacitor, battery, or other device, that supplies a suitable supply of energy sufficient to enable the transfer of the contents of DRAM 216 to a stable storage medium in the case of power loss. The flash memory 206 is implemented as multiple flash dies 222, which may be referred to as packages of flash dies 222 or an array of flash dies 222. It should be appreciated that the flash dies 222 could be packaged in any number of ways, with a single die per package, multiple dies per package (i.e. multichip packages), in hybrid packages, as bare dies on a printed circuit board or other substrate, as encapsulated dies, etc. In the embodiment shown, the non-volatile solid state storage 152 has a controller 212 or other processor, and an input output (I/O) port 210 coupled to the controller 212. I/O port 210 is coupled to the CPU 156 and/or the network interface controller 202 of the flash storage node 150. Flash input output (I/O) port 220 is coupled to the flash dies 222, and a direct memory access unit (DMA) 214 is coupled to the controller 212, the DRAM 216 and the flash dies 222. In the embodiment shown, the I/O port 210, controller 212, DMA unit 214 and flash I/O port 220 are implemented on a programmable logic device (PLD) 208, e.g., a field programmable gate array (FPGA). In this embodiment, each flash die 222 has pages, organized as sixteen kB (kilobyte) pages 224, and a register 226 through which data can be written to or read from the flash die 222. In further embodiments, other types of solid-state memory are used in place of, or in addition to flash memory illustrated within flash die 222.

Storage clusters 160, in various embodiments as disclosed herein, can be contrasted with storage arrays in general. The storage nodes 150 are part of a collection that creates the storage cluster 160. Each storage node 150 owns a slice of data and computing required to provide the data. Multiple storage nodes 150 cooperate to store and retrieve the data. Storage memory or storage devices, as used in storage arrays in general, are less involved with processing and manipulating the data. Storage memory or storage devices in a storage array receive commands to read, write, or erase data. The storage memory or storage devices in a storage array are not aware of a larger system in which they are embedded, or what the data means. Storage memory or storage devices in storage arrays can include various types of storage memory, such as RAM, solid state drives, hard disk drives, etc. The storage units 152 described herein have multiple interfaces active simultaneously and serving multiple purposes. In some embodiments, some of the functionality of a storage node 150 is shifted into a storage unit 152, transforming the storage unit 152 into a combination of storage unit 152 and storage node 150. Placing computing (relative to storage data) into the storage unit 152 places this computing closer to the data itself. The various system embodiments have a hierarchy of storage node layers with different capabilities. By contrast, in a storage array, a controller owns and knows everything about all of the data that the controller manages in a shelf or storage devices. In a storage cluster 160, as described herein, multiple controllers in multiple storage units 152 and/or storage nodes 150 cooperate in various ways (e.g., for erasure coding, data sharding, metadata communication and redundancy, storage capacity expansion or contraction, data recovery, and so on).

FIG. 4 shows a storage server environment, which uses embodiments of the storage nodes 150 and storage units 152 of FIGS. 1-3. In this version, each storage unit 152 has a processor such as controller 212 (see FIG. 3), an FPGA (field programmable gate array), flash memory 206, and NVRAM 204 (which is super-capacitor backed DRAM 216, see FIGS. 2 and 3) on a PCIe (peripheral component interconnect express) board in a chassis 138 (see FIG. 1). The storage unit 152 may be implemented as a single board containing storage, and may be the largest tolerable failure domain inside the chassis. In some embodiments, up to two storage units 152 may fail and the device will continue with no data loss.

The physical storage is divided into named regions based on application usage in some embodiments. The NVRAM 204 is a contiguous block of reserved memory in the storage unit 152 DRAM 216, and is backed by NAND flash. NVRAM 204 is logically divided into multiple memory regions written for two as spool (e.g., spool region). Space within the NVRAM 204 spools is managed by each authority 512 independently. Each device provides an amount of storage space to each authority 512. That authority 512 further manages lifetimes and allocations within that space. Examples of a spool include distributed transactions or notions. When the primary power to a storage unit 152 fails, onboard super-capacitors provide a short duration of power hold up. During this holdup interval, the contents of the NVRAM 204 are flushed to flash memory 206. On the next power-on, the contents of the NVRAM 204 are recovered from the flash memory 206.

As for the storage unit controller, the responsibility of the logical “controller” is distributed across each of the blades containing authorities 512. This distribution of logical control is shown in FIG. 4 as a host controller 402, mid-tier controller 404 and storage unit controller(s) 406. Management of the control plane and the storage plane are treated independently, although parts may be physically co-located on the same blade. Each authority 512 effectively serves as an independent controller. Each authority 512 provides its own data and metadata structures, its own background workers, and maintains its own lifecycle.

FIG. 5 is a blade 502 hardware block diagram, showing a control plane 504, compute and storage planes 506, 508, and authorities 512 interacting with underlying physical resources, using embodiments of the storage nodes 150 and storage units 152 of FIGS. 1-3 in the storage server environment of FIG. 4. The control plane 504 is partitioned into a number of authorities 512 which can use the compute resources in the compute plane 506 to run on any of the blades 502. The storage plane 508 is partitioned into a set of devices, each of which provides access to flash 206 and NVRAM 204 resources.

In the compute and storage planes 506, 508 of FIG. 5, the authorities 512 interact with the underlying physical resources (i.e., devices). From the point of view of an authority 512, its resources are striped over all of the physical devices. From the point of view of a device, it provides resources to all authorities 512, irrespective of where the authorities happen to run.

Each authority 512 has allocated or has been allocated one or more partitions 510 of storage memory in the storage units 152, e.g. partitions 510 in flash memory 206 and NVRAM 204. Each authority 512 uses those allocated partitions 510 that belong to it, for writing or reading user data. Authorities can be associated with differing amounts of physical storage of the system. For example, one authority 512 could have a larger number of partitions 510 or larger sized partitions 510 in one or more storage units 152 than one or more other authorities 512.

FIG. 6 is a system and action diagram showing distributed file deletion 606 in a storage system. In this example, the storage system is embodied in multiple blades 502, which could be installed in one or more chassis 138 as depicted in FIG. 1, as a storage cluster 160. Each blade 502 has a storage node 150 and one or more storage units 152. Each storage node 150 has a processor 602 and one or more authorities 168 as described above with reference to FIGS. 1-5. Each storage unit has a processor 604, NVRAM 204 and flash memory 206, also as described above. Distributed file deletion 606 can be embodied in further storage clusters and storage systems as readily devised in keeping with the teachings herein.

To delete a file, the client 608 sends a request 610, e.g., a request to delete the file, to the storage system. In some embodiments, the request 610 is received by one of the storage nodes 150, which determines which authority 168 is the owner of the inode for the file, and forwards the request 610 to the storage node 150 in which the inode owning authority 168 resides. Various actions are shown in FIG. 6 under the file deletion 606 process and at locations in the storage system, and denoted as foreground 612 or background 614 actions or tasks. A foreground task 612 is one that should be performed in sequence, in parallel or in line with any actions that are visible to a client 608. A background task 614 is one that can be performed immediately, or later, but which does not necessarily need to be performed prior to an action that is visible to a client 608 (e.g., an acknowledgment, reply or other response to the client 608). In action (1) (i.e., the circled “1”), the request 610 to delete a file is received, as a foreground task 614 taking place at an authority 168 in a storage node 150, i.e., the authority 168 receives the request 610 from the client 608. More specifically, the processor 602 in the storage node 150 in which the authority 168 resides receives the request 610 and performs actions on behalf of that authority 168.

In action (2), the authority 168 writes a “to do” list record, e.g. a cleanup task list record, into NVRAM 204 in a storage unit 152, as a foreground task 614. In action (3), the authority 168 records a file delete, i.e., a record of file deletion, in the NVRAM 204 in the storage unit 152, as a foreground task 614. In various embodiments, the recording of the file deletion, and the record of cleanup tasks to do, are persisted across the storage cluster, e.g., as redundant messages as described above. After recording the file delete, action (4) commences and the authority 168 that owns the inode of the file sends an acknowledgment 616, e.g., to acknowledge the file deletion, to the client 608 as a foreground task 614. In some embodiments, the authority 168 that owns the inode for the file also has responsibility for file extents (i.e., file size as recorded in metadata, and reported to a client 608 in response to a client inquiry) and records (e.g., in metadata in NVRAM 204) any changes to the file extent.

As an internal response (i.e., a response internal to the storage system) to receiving the request 610, writing the “to do” list, and/or recording the file deletion, various background tasks 612 are initiated. The authority 168 that owns the inode of the file determines the authorities 168 that own the data portions of the file to be deleted, in an action (5) as a background task 612. The inode owning authority 168 sends messages to these authorities 168, in an action (6) as a background task 612. These messages are also persisted across the storage cluster, e.g., as redundant messages as described above. The storage unit 152, or more specifically the processor 604 of that storage unit 152, flushes (i.e., transfers) the “to do” task list and the record of the file deletion (recorded in NVRAM 204 in the actions (2) and (3)) to the flash memory 206 of that storage unit 152, in the action (7), a background task 612. In some embodiments the flushing is directed by the processor(s) 602 of the storage node(s) 150, at various time intervals, or in response to recording the file deletion so as to flush the record of file deletion from NVRAM to flash memory and trigger background tasks 612.

The authorities 168 that own the data portions of the file delete the various portions of the file, in batches, in the action (8), a background task 612. In some embodiments, the creation and execution of batches or batch jobs of data deletion is triggered by the flush. There might be tens, hundreds or thousands or more pieces of the file, or pieces of further files from other file deletions or truncations, to be deleted, and these can be batched up for deletion. This can be combined with garbage collection as a background task (see action (11)), in some embodiments. These authorities 168 then confirm the deletions, in an action (9), as a background task 612. For example, the authorities 168 that perform the data deletions send messages to the authority 168 that owns the inode of the file. These messages are persisted with redundancy across the storage system as described above, for robust recovery in case of failure in the storage system. Upon and responsive to receipt of the confirmations, for example as messages from the authorities 168 performing the deletions, the authority 168 that owns the inode of the file deletes the “to do” list (e.g., the cleanup “to do” task record), in the action (10), as a background task 612. Garbage collection, the action (11), is also performed as a background task 612. In some embodiments, the background deletion of data, and garbage collection, are triggered by the flush, more specifically by the transfer of the record of file deletion. By performing actual deletion of data, and related communication, preparatory and follow-up tasks as distributed background tasks 612 (i.e., distributed among many processors and components of the storage system), the storage system can acknowledge the file deletion request to the client 608 more quickly than if these tasks were done in foreground.

FIG. 7 is a system and action diagram showing distributed file truncation 702 in a storage system. Similarly to FIG. 6, in this example the storage system is embodied in multiple blades 502 with similar features and contents, and distributed file truncation 702 can be embodied in further storage clusters and storage systems as readily devised. To truncate a file, the client 608 sends a request 704, e.g., a request to truncate the file, to the storage system. In some embodiments, the request 704 is received by one of the storage nodes 150. That storage node 150, or more specifically the processor 602 in the storage node 150, determines which authority 168 is the owner of the inode for the file, and forwards the request 704 to the storage node 150 in which the inode owning authority 168 resides. Under the file truncation 702 process, in action (1), the request 704 to truncate the file is received by the authority 168, as a foreground task 612.

Still referring to FIG. 7, in action (2), the inode owning authority 168 determines the authorities 168 that own the data portions of the file that are to be deleted in the truncation, as a foreground task 612. The inode owning authority 168 sends messages to those authorities 168, in the action (3), as a foreground task 612. These authorities 168, in various blades 502 and storage nodes 150, write truncation records to their respective NVRAMs 204 in storage units 152, in the action (4). That is, each authority 168 that receives a message for truncating a data portion writes a truncation record to NVRAM 204, as a foreground task 612. These and other messages are persisted with redundancy throughout the storage system, as described above, for robust recovery in case of failure. Each truncation record acts as an instruction to clear data in a specified range of addresses.

Continuing with FIG. 7, the authorities 168 reply, e.g., by sending messages, to the inode owning authority 168 after writing the truncation records, in the action (5), as a foreground task 612. Upon and responsive to receiving such messages from all of the responding authorities 168, the inode owning authority 168 records the file truncation in NVRAM 204 in the storage unit 152, in the action (6) as a foreground task 612. After recording the file truncation, the inode owning authority 168 sends an acknowledgment 706, e.g., a message to acknowledge the file truncation, to the client 608, as a foreground task 612. As an internal response to receiving the request 704 to truncate the file, sending and/or receiving the messages, writing the truncation records, sending and receiving messages in reply to writing truncation records, and/or recording the file truncation, various background tasks 614 are initiated. The truncation records and the record of the file truncation are flushed (i.e., transferred) to flash memory 206 in various storage units 152, in the action (8) as a background task 614, e.g., by the storage units 152 or more specifically their processors 604. In some embodiments, this flush occurs at regular time intervals, and in other embodiments flushing is triggered by the recording of the file truncation. In some embodiments, flushing the truncation record(s) triggers background deletion of data portions, and garbage collection. Authorities 168 that own the data portions to be deleted in the file truncation do the deletions, in batches, in an action (9) as a background task 612, similarly to what is done in the distributed file deletion 606. In some embodiments, as above, the creation and execution of data deletion batches or batch jobs is triggered by the flush. In some embodiments, the batches or batching combines deletion of data portions from distributed file deletion 606 and distributed file truncation 702, for multiple files and greater system efficiency. Garbage collection is performed as the action (10) in a background task 614, which is combined with the batch data deletions in some embodiments. As above, in some embodiments garbage collection is triggered by the flush. By performing actual deletion of data as a distributed background task 612, the storage system can acknowledge the file truncation request to the client 608 more quickly than if these tasks were done in foreground.

In various versions, authorities 168 push information to other authorities 168, but they could also poll, or pull information from authorities 168. Once an inode owning authority 168 receives confirmation of receipt from other authorities 168 of data deletion messages sent by the inode owning authority 168, there is robustness in the system that cleanup will be completed even if there is a system failure. The receiving authorities 168 have taken responsibility, upon sending confirmation, and will clean up the file (i.e., perform the directed, distributed data deletions), and the inode owning authority 168 can persistently mark those regions of the files as deleted. Actual deletion of the data portions proceeds in background, with garbage collection eventually performing block erases to recover memory space that is freed up by the data deletions.

FIG. 8 is a flow diagram of a method for distributed file deletion and truncation, which can be practiced in the storage cluster of FIGS. 1-7 and further embodiments thereof, and in further storage systems. Some or all of the actions in the method can be performed by various processors, such as processors in storage nodes or processors in storage units. In an action 802, a request for file deletion or truncation is received from a client. The request is received, in some embodiments, by an authority that owns the inode for the file, e.g., by the processor in a storage node in which the authority resides. In an action 804, it is determined which authorities own data portions to be deleted. This may be done by the inode owning authority, e.g., by the processor in the storage node in which that authority resides. For file deletion, this process or action can be done as a background task, since it is assumed that all data portions of the file are to be deleted. For file truncation, this process or action can be done as a foreground task, since the inode owning authority will need to wait for replies back from the authorities that will be deleting data portions, in some embodiments.

In an action 806, the file deletion or truncation is recorded. This action is done by the inode owning authority, in some embodiments. After recording the file deletion or truncation, the request is acknowledged to the client, in the action 808. This is so that the file deletion or truncation as recorded can be persisted, prior to acknowledging the client, and this persisting assures that the file deletion or truncation will be completed even if there is a failure and recovery in the system, making the acknowledgment to the client reliable. In an action 810, the data portions are deleted, in background. With the above recording of the file deletion or truncation, and the persisting, the background tasks can be picked up even if there is failure and recovery, and that is why they need not be done in foreground.

The above method and variations thereof can be performed in other storage systems besides the storage cluster with storage nodes and storage units described herein. It is the performance of deletion of data portions in background that allows the acknowledgment to be sent to the client more quickly, reducing latency, as compared to performing deletion of data portions in foreground. In variations, tasks discussed above as operating in background could be moved to foreground, at a cost of greater latency for the acknowledgment to the client. Tasks discussed above as operating in foreground could be moved to background, at a cost of reduced reliability and recoverability.

It should be appreciated that the methods described herein may be performed with a digital processing system, such as a conventional, general-purpose computer system. Special purpose computers, which are designed or programmed to perform only one function may be used in the alternative. FIG. 9 is an illustration showing an exemplary computing device which may implement the embodiments described herein. The computing device of FIG. 9 may be used to perform embodiments of the functionality for distributed file deletion and truncation in accordance with some embodiments. The computing device includes a central processing unit (CPU) 901, which is coupled through a bus 905 to a memory 903, and mass storage device 907. Mass storage device 907 represents a persistent data storage device such as a disc drive, which may be local or remote in some embodiments. The mass storage device 907 could implement a backup storage, in some embodiments. Memory 903 may include read only memory, random access memory, etc. Applications resident on the computing device may be stored on or accessed via a computer readable medium such as memory 903 or mass storage device 907 in some embodiments. Applications may also be in the form of modulated electronic signals modulated accessed via a network modem or other network interface of the computing device. It should be appreciated that CPU 901 may be embodied in a general-purpose processor, a special purpose processor, or a specially programmed logic device in some embodiments.

Display 911 is in communication with CPU 901, memory 903, and mass storage device 907, through bus 905. Display 911 is configured to display any visualization tools or reports associated with the system described herein. Input/output device 909 is coupled to bus 905 in order to communicate information in command selections to CPU 901. It should be appreciated that data to and from external devices may be communicated through the input/output device 909. CPU 901 can be defined to execute the functionality described herein to enable the functionality described with reference to FIGS. 1-8. The code embodying this functionality may be stored within memory 903 or mass storage device 907 for execution by a processor such as CPU 901 in some embodiments. The operating system on the computing device may be MS-WINDOWS™, UNIX™, LINUX™, iOS™, CentOS™, Android™, Redhat Linux™, z/OS™, or other known operating systems. It should be appreciated that the embodiments described herein may also be integrated with a virtualized computing system implemented with physical computing resources.

It should be understood that although the terms first, second, etc. may be used herein to describe various steps or calculations, these steps or calculations should not be limited by these terms. These terms are only used to distinguish one step or calculation from another. For example, a first calculation could be termed a second calculation, and, similarly, a second step could be termed a first step, without departing from the scope of this disclosure. As used herein, the term “and/or” and the “/” symbol includes any and all combinations of one or more of the associated listed items.

As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising”, “includes”, and/or “including”, when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Therefore, the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting.

It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.

With the above embodiments in mind, it should be understood that the embodiments might employ various computer-implemented operations involving data stored in computer systems. These operations are those requiring physical manipulation of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. Further, the manipulations performed are often referred to in terms, such as producing, identifying, determining, or comparing. Any of the operations described herein that form part of the embodiments are useful machine operations. The embodiments also relate to a device or an apparatus for performing these operations. The apparatus can be specially constructed for the required purpose, or the apparatus can be a general-purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general-purpose machines can be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations.

A module, an application, a layer, an agent or other method-operable entity could be implemented as hardware, firmware, or a processor executing software, or combinations thereof. It should be appreciated that, where a software-based embodiment is disclosed herein, the software can be embodied in a physical machine such as a controller. For example, a controller could include a first module and a second module. A controller could be configured to perform various actions, e.g., of a method, an application, a layer or an agent.

The embodiments can also be embodied as computer readable code on a non-transitory computer readable medium. The computer readable medium is any data storage device that can store data, which can be thereafter read by a computer system. Examples of the computer readable medium include hard drives, network attached storage (NAS), read-only memory, random-access memory, CD-ROMs, CD-Rs, CD-RWs, magnetic tapes, and other optical and non-optical data storage devices. The computer readable medium can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion. Embodiments described herein may be practiced with various computer system configurations including hand-held devices, tablets, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers and the like. The embodiments can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a wire-based or wireless network.

Although the method operations were described in a specific order, it should be understood that other operations may be performed in between described operations, described operations may be adjusted so that they occur at slightly different times or the described operations may be distributed in a system which allows the occurrence of the processing operations at various intervals associated with the processing.

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.

Various units, circuits, or other components may be described or claimed as “configured to” perform a task or tasks. In such contexts, the phrase “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, sixth paragraph, 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 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.

The foregoing description, for the purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the embodiments and its practical applications, to thereby enable others skilled in the art to best utilize the embodiments and various modifications as may be suited to the particular use contemplated. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.

Claims

1. A method, comprising: determining which data structures own data portions to be deleted, wherein the data structures are configured to own data portions of further files associated with inodes owned by other data structures;recording, by a data structure owning an inode having a data portion to be deleted, a file deletion request in a first memory;transferring the recorded file deletion request from the first memory to a second memory to enable the data structures that own the data portions to be deleted to generate batch data deletions, the second memory comprising persistent memory to persist the recorded file deletion request; anddeleting the data portions to be deleted, wherein the deleting is performed responsive to the transferring.

2. The method of claim 1, further comprising: sending messages regarding the data portions to be deleted from the data structure owning the inode to the data structures that own the data portions to be deleted, wherein the data structure owning the inode is identified through a hash algorithm applied to the inode.

3. The method of claim 1, wherein the determining is performed as a background operation and the recording is performed in a foreground operation.

4. The method of claim 1, further comprising: recording a record of cleanup tasks in the first memory.

5. The method of claim 1, wherein ownership of the inode is established prior to writing a file associated with the inode.

6. The method of claim 1, further comprising: triggering garbage collection, based on the transferring.

7. The method of claim 1, wherein the deleting comprises: collecting data portions to be deleted for deletion as batches of data portions.

8. A tangible, non-transitory, computer-readable media having instructions thereupon which, when executed by a processor, cause the processor to perform a method comprising: determining which data structures own data portions to be deleted, wherein the data structures are configured to own data portions of further files associated with inodes owned by other data structures;recording, by a data structure owning an inode having a data portion to be deleted, a file deletion request in a first memory;transferring the recorded file deletion request from the first memory to a second memory to enable the data structures that own the data portions to be deleted to generate batch data deletions, the second memory comprising persistent memory to persist the recorded file deletion request; anddeleting the data portions to be deleted, wherein the deleting is performed responsive to the transferring.

9. The computer-readable media of claim 8, wherein the method further comprises: sending messages regarding the data portions to be deleted from the data structure owning the inode to the data structures that own the data portions to be deleted, wherein the data structure owning the inode is identified through a hash algorithm applied to the inode.

10. The computer-readable media of claim 8, wherein the determining is performed as a background operation and the recording is performed in a foreground operation.

11. The computer-readable media of claim 8, wherein the method further comprises: performing garbage collection in the second memory, triggered by the transferring.

12. The computer-readable media of claim 8, wherein the method further comprises: writing a truncation record to the first memory, the truncation record acting as an instruction to clear data in a specified range of addresses, responsive to a request for truncation of the file.

13. The computer-readable media of claim 8, wherein ownership of the inode is established prior to writing a file associated with the inode.

14. A storage system, comprising: a first memory, distributed in the storage system and having RAM (random-access memory) configurable to hold metadata; a second memory, distributed in the storage system and having solid-state storage memory, configurable to hold data portions and metadata; a plurality of processors, configured to record in the first memory, by a data structure that owns an inode of a file, deletion of the file; the plurality of processors further configurable to record in the first memory, by a second data structure that owns a second inode of a further file, truncation of the further file; the plurality of processors further configurable to transfer the recorded file deletion from the first memory to the second memory to enable the data structure that owns the data portions to be deleted to generate batch data deletions, wherein the second memory persists the recorded file deletion; and the plurality of processors further configurable to have a plurality of data structures, wherein each data structure of the plurality of data structures owns a data portion to be deleted, wherein ownership of the first inode and the second inode is assigned prior to writing the file, the plurality of processors further configured to have the plurality of data structures delete the data portions in the second memory, wherein deletion of the data portions is performed responsive to the transferring and based on the batch data deletions.

15. The storage system of claim 14, further comprising: the plurality of processors further configurable to have the data structure that owns the inode of the file send messages as a background operation, to the data structures that own the data portions to be deleted resulting from the request for the deletion of the file, wherein the data structure owning the inode is identified through a hash algorithm applied to the inode.

16. The storage system of claim 14, wherein determination of which data structures own which data portions to be deleted is performed as a background operation and recording the file deletion is performed in a foreground operation.

17. The storage system of claim 14, further comprising: the plurality of processors further configured to trigger garbage collection in the second memory responsive to the transferring.

18. The storage system of claim 14, wherein the plurality of processors are further configurable to record a record of cleanup tasks in the first memory.

19. The storage system of claim 14, wherein to have the plurality of data structures delete the data portions in the second memory comprises: the plurality of processors further configurable to have the plurality of data structures perform background cleanup work in batches.

20. The storage system of claim 14, wherein to have the plurality of data structures delete the data portions in the second memory resulting from the truncation of the further file comprises: the plurality of processors further configurable to have each data structure of the plurality of data structures that owns a data portion to be deleted for the truncation of the further file, write a truncation record to the first memory and reply back to the second data structure that owns the second inode of the further file, in foreground.