Abstract: A method includes: identifying, by a first program module, a bucket having an object lifecycle management rule in a dispersed storage network; creating, by a second program module, ranges of object names included in a namespace of the bucket; determining, by a third program module and for respective objects in each of the ranges, whether the respective objects satisfy the object lifecycle management rule of the bucket; and performing, by a fourth program module and based on the determining, an action on one of the respective objects that satisfies the object lifecycle management rule, the action being defined by the object lifecycle management rule.

Abstract: Systems and methods for managing conflicting background tasks in a dispersed storage network are provided. In embodiments, a method includes: gathering scheduled future task data for scheduled future tasks from a plurality of task scheduling modules within a dispersed storage network, wherein the scheduled future tasks are tasks associated with stored data objects; monitoring the scheduled future task data for scheduling conflicts based on stored rules; determining that a scheduling conflict exists between a first future task of the scheduled future tasks and a second future task of the scheduled future tasks; issuing instructions to at least one of the plurality of task scheduling modules to update the first future task or the second future task based on the scheduling conflict; and updating, by the at least one of the plurality of task scheduling modules, the first future task or the second future task based on the instructions.

Abstract: A method, computer system, and a computer program product for object notifications is provided. The present invention may include receiving a requestor's operation. The present invention may then include determining that a notification describing the requestor's operation should be sent. The present invention may then include determining whether the requestor's operation is successful or unsuccessful, and the present invention may lastly include deleting an in-memory object.

Abstract: A method includes: identifying, by a first program module, a bucket having an object lifecycle management rule in a dispersed storage network; creating, by a second program module, ranges of object names included in a namespace of the bucket; determining, by a third program module and for respective objects in each of the ranges, whether the respective objects satisfy the object lifecycle management rule of the bucket; and performing, by a fourth program module and based on the determining, an action on one of the respective objects that satisfies the object lifecycle management rule, the action being defined by the object lifecycle management rule.

Abstract: Systems and methods for managing conflicting background tasks in a dispersed storage network are provided. In embodiments, a method includes: gathering scheduled future task data for scheduled future tasks from a plurality of task scheduling modules within a dispersed storage network, wherein the scheduled future tasks are tasks associated with stored data objects; monitoring the scheduled future task data for scheduling conflicts based on stored rules; determining that a scheduling conflict exists between a first future task of the scheduled future tasks and a second future task of the scheduled future tasks; issuing instructions to at least one of the plurality of task scheduling modules to update the first future task or the second future task based on the scheduling conflict; and updating, by the at least one of the plurality of task scheduling modules, the first future task or the second future task based on the instructions.

Abstract: A method, computer system, and a computer program product for object notifications is provided. The present invention may include receiving a requestor's operation. The present invention may then include determining that a notification describing the requestor's operation should be sent. The present invention may then include determining whether the requestor's operation is successful or unsuccessful, and the present invention may lastly include deleting an in-memory object.

Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots.

Abstract: A technique enables recovery of storage space trapped in an extent store from overlapping write requests associated with metadata describing volume logical storage addresses for data in the extent store. The metadata is organized as metadata entries in a multi-level dense tree metadata structure. When a level of the dense tree is full, the metadata entries of the level are merged with a next lower level of the dense tree in accordance with a dense tree merge operation. The technique may be invoked during the merge operation to process the metadata entries associated with the overlapping write requests involved in the merge operation. Processing of the overlapping write requests during the merge operation may partially overwrite extents which, in turn, may result in logical storage space being trapped in the extent store. The technique may perform read-modify-write (RMW) operations on the partially overwritten extents to recapture that trapped space.

Abstract: A technique enables recovery of storage space trapped in an extent store due to overlapping write requests associated with metadata managed by a volume layer of a storage input/output stack executing on one or more nodes of a cluster. The metadata is organized as a multi-level dense tree metadata structure, wherein each level of the dense tree includes volume metadata entries for storing the metadata. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a dense tree merge operation. The technique may be invoked during the merge operation to process the volume metadata entries associated with the overlapping write requests at each level of the dense tree involved in the merge operation. Processing of the overlapping write requests during the merge operation may manifest as partial overwrites of one or more existing extents which, in turn, may result in logical storage space being trapped in the extent store.

Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots.

Abstract: Various computing components (such as devices, operating environments, and processes) may communicate by exchanging instances of a data collection, such as a class or data structure. However, the definition of the data collection may evolve to specify different numbers, types, properties, and orderings of the items in the data collection, and it may be difficult to verify the structure and contents of an instance received from another component and possibly of a different version. This difficulty may be mitigated by exchanging versioning information about the instance (e.g., as part of the communications wire protocol) and by allocating the converting such that the sender may downconvert to earlier versions requested by a recipient, while the recipient may upconvert to later versions than a version provided by a sender. These techniques may promote the accuracy and consistency of information exchange among many components that operate on different versions of the data collection.

Abstract: A method for operating a computer storage system maintains a client computer interacting with the storage system, the client computer storing data on a data storage device of the computer storage system. Locating, by a client-side agent executing on the client computer that examines metadata of the client computer, one or more sets of blocks allocated and then deleted, hereinafter referred to as deleted blocks, within the computer storage system. Sending a command to the storage system, the command to identify the deleted blocks within the computer storage system. Deallocating, in response to receiving the command, the identified deleted blocks within the computer storage system.

Abstract: A system and method for lun migration between data containers, such as aggregates of a storage system is provided. A new destination lun is created on a destination aggregate. A background copy process is then started that copies all data from a source lun on a source aggregate to the destination lun. The storage system continues to process client-originated data access requests directed to the source lun while the background copying continues. Once all the data of the source lun has been copied to the destination lun, processing of data access requests to the lun(s) is quiesced by the storage system. Lun maps of the storage system are then updated and processing of the client-originated data access requests is resumed with those requests now being directed to the destination lun.

Abstract: A system and method provides a single system image for a clustered storage network including techniques for processing data access commands between storage appliances over the cluster interconnect. The system is configured such that the cluster is assigned a single world wide nodename. Requests coming to the cluster from client initiators are directed to one or the storage appliances in the cluster, i.e. the “receiving” storage appliance. Commands received by the receiving storage appliance are examined to determine LUN value(s) in the request. If the LUN value is associated with a local storage device, the request is processed by the receiving storage appliance. If the LUN value is not associated with the receiving storage appliance, the request is conveyed over the cluster interconnect to the partner storage appliance to be processed and the appropriate data written or retrieved.

Abstract: A system and method provides a single system image for a clustered storage network including techniques for processing data access commands between storage appliances over the cluster interconnect. The system is configured such that the cluster is assigned a single world wide nodename. Requests coming to the cluster from client initiators are directed to one or the storage appliances in the cluster, i.e. the “receiving” storage appliance. Commands received by the receiving storage appliance are examined to determine LUN value(s) in the request. If the LUN value is associated with a local storage device, the request is processed by the receiving storage appliance. If the LUN value is not associated with the receiving storage appliance, the request is conveyed over the cluster interconnect to the partner storage appliance to be processed and the appropriate data written or retrieved.

Abstract: A system and method provides a single system image for a clustered storage network including techniques for processing data access commands between storage appliances over the cluster interconnect. The system is configured such that the cluster is assigned a single world wide nodename. Requests coming to the cluster from client initiators are directed to one or the storage appliances in the cluster, i.e. the “receiving” storage appliance. Commands received by the receiving storage appliance are examined to determine LUN value(s) in the request. If the LUN value is associated with a local storage device, the request is processed by the receiving storage appliance. If the LUN value is not associated with the receiving storage appliance, the request is conveyed over the cluster interconnect to the partner storage appliance to be processed and the appropriate data written or retrieved.

Abstract: A system and method for allowing more rapid takeover of a failed filer by a clustered takeover partner filer in the presence of a coredump procedure (e.g. a transfer of the failed filer's working memory) is provided. To save time, the coredump is allowed to occur contemporaneously with the takeover of the failed filer's regular, active file service disks by the partner so that the takeover need not await completion of the coredump to begin. This is accomplished, briefly stated, by the following techniques. The coredump is written to a single disk that is not involved in regular file service, so that takeover of regular file services can proceed without interference from coredump. A reliable means for both filers in a cluster to identify the coredump disk is provided, which removes takeover dependence upon unreliable communications mechanisms.

Abstract: This invention provides a system and method for selecting and communicating a single disk (a “coredump disk”) for use in a coredump procedure by a failed file server (or filer). A selection method on the failed filer determines the “best candidate” coredump disk according to a predetermined set of criteria. For example, the available disks that can receive coredump data are located and ordered so as to prefer disks that best match the coredump data size requirement, are least likely to be needed for normal service by the server; and require the least preparation to receive coredump data. Appropriate attributes on the selected coredump disk are written to indicate that a coredump is in progress, and the location of the coredump data. Upon reboot of the failed filer (or takeover by a cluster partner), the coredump disk is identified and the coredump data recovered by reading back appropriate attributes.

Abstract: A technique enables application data stored on storage devices of a storage system to be accessible by a client as either a file or logical unit number (lun). The storage system is illustratively embodied as a multi-protocol storage appliance having a storage operating system that implements a file system. The file system logically organizes the application data as a virtual disk (vdisk) comprising a plurality of inodes including a prefix stream inode, a lun inode (storing the application data) and a suffix stream inode. The prefix and suffix stream inodes allow the vdisk to be shared over a block-based protocol or a file-based protocol by enabling apportionment of client operating system dependent storage device contents from application data contents of the vdisk.

Abstract: A system and method for allowing more rapid takeover of a failed filer by a clustered takeover partner filer in the presence of a coredump procedure (e.g. a transfer of the failed filer's working memory) is provided. To save time, the coredump is allowed to occur contemporaneously with the takeover of the failed filer's regular, active file service disks by the partner so that the takeover need not await completion of the coredump to begin. This is accomplished, briefly stated, by the following techniques. The coredump is written to a single disk that is not involved in regular file service, so that takeover of regular file services can proceed without interference from coredump. A reliable means for both filers in a cluster to identify the coredump disk is provided, which removes takeover dependence upon unreliable communications mechanisms.