Capacity attribution in a storage system

Information

  • Patent Grant
  • 10310753
  • Patent Number
    10,310,753
  • Date Filed
    Monday, April 30, 2018
    6 years ago
  • Date Issued
    Tuesday, June 4, 2019
    5 years ago
Abstract
Attributing consumed storage capacity among entities storing data in a storage array includes: identifying a data object stored in the storage array and shared by a plurality of entities, where the data object occupies an amount of storage capacity of the storage array; and attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object.
Description
TECHNICAL FIELD

The field of technology is data processing, or, more specifically, methods, apparatus, and products for providing authorization and authentication in a cloud for a user of a storage array.


BACKGROUND ART

Data centers may include many computing components including servers, network devices, and storage arrays. As the need for storage of large amounts of data and efficient access to that data increases, storage array technology is advancing. Such storage arrays may provide persistent storage for any number of computing devices in a data center. Given that many data centers provide services to many different users, various considerations must be taken into account to provide efficient, useful, and secure access to and administration of storage arrays.


In some storage arrays, storage capacity may be efficiently utilized between multiple entities by sharing of data. That is, data need not be written to two separate memory locations within storage if the data is the same. Deduplication schemes, for example, are configured to identify multiple instances of the same data and reduce the data to a single instance in storage. Entities sharing such data are typically unaware that such sharing has occurred. To that end, difficulties exist in reporting the amount of space utilized by such shared data to each of the entities.


SUMMARY OF INVENTION

Methods, apparatus, and products for attributing consumed storage capacity among entities storing data in a storage array are described in this specification. Such attribution includes identifying a data object stored in the storage array and shared by a number of entities. The data object occupies an amount of storage capacity of the storage array. Attributing consumed storage capacity among the entities may include attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object.


The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.





BRIEF DESCRIPTION OF DRAWINGS


FIG. 1 sets forth a block diagram of a system configured for attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.



FIG. 2 sets forth a block diagram of an example storage controller of a storage array configured for attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.



FIG. 3 sets forth a block diagram of an example system having a plurality of entities sharing data objects in a storage array for which consumed storage capacity is attributed among the entities according to embodiments of the present invention.



FIG. 4 sets forth a flow chart illustrating an exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.



FIG. 5 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.



FIG. 6 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.



FIG. 7 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention.





DESCRIPTION OF EMBODIMENTS

Exemplary methods, apparatus, and products for attributing consumed storage capacity among entities storing data in a storage array in accordance with the present invention are described with reference to the accompanying drawings, beginning with FIG. 1. FIG. 1 sets forth a block diagram of a system configured for attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention. The system of FIG. 1 includes a number of computing devices (164, 166, 168, 170). Such computing devices may be implemented in a number of different ways. For example, a computing device may be a server in a data center, a workstation, a personal computer, a notebook, or the like.


The computing devices (164-170) in the example of FIG. 1 are coupled for data communications to a number of storage arrays (102, 104) through a storage area network (SAN) (158) as well as a local area network (160) (LAN). The SAN (158) may be implemented with a variety of data communications fabrics, devices, and protocols. Example fabrics for such a SAN may include Fibre Channel, Ethernet, Infiniband, SAS (Serial Attached Small Computer System Interface), and the like. Example data communications protocols for use in such a SAN (158) may include ATA (Advanced Technology Attachment), Fibre Channel Protocol, SCSI, iSCSI, HyperSCSI, and others. Readers of skill in the art will recognize that a SAN is just one among many possible data communications couplings which may be implemented between a computing device and a storage array. Any other such data communications coupling is well within the scope of embodiments of the present invention.


The local area network (160) of FIG. 1 may also be implemented with a variety of fabrics and protocols. Examples of such fabrics include Ethernet (802.3), wireless (802.11), and the like. Examples of such data communications protocols include TCP (Transmission Control Protocol), UDP (User Datagram Protocol), IP (Internet Protocol), HTTP (HyperText Transfer Protocol), WAP (Wireless Access Protocol), HDTP (Handheld Device Transport Protocol), SIP (Session Initiation Protocol), RTP (Real Time Protocol) and others as will occur to those of skill in the art.


The example storage arrays (102, 104) of FIG. 1 provide persistent data storage for the computing devices. Each storage array (102, 104) includes a storage controller (106, 112). The storage controller is a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software. The storage controller may be configured to carry out various storage-related tasks. Such tasks may include writing data received from a computing device to storage, erasing data from storage, retrieving data from storage to provide to a computing device, monitoring and reporting of disk utilization and performance, performing RAID (Redundant Array of Independent Drives) or RAID-like data redundancy operations, compressing data, encrypting data, and so on.


Each storage controller (106, 112) may be implemented in a variety of ways, including as an FPGA (Field Programmable Gate Array), a PLC (Programmable Logic Chip), an ASIC (Application Specific Integrated Circuit), or computing device that includes discrete components such as a central processing unit, computer memory, and various adapters. Each storage controller (106, 112) may, for example, include a data communications adapter configured to support communications via the SAN (158) and the LAN (160). Only one of the storage controllers (112) in the example of FIG. 1 is depicted as coupled to the LAN (160) for data communications for clarity. Readers should understand that both storage controllers (106, 112) are independently coupled to the LAN (160). Each storage controller (106, 112) may also, for example, include an I/O controller or the like that couples the storage controller (106, 112) for data communications, through a midplane (114), to a number of storage devices (146, 150), and a number of write buffer devices (148, 152) devices.


Each write buffer device (148, 152) may be configured to receive, from the storage controller (106, 112), data to be stored in the storage devices (146). Such data may originate from any one of the computing devices (164-170). In the example of FIG. 1, writing data to the write buffer device may be carried out more quickly than writing data to the storage device. The storage controller (106, 112) may be configured to effectively utilize the write buffer devices (148, 152) as a quickly accessible redundant buffer for data destined to be written to storage. In this way, if the storage device to which the data is to be written fails or if the write does not complete, the write buffer device may maintain the data to be written during a retry of the write or during failover of the storage device to another location. That is, the write buffer device may provide redundancy for the storage devices.


A ‘storage device’ as the term is used in this specification refers to any device configured to record data persistently. The term ‘persistently’ as used here refers to a device's ability to maintain recorded data after loss of a power source. Examples of storage devices may include mechanical, spinning hard disk drives, Solid-state drives (“Flash drives”), and the like.


In addition to being coupled to the computing devices through the SAN (158), the storage arrays may also be coupled to the computing devices through the LAN (160) and to one or more cloud service providers through the Internet (172). One example cloud service in FIG. 1 is a storage array services provider (176). The storage array service provider (176) may be configured to provide various storage array services such as reporting of storage array performance characteristics, configuration control of the storage arrays, and the like. The storage array services provider may rely on modules executing on the storage array itself to gather or process such data.


As mentioned above, the storage controllers (106, 112) of the storage arrays (102, 104) may be configured to carry out various storage-related tasks. In the example of FIG. 1, the storage controller (106) is configured to execute an attribution module (182) that attributes consumed storage capacity among entities storing data in a storage array in accordance with embodiment of the present invention. To that end, the attribution module (182) may identify a data object stored in the storage array and shared by a plurality of entities. The term ‘entity’ refers to anything that may be uniquely identified and to which storage capacity utilization may be attributed. Examples of such entities may include I/O (input/output) originators such as users, applications, operating systems and like, snapshots, memory regions, and so on.


A data object may be ‘shared’ between multiple entities without the entities' knowledge. Consider, for example, deduplicated data. In a concise example, when two memory regions contain identical data, the data may be deduplicated such that one only one memory region contains the data and references are created for both entities that originally stored that data. In this way, each entity that originally stored the data need not be aware that the data is stored in only a single location and effectively ‘shared’ among the entities. Reads of that memory region may be directed by the storage controller or other device that maintains deduplicated data tables, to the one remaining storage region containing the actual data.


The data object that is shared amongst a plurality of entities does occupy some amount of storage capacity of the storage array. To that end, the attribution module (182) may attribute to each entity sharing the data object, a fractional portion of the amount of storage capacity occupied by the data object. In this specification the term ‘fractional portion’ refers to a number less than the total amount of storage capacity consumed by the shared data object. Consider, for example a 1 Gigabyte file stored once by a first user in a storage array and once by a second user in the storage array. In this example, once the 1 GB file is deduplicated and stored in only a single instance, each user may be attributed a fractional portion of the amount of storage capacity consumed by the 1 GB file equal to half of the 1 GB file.


It is noted that the description above with respect to attribution of shared data objects may not include an attribution of all data objects associated with a particular entity. A particular entity for example may, in addition to sharing data objects, store unique data objects—objects that are not shared by any other entity. The attribution module (182) may therefore report not only attribute fractional portions of shared data objects to a particular entity, but also the entire storage space consumed by unique data objects associated with the particular entity.


The arrangement of computing devices, storage arrays, cloud-based service providers, networks and other devices making up the exemplary system illustrated in FIG. 1 are for explanation, not for limitation. Systems useful according to various embodiments of the present invention may include different configurations of servers, routers, switches, computing devices, and network architectures, not shown in FIG. 1, as will occur to those of skill in the art.


Attributing consumed storage capacity among entities storing data in a storage array in accordance with embodiments of the present invention is generally implemented with computers. In the system of FIG. 1, for example, all the computing devices (164-170), storage controllers (106, 112), and storage array services provider (176) may be implemented, to some extent at least, as computers. For further explanation, therefore, FIG. 2 sets forth a block diagram of an example storage controller (106) of a storage array (102). The example storage controller includes a computer processor (214). The computer processor is coupled to RAM (218) through a DDR4 (Double-Data Rate 4) bus.


Stored in RAM (218) is an attribution module configured for attributing consumed storage capacity among entities storing data in a storage array (102). The attribution module (182) may identify a data object (184) stored in the storage array (102) and shared by a plurality of entities. The data object occupies a particular amount of storage capacity of the storage array.


The attribution module (182) may then attribute to each entity a fractional portion of the amount of storage capacity occupied by the data object. The attribution module (182) may carry out such attribution by, for each entity sharing the data object: identifying a number of references (186, 188, 190, 192, 194), generated by the entity, to the data object (184); calculating an entity-specific proportion (240, 244) of the number of references generated by the entity relative to a total number of references to the data object; and calculating the product (242, 246) of the entity-specific proportion and the amount of storage capacity occupied by the data object.


A ‘reference’ as the term is used in this specification is a type of pointer to the shared data object. For each instance an entity stores the shared data object, a reference is a created. This reference may be used by the storage controller to direct read, write, erase, and copy access requests to the actual location of the shared data object as the entity associated with the shared data object may be unaware of the exact location at which the data object is stored. In the example of FIG. 2, consider that one entity has three references (186, 188, 190) to the shared data object (184) and another entity has two references (192, 194). To attribute a fractional portion of the amount of storage capacity occupied by the shared data object (184) amongst the two entities, the attribution module may first calculate a entity-specific proportion of the number of references generated by each entity. One entity may have an entity-specific proportion (240) of 3/5 and the other entity may have an entity-specific proportion (244) of 2/5. The attribution module (182) may then calculate the product of each entity-specific proportion and the total of amount of storage capacity consumed by the shared data object. Consider, as an example, that the amount of storage capacity consumed by the shared data object is 1 GB. Continuing with this example the product (242) of the entity-specific proportion (240) of 3/5 and 1 GB is 600 Megabytes (MB), and the product (246) of entity-specific proportion (244) of 2/5 and 1 GB is 400 MB. In this way, each entity is attributed a fractional portion of the total amount of storage capacity actually consumed by the shared data object (182).


Over time, the number of references to a particular shared data object by a particular entity may change. References may be lost for a variety of reasons. An overwrite of the data object, for example, in which the data is no longer identical between two entities may result in a loss of references associated with entity causing the overwrite. A ‘trim’ function, which results in freeing storage space but does not actually result in erasing or overwriting the data may result in a loss of reference to data stored in that storage location. Resizing a volume may also result in a loss of references to data objects stored in the portion of the volume that was lost due to the resizing. It should be noted that the data objects stored in the portion of the volume lost due to resizing need not be actually erased or overwritten. The result, however, from the point of the entity, is the same: the reference to that data object is lost. In each case, when references to a shared data object are lost, the fractional attribution of the amount of storage capacity consumed by that shared data object is no longer the same. As such, the attribution module (182) of the example of FIG. 2 may be configured, upon a loss of references by an entity to the shared data object, to recalculate, for the entity, the fractional portion of the amount of storage capacity occupied by the data object. Such recalculation may occur exactly as described above with respect to calculating an entity-specific proportion of references generated by the entity relative to the total number of references (generated by all entities) to the shared data object and calculating the product of that proportion to the total storage amount consumed by the shared data object.


The processor (214), in the example of FIG. 2, is also coupled for data communications through PCIe (Peripheral Component Interface express) links (208, 210, 212, 222) to several Fibre Channel host bus adapters (202, 204), an Ethernet adapter (206), and a PCIe switch (224). The Fibre Channel host bus adapters (202, 204) may couple the storage controller to a storage area network, such the SAN (158) depicted in the example of FIG. 1. The Ethernet adapter (206) may couple the storage controller to a local area network such as the LAN (160) depicted in the example of FIG. 1. The PCIe switch (224) may provide data communications across other PCI links through the midplane to PCI endpoints, such as storage devices or write buffer devices. Likewise, the processor (214) is also coupled through a SAS (Serial Attached SCSI) host bus adapter (216) to a SAS expander (220). The SAS expander may provide SAS connections between the computer processor (214) and other devices through the midplane.


Readers of skill in the art will recognize that these components, protocols, adapters, and architectures are for illustration only, not limitation. Such a storage controller may be implemented in a variety of different ways. Each such way is well within the scope of the present invention.


For further explanation, FIG. 3 sets forth a block diagram of an example system having a plurality of entities sharing data objects in a storage array for which consumed storage capacity is attributed among the entities according to embodiments of the present invention. More specifically, the block diagram of FIG. 3 sets forth three examples of entities and the types of data objects which may be shared amongst those entities.


In one example, a shared data object may be deduplicated data (306) referenced (308, 310) by a plurality of I/O operation originators (302, 304). An I/O operation originator may be any source of I/O, whether the original source or whether an abstraction of a source. An I/O operation originator may be a virtual machine, an operating system, an application, a volume, a particular computer hardware component, a particular I/P source, a particular MAC hardware address, a particular user, or so on. In the example of FIG. 3, each I/O operation originator (302, 304) each has a single reference (308, 310) to the deduplicated data (306). As such, each of the I/O operation originators may be attributed a fractional portion of half of the amount of storage capacity occupied by the deduplicated data.


In another example in FIG. 3, a shared data object may be data shared between a number of subsequent snapshots. A ‘snapshot’ as the term is used here refers to a capture of data in a particular memory region of the storage device at a particular time. In many subsequent captured snapshots may include identical data. To that end, the module that performs the snapshot operation may be configured to not duplicate data from one snapshot to the next. Instead, a reference to the original data (which would otherwise be duplicated in subsequent snapshots) is included in the subsequent snapshot. In the example of FIG. 3, three subsequent snapshots are depicted beginning with snapshot (318), then snapshot (320), then snapshot (322). Snapshot (320) includes a reference (326) to a data object included in snapshot (318). Such a data object is considered a shared data object (324). Snapshot (320) and (322) each include a reference (332, 334) to another shared data object (330) from snapshot (318). All other data (336, 338, 328, 340) in the snapshots is unique to the snapshot.


Each snapshot is considered an ‘entity’ as described in this specification such that some fractional portion of amount of storage consumed by a data object shared amongst multiple snapshots may be attributed to each of the snapshots sharing that data. In the example of FIG. 3, the snapshot (318) and snapshot (320) share the data object (324) equally. As such, each snapshot will be attributed with half of the total storage space consumed by the shared data object (324). Each snapshot (318, 326, 328) shared the data object (330) equally. As such, each snapshot will be attributed with a third of the total storage space consumed by the shared data object (330).


In another example of FIG. 3, a shared data object includes data shared between a source memory region (312) and a target memory region (314) as a result of a copy operation. Rather than copying data from a source memory region to a target memory region, many embodiments will merely create a reference to the data stored at the source memory region in the target memory region. There many types of copy operations which may result in such shared data. A normal copy operation, an XCOPY or ‘extended copy’ operation, a duplication of an entire volume, a copy of a snapshot or snapshots, replication between storage arrays over a network and so on are all types of copies which may result in a reference in a target memory region and shared data in a source memory region. To that end, each memory region (source and target) may be attributed a fractional portion of the amount of storage capacity occupied by the data shared between the two memory regions.



FIG. 4 sets forth a flow chart illustrating an exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention. The method of FIG. 4 includes identifying (402) a data object stored (184) in the storage array and shared by a plurality of entities. In the example of FIG. 4, the data object (184) occupies an amount of storage capacity of the storage array. Identifying (402) a data object (184) stored in the storage array and shared by a plurality of entities may be carried out in a variety of ways including by identifying deduplicated data, identifying references to data objects, identifying a copy operation, and so on.


The method of FIG. 4 also includes attributing (404) to each entity a fractional portion (178) of the amount of storage capacity occupied by the data object. In the method of FIG. 4, attributing (404) to each entity a fractional portion of the amount of storage capacity occupied by the data object is carried out, for each entity, by: identifying (406) a number of references, generated by the entity, to the data object; calculating (408) an entity-specific proportion of the number of references generated by the entity relative to a total number of references to the data object; and calculating (410) the product of the entity-specific proportion and the amount of storage capacity occupied by the data object.


Upon a loss of references by the entity to the data object, the method of FIG. 4 includes recalculating (412), for the entity, the fractional portion (178) of the amount of storage capacity occupied by the data object. Recalculating (412) the fractional portion (178) may be carried out in the same way as described above with respect to attributing (404) the fractional portion (178). That is, the recalculation may include, for each entity sharing the data object: identifying (406) a number of references, generated by the entity, to the data object including the updated number of references after the loss of the reference; calculating (408) an entity-specific proportion of the number of references generated by the entity relative to a total number of references to the data object; and calculating (410) the product of the entity-specific proportion and the amount of storage capacity occupied by the data object.



FIG. 5 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention. The method of FIG. 5 is similar to the method of FIG. 4 including as it does: identifying (402) a data object stored in the storage array and shared by a plurality of entities and attributing (404) to each entity a fractional portion (178) of the amount of storage capacity occupied by the data object.


The method of FIG. 5 differs from the method of FIG. 4, however, in that in the method of FIG. 5 identifying (402) a data object stored in the storage array and shared by a plurality of entities may be carried out in various ways. For example, identifying (402) a data object shared by a plurality of entities may be carried out by identifying (502) deduplicated data (506) referenced by a plurality of I/O operation originators. Identifying (502) deduplicated data (506) may be carried out by a deduplication engine that reports to an attribution module. For example, upon each deduplication or addition of a reference to a deduplicated data object, the deduplication engine may report the memory location, size of the deduplicated data, number of references, and I/O originators for each reference, to the attribution module. In such an embodiment, attributing (404) to each entity a fractional portion of the amount of storage capacity occupied by the data object includes attributing (508) to each of the I/O operation originators a fractional portion of the amount of storage capacity occupied by the deduplicated data.


Identifying (402) a data object shared by a plurality of entities in the method of FIG. 5 also includes identifying (510), from a set of subsequent snapshots, data shared between the snapshots. A snapshot creator may, upon creation of a snapshot, identify and report the size of data objects shared between snapshots, the number of references for each snapshot that point to the shared data objects, and an identifier of each snapshot that shares the data object. In such an embodiment, attributing (404) to each entity a fractional portion of the amount of storage capacity occupied by the data object is carried out by attributing (514) to each of the set of subsequent snapshots a fractional portion of the amount of storage capacity occupied by the data shared between the snapshots.


Identifying (402) a data object shared by a plurality of entities in the example of FIG. 5 also includes identifying (516) data shared between a source memory region comprising a source of a copy operation and a target memory region comprising a target of the copy operation. Upon each copy operation that results in shared data, a module handling the copy operations may report to an attribution module the identifiers of the target and source memory region and the size of the data shared between the two memory regions. In such an embodiment, attributing (404) to each entity a fractional portion of the amount of storage capacity occupied by the data object is carried out by attributing (520) to the source and target memory regions a fractional portion of the amount of storage capacity occupied by the data shared between the source and target memory regions.


Readers of skill in the art will recognize that although three different embodiments are set forth in the example of FIG. 5, the three different embodiments need not be mutually exclusively. That is, in some embodiments any number of these three embodiments may be employed together. Consider, for example, a number of snapshots with data shared between the snapshot. Consider further that such data shared between the snapshots is deduplicated with other data in the volume. Consider further that a user copies that other data to a from its original memory location (source) to another memory region (target). In each case, fractional apportionment as described above may be carried out. That is, each of these embodiments in the example of FIG. 5 may be combined to create a single fractional attribution for an entity.



FIG. 6 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention. The method of FIG. 6 is similar to the method of FIG. 4 including as it does: identifying (402) a data object stored in the storage array and shared by a plurality of entities and attributing (404) to each entity a fractional portion (178) of the amount of storage capacity occupied by the data object.


The method of FIG. 6 differs from the method of FIG. 4 in that the method of FIG. 6 also includes receiving (602), from a particular entity, an identification of a particular data object stored in the storage system and shared by a plurality of entities including the particular entity. Such an identification may be a request to delete a particular data file or identify the properties of a particular data file such as the data files ‘size’ on the storage device. To that end, the method of FIG. 6 continues by calculating (604), in dependence upon the fractional portion of the amount of storage capacity occupied by the particular data object and attributed to the particular entity, an amount of storage capacity to be made available to the particular entity in response to a command, issued by the particular entity, to delete the particular data object.



FIG. 7 sets forth a flow chart illustrating another exemplary method of attributing consumed storage capacity among entities storing data in a storage array according to embodiments of the present invention. The method of FIG. 7 is similar to the method of FIG. 4 including as it does: identifying (402) a data object stored in the storage array and shared by a plurality of entities and attributing (404) to each entity a fractional portion (178) of the amount of storage capacity occupied by the data object.


The method of FIG. 7 differs from the method of FIG. 4 in that the method of FIG. 7 also includes identifying (702) a system-level data object stored in the storage array. System-level data objects may include various types of metadata. Deduplication tables, garbage collection tables, address translation tables, and the like may all be stored in the storage array and utilized by storage system management software to manage various characteristics of the storage array. That is, the system-level data object is not explicitly shared by the plurality of entities. Instead, each system-level data object is only inherently utilized by the entities through the management of the storage system utilized by the entities. To that end, the method of FIG. 6 continues by attributing (704) to each entity a fractional portion of the amount of storage capacity occupied by the system-level data object. In some embodiments attributing (704) a fractional portion of the amount of storage capacity occupied by the system-level data object may be carried out by attributing an equal portion of that amount to each entity utilizing the storage array.


Exemplary embodiments of the present invention are described largely in the context of a fully functional computer system. Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed upon computer readable media for use with any suitable data processing system. Such computer readable storage media may be any transitory or non-transitory media. Examples of such media include storage media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media also include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a computer program product. Persons skilled in the art will recognize also that, although some of the exemplary embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware, as hardware, or as an aggregation of hardware and software are well within the scope of embodiments of the present invention.


It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.

Claims
  • 1. A method of capacity attribution in a storage system, the method comprising: identifying a data object stored in the storage system and shared by a plurality of entities, including identifying, from a set of subsequent snapshots, data shared between the snapshots, the data object occupying an amount of storage capacity of the storage system; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object including attributing to each of the set of subsequent snapshots a fractional portion of the amount of storage capacity occupied by the data shared between the snapshots.
  • 2. The method of claim 1, wherein attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises: for each entity:identifying a number of references, generated by the entity, to the data object;calculating an entity-specific proportion of the number of references generated by the entity relative to a total number of references to the data object; andcalculating the product of the entity-specific proportion and the amount of storage capacity occupied by the data object.
  • 3. The method of claim 2 further comprising, upon a loss of references by the entity to the data object, recalculating, for the entity, the fractional portion of the amount of storage capacity occupied by the data object.
  • 4. The method of claim 1, wherein: identifying a data object shared by a plurality of entities further comprises identifying deduplicated data referenced by a plurality of I/O operation originators; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to each of the I/O operation originators a fractional portion of the amount of storage capacity occupied by the deduplicated data.
  • 5. The method of claim 1, wherein: identifying a data object shared by a plurality of entities further comprises identifying data shared between a source memory region comprising a source of a copy operation and a target memory region comprising a target of the copy operation; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to the source and target memory regions a fractional portion of the amount of storage capacity occupied by the data shared between the source and target memory regions.
  • 6. The method of claim 1 further comprising: receiving, from a particular entity, an identification of a particular data object stored in the storage system and shared by a plurality of entities including the particular entity; andcalculating, in dependence upon the fractional portion of the amount of storage capacity occupied by the particular data object and attributed to the particular entity, an amount of storage capacity to be made available to the particular entity in response to a command, issued by the particular entity, to delete the particular data object.
  • 7. The method of claim 1 further comprising: identifying a system-level data object stored in the storage system, wherein the system-level data object is not explicitly shared by the plurality of entities; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the system-level data object.
  • 8. An apparatus for capacity attribution in a storage system, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of: identifying a data object stored in the storage system and shared by a plurality of entities, including identifying, from a set of subsequent snapshots, data shared between the snapshots, the data object occupying an amount of storage capacity of the storage system; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object including attributing to each of the set of subsequent snapshots a fractional portion of the amount of storage capacity occupied by the data shared between the snapshots.
  • 9. The apparatus of claim 8, wherein attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises: for each entity:identifying a number of references, generated by the entity, to the data object;calculating an entity-specific proportion of the number of references generated by the entity relative to a total number of references to the data object; andcalculating the product of the entity-specific proportion and the amount of storage capacity occupied by the data object.
  • 10. The method of claim 9 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of: upon a loss of references by the entity to the data object, recalculating, for the entity, the fractional portion of the amount of storage capacity occupied by the data object.
  • 11. The apparatus of claim 8, wherein: identifying a data object shared by a plurality of entities further comprises identifying deduplicated data referenced by a plurality of I/O operation originators; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to each of the I/O operation originators a fractional portion of the amount of storage capacity occupied by the deduplicated data.
  • 12. The apparatus of claim 8, wherein: identifying a data object shared by a plurality of entities further comprises identifying data shared between a source memory region comprising a source of a copy operation and a target memory region comprising a target of the copy operation; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to the source and target memory regions a fractional portion of the amount of storage capacity occupied by the data shared between the source and target memory regions.
  • 13. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the steps of: receiving, from a particular entity, an identification of a particular data object stored in the storage system and shared by a plurality of entities including the particular entity; andcalculating, in dependence upon the fractional portion of the amount of storage capacity occupied by the particular data object and attributed to the particular entity, an amount of storage capacity to be made available to the particular entity in response to a command, issued by the particular entity, to delete the particular data object.
  • 14. The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the steps of: identifying a system-level data object stored in the storage system, wherein the system-level data object is not explicitly shared by the plurality of entities; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the system-level data object.
  • 15. A computer program product for capacity attribution in a storage system, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of: identifying a data object stored in the storage system and shared by a plurality of entities, including identifying, from a set of subsequent snapshots, data shared between the snapshots, the data object occupying an amount of storage capacity of the storage system; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object including attributing to each of the set of subsequent snapshots a fractional portion of the amount of storage capacity occupied by the data shared between the snapshots.
  • 16. The computer program product of claim 15, wherein: identifying a data object shared by a plurality of entities further comprises identifying deduplicated data referenced by a plurality of I/O operation originators; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to each of the I/O operation originators a fractional portion of the amount of storage capacity occupied by the deduplicated data.
  • 17. The computer program product of claim 15, wherein: identifying a data object shared by a plurality of entities further comprises identifying data shared between a source memory region comprising a source of a copy operation and a target memory region comprising a target of the copy operation; andattributing to each entity a fractional portion of the amount of storage capacity occupied by the data object further comprises attributing to the source and target memory regions a fractional portion of the amount of storage capacity occupied by the data shared between the source and target memory regions.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of and claims priority from U.S. patent application Ser. No. 15/668,259, filed Aug. 3, 2017, which claims priority from U.S. Pat. No. 9,804,779, issued Oct. 31, 2017, which claims priority from U.S. Pat. No. 9,594,512, issued Mar. 14, 2017.

US Referenced Citations (169)
Number Name Date Kind
5678025 Ghori Oct 1997 A
5706210 Kumano et al. Jan 1998 A
5717632 Richart et al. Feb 1998 A
5799200 Brant et al. Aug 1998 A
5933598 Scales et al. Aug 1999 A
6012032 Donovan et al. Jan 2000 A
6085333 DeKoning et al. Jul 2000 A
6510500 Sarkar Jan 2003 B2
6643641 Snyder Nov 2003 B1
6647514 Umberger et al. Nov 2003 B1
6789162 Talagala et al. Sep 2004 B1
6862665 Neefs Mar 2005 B2
6886082 Furusho Apr 2005 B1
7010645 Hetzler Mar 2006 B2
7089272 Garthwaite et al. Aug 2006 B1
7107389 Inagaki et al. Sep 2006 B2
7117331 Uchiumi et al. Oct 2006 B2
7146521 Nguyen Dec 2006 B1
7167950 Sakaguchi et al. Jan 2007 B2
7334124 Pham et al. Feb 2008 B2
7437530 Rajan Oct 2008 B1
7493424 Bali et al. Feb 2009 B1
7669029 Mishra et al. Feb 2010 B1
7689609 Lango et al. Mar 2010 B2
7743191 Liao Jun 2010 B1
7783852 Lahiri et al. Aug 2010 B2
7899780 Shmuylovich et al. Mar 2011 B1
8042163 Karr et al. Oct 2011 B1
8086585 Brashers et al. Dec 2011 B1
8200887 Bennett Jun 2012 B2
8271700 Annem et al. Sep 2012 B1
8387136 Lee et al. Feb 2013 B2
8437189 Montierth et al. May 2013 B1
8465332 Hogan et al. Jun 2013 B2
8527544 Colgrove et al. Sep 2013 B1
8566546 Marshak et al. Oct 2013 B1
8578442 Banerjee Nov 2013 B1
8613066 Brezinski et al. Dec 2013 B1
8620970 English et al. Dec 2013 B2
8751463 Chamness Jun 2014 B1
8762642 Bates et al. Jun 2014 B2
8769622 Chang et al. Jul 2014 B2
8800009 Beda, III et al. Aug 2014 B1
8812860 Bray Aug 2014 B1
8850546 Field et al. Sep 2014 B1
8898346 Simmons Nov 2014 B1
8909854 Yamagishi et al. Dec 2014 B2
8931041 Banerjee Jan 2015 B1
8949863 Coatney et al. Feb 2015 B1
8966198 Harris Feb 2015 B1
8984602 Bailey et al. Mar 2015 B1
8990905 Bailey et al. Mar 2015 B1
9081713 Bennett Jul 2015 B1
9124569 Hussain et al. Sep 2015 B2
9134922 Rajagopal et al. Sep 2015 B2
9189334 Bennett Nov 2015 B2
9209973 Aikas et al. Dec 2015 B2
9250823 Kamat et al. Feb 2016 B1
9300660 Borowiec et al. Mar 2016 B1
9311182 Bennett Apr 2016 B2
9444822 Borowiec et al. Sep 2016 B1
9507532 Colgrove et al. Nov 2016 B1
9632870 Bennett Apr 2017 B2
20020013802 Mori et al. Jan 2002 A1
20030145172 Galbraith et al. Jul 2003 A1
20030191783 Wolczko et al. Oct 2003 A1
20030225961 Chow et al. Dec 2003 A1
20040080985 Chang et al. Apr 2004 A1
20040111573 Garthwaite Jun 2004 A1
20040153844 Ghose et al. Aug 2004 A1
20040193814 Erickson et al. Sep 2004 A1
20040260967 Guha et al. Dec 2004 A1
20050160416 Jamison Jul 2005 A1
20050188246 Emberty et al. Aug 2005 A1
20050216800 Bicknell et al. Sep 2005 A1
20060015771 Van Gundy et al. Jan 2006 A1
20060129817 Borneman et al. Jun 2006 A1
20060161726 Lasser Jul 2006 A1
20060230245 Gounares et al. Oct 2006 A1
20060239075 Williams et al. Oct 2006 A1
20070022227 Miki Jan 2007 A1
20070028068 Golding et al. Feb 2007 A1
20070055702 Fridella et al. Mar 2007 A1
20070109856 Pellicone et al. May 2007 A1
20070150689 Pandit et al. Jun 2007 A1
20070168321 Saito et al. Jul 2007 A1
20070220227 Long Sep 2007 A1
20070294563 Bose Dec 2007 A1
20070294564 Reddin et al. Dec 2007 A1
20080005587 Ahlquist Jan 2008 A1
20080077825 Bello et al. Mar 2008 A1
20080162674 Dahiya Jul 2008 A1
20080195833 Park Aug 2008 A1
20080270678 Cornwell et al. Oct 2008 A1
20080282045 Biswas et al. Nov 2008 A1
20090077340 Johnson et al. Mar 2009 A1
20090100115 Park et al. Apr 2009 A1
20090198889 Ito et al. Aug 2009 A1
20100052625 Cagno et al. Mar 2010 A1
20100211723 Mukaida Aug 2010 A1
20100246266 Park et al. Sep 2010 A1
20100257142 Murphy et al. Oct 2010 A1
20100262764 Liu et al. Oct 2010 A1
20100325345 Ohno et al. Dec 2010 A1
20100332754 Lai et al. Dec 2010 A1
20110072290 Davis et al. Mar 2011 A1
20110125955 Chen May 2011 A1
20110131231 Haas et al. Jun 2011 A1
20110167221 Pangal et al. Jul 2011 A1
20120023144 Rub Jan 2012 A1
20120054264 Haugh et al. Mar 2012 A1
20120079318 Colgrove et al. Mar 2012 A1
20120131253 McKnight et al. May 2012 A1
20120303919 Hu et al. Nov 2012 A1
20120311000 Post et al. Dec 2012 A1
20130007845 Chang et al. Jan 2013 A1
20130031414 Dhuse et al. Jan 2013 A1
20130036272 Nelson Feb 2013 A1
20130071087 Motiwala et al. Mar 2013 A1
20130145447 Maron Jun 2013 A1
20130191555 Liu Jul 2013 A1
20130198459 Joshi et al. Aug 2013 A1
20130205173 Yoneda Aug 2013 A1
20130219164 Hamid Aug 2013 A1
20130227201 Talagala et al. Aug 2013 A1
20130290607 Chang et al. Oct 2013 A1
20130311434 Jones Nov 2013 A1
20130318297 Jibbe et al. Nov 2013 A1
20130332614 Brunk et al. Dec 2013 A1
20140020083 Fetik Jan 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140082715 Grajek et al. Mar 2014 A1
20140086146 Kim et al. Mar 2014 A1
20140090009 Li et al. Mar 2014 A1
20140096220 Da Cruz Pinto et al. Apr 2014 A1
20140101434 Senthurpandi et al. Apr 2014 A1
20140164774 Nord et al. Jun 2014 A1
20140173232 Reohr et al. Jun 2014 A1
20140195575 Haustein et al. Jul 2014 A1
20140195636 Karve et al. Jul 2014 A1
20140201512 Seethaler et al. Jul 2014 A1
20140201541 Paul et al. Jul 2014 A1
20140208155 Pan Jul 2014 A1
20140215590 Brand Jul 2014 A1
20140229654 Goss et al. Aug 2014 A1
20140230017 Saib Aug 2014 A1
20140258526 Le Sant et al. Sep 2014 A1
20140282983 Ju et al. Sep 2014 A1
20140285917 Cudak et al. Sep 2014 A1
20140325262 Cooper et al. Oct 2014 A1
20140351627 Best et al. Nov 2014 A1
20140373104 Gaddam et al. Dec 2014 A1
20140373126 Hussain et al. Dec 2014 A1
20150026387 Sheredy et al. Jan 2015 A1
20150074463 Jacoby et al. Mar 2015 A1
20150089569 Sondhi et al. Mar 2015 A1
20150095515 Krithivas et al. Apr 2015 A1
20150113203 Dancho et al. Apr 2015 A1
20150121137 McKnight et al. Apr 2015 A1
20150134920 Anderson et al. May 2015 A1
20150149822 Coronado et al. May 2015 A1
20150193169 Sundaram et al. Jul 2015 A1
20150378888 Zhang et al. Dec 2015 A1
20160098323 Mutha et al. Apr 2016 A1
20160350009 Cerreta et al. Dec 2016 A1
20160352720 Hu et al. Dec 2016 A1
20160352830 Borowiec et al. Dec 2016 A1
20160352834 Borowiec et al. Dec 2016 A1
20170024142 Watanabe et al. Jan 2017 A1
Foreign Referenced Citations (9)
Number Date Country
0725324 Aug 1996 EP
WO-2012087648 Jun 2012 WO
WO-2013071087 May 2013 WO
WO-2014110137 Jul 2014 WO
WO-2016015008 Dec 2016 WO
WO-2016190938 Dec 2016 WO
WO-2016195759 Dec 2016 WO
WO-2016195958 Dec 2016 WO
WO-2016195961 Dec 2016 WO
Non-Patent Literature Citations (32)
Entry
Paul Sweere, Creating Storage Class Persistent Memory with NVDIMM, Published in Aug. 2013, Flash Memory Summit 2013, <http://ww.flashmemorysummit.com/English/Collaterals/Proceedings/2013/20130814_T2_Sweere.pdf>, 22 pages.
PCMAG, Storage Array Definition, Published May 10, 2013. <http://web.archive.org/web/20130510121646/http://www.pcmag.com/encyclopedia/term/52091/storage-array>, 2 pages.
Google Search of “storage array define” performed by the Examiner on Nov. 4, 2015 for U.S. Appl. No. 14/725,278, Results limited to entries dated before 2012, 1 page.
Techopedia, What is a disk array, techopedia.com (online), Jan. 13, 2012, 1 page, URL: web.archive.org/web/20120113053358/http://www.techopedia.com/definition/1009/disk-array.
Webopedia, What is a disk array, webopedia.com (online), May 26, 2011, 2 pages, URL: web/archive.org/web/20110526081214/http://www.webopedia.com/TERM/D/disk_array.html.
Li et al., Access Control for the Services Oriented Architecture, Proceedings of the 2007 ACM Workshop on Secure Web Services (SWS '07), Nov. 2007, pp. 9-17, ACM New York, NY.
Hota et al., Capability-based Cryptographic Data Access Control in Cloud Computing, International Journal of Advanced Networking and Applications, col. 1, Issue 1, Aug. 2011, 10 pages, Eswar Publications, India.
Faith, dictzip file format, GitHub.com (online), accessed Jul. 28, 2015, 1 page, URL: github.com/fidlej/idzip.
Wikipedia, Convergent Encryption, Wikipedia.org (online), accessed Sep. 8, 2015, 2 pages, URL: en.wikipedia.org/wiki/Convergent_encryption.
Storer et al., Secure Data Deduplication, Proceedings of the 4th ACM International Workshop on Storage Security and Survivability (StorageSS'08), Oct. 2008, 10 pages, ACM New York, NY. USA, DOI: 10.1145/1456469.1456471.
ETSI, Network Function Virtualisation (NFV); Resiliency Requirements, ETSI GS NFCV-REL 001, V1.1.1, Jan. 2015, 82 pages, etsi.org (online), URL: www.etsi.org/deliver/etsi_gs/NFV-REL/001_099/001/01.01.01_60/gs_NFV-REL001v010101p.pdf.
Microsoft, Hybrid for SharePoint Server 2013—Security Reference Architecture, Microsoft (online), Oct. 2014, 53 pages, URL: hybrid.office.com/img/Security_Reference_Architecture.pdf.
Microsoft, Hybrid Identity, Microsoft (online), Apr. 2014, 36 pages, URL: www.aka.ms/HybridIdentityWp.
Microsoft, Hybrid Identity Management, Microsoft (online), Apr. 2014, 2 pages, URL: download.microsoft.com/download/E/A/E/EAE57CD1-A80B-423C-96BB-142FAAC630139/Hybrid_Identity_Datasheet.pdf.
Bellamy-McIntyre et al., OpenID and the Enterprise: A Model-based Analysis of Single Sign-On Authentication, 15th IEEE International Enterprise Distributed Object Computing Conference (EDOC), Aug. 29, 2011, pp. 129-138, IEEE Computer Society, USA, DOI: 10.1109/EDOC.2011.26, ISBN: 978-1-4577-0362-1.
Kong, Using PCI Express As The Primary System Interconnect in Multiroot Compute, Storage, Communications and Embedded Systems, White Paper, IDT.com (online), Aug. 28, 2008, 12 pages, URL: www.idt.com/document/whp/idt-pcie-multi-root-white-paper.
Hu et al., Container Marking: Combining Data Placement, Garbage Collection and Wear Levelling for Flash, 19th Annual IEEE International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunications Systems, Jul. 25-27, 2011, 11 pages, ISBN: 978-0-7695-4430-4, DOI: 10.1109/MASCOTS.2011.50.
International Search Report and Written Opinion, PCT/US2016/015006, dated Jul. 18, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/015008, dated May 4, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/020410, dated Jul. 8, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/032084, dated Jul. 18, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/016333, dated Jun. 8, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/032052, dated Aug. 30, 2016, 17 pages.
International Search Report and Written Opinion, PCT/US2016/035492, dated Aug. 17, 2016, 10 pages.
International Search Report and Written Opinion, PCT/US2016/036693, dated Aug. 29, 2016, 10 pages.
International Search Report and Written Opinion, PCT/US2016/038758, dated Oct. 7, 2016, 10 pages.
International Search Report and Written Opinion, PCT/US2016/040393, dated Sep. 22, 2016, 10 pages.
International Search Report and Written Opinion, PCT/US2016/044020, dated Sep. 30, 2016, 11 pages.
International Search Report and Written Opinion, PCT/US2016/044874, dated Oct. 7, 2016, 11 pages.
International Search Report and Written Opinion, PCT/US2016/044875, dated Oct. 5, 2016, 13 pages.
International Search Report and Written Opinion, PCT/US2016/044876, dated Oct. 21, 2016, 12 pages.
International Search Report and Written Opinion, PCT/US2016/044877, dated Sep. 29, 2016, 13 pages.
Continuations (3)
Number Date Country
Parent 15668259 Aug 2017 US
Child 15967250 US
Parent 15419471 Jan 2017 US
Child 15668259 US
Parent 14745342 Jun 2015 US
Child 15419471 US