-
公开(公告)号:AU2020203915B2
公开(公告)日:2021-06-17
申请号:AU2020203915
申请日:2020-06-12
Applicant: PURE STORAGE INC
Inventor: CAO JIANTING , HARRIMAN MARTIN , HAYES JOHN , SANDVIG CARY
IPC: G06F3/06
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.
-
公开(公告)号:AU2012296510B2
公开(公告)日:2017-10-26
申请号:AU2012296510
申请日:2012-08-16
Applicant: PURE STORAGE INC
Inventor: COLGROVE JOHN , HAYES JOHN , MILLER ETHAN , SANDVIG CARY
Abstract: A system and method for maintaining a mapping table in a data storage subsystem. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels which may be logically ordered by time. Each level stores pairs of a key value and a pointer value. New records are inserted in a created new (youngest) level. All levels other than the youngest may be read only. In response to detecting a flattening condition, a data storage controller is configured to identify a group of two or more adjacent levels of the plurality of levels for flattening which are logically adjacent in time. A new level is created and one or more records stored within the group are stored in the new level, in response to detecting each of the one or more records stores a unique key among keys stored within the group.
-
公开(公告)号:AU2020203915A1
公开(公告)日:2020-07-02
申请号:AU2020203915
申请日:2020-06-12
Applicant: PURE STORAGE INC
Inventor: CAO JIANTING , HARRIMAN MARTIN , HAYES JOHN , SANDVIG CARY
IPC: G06F3/06
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.
-
公开(公告)号:AU2016280617A1
公开(公告)日:2017-12-21
申请号:AU2016280617
申请日:2016-06-09
Applicant: PURE STORAGE INC
Inventor: CAO JIANTING , HARRIMAN MARTIN , HAYES JOHN , SANDVIG CARY
IPC: G06F3/06
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.
-
公开(公告)号:AU2016280617B2
公开(公告)日:2021-04-08
申请号:AU2016280617
申请日:2016-06-09
Applicant: PURE STORAGE INC
Inventor: CAO JIANTING , HARRIMAN MARTIN , HAYES JOHN , SANDVIG CARY
IPC: G06F3/06
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.
-
公开(公告)号:AU2012296510A1
公开(公告)日:2014-04-24
申请号:AU2012296510
申请日:2012-08-16
Applicant: PURE STORAGE INC
Inventor: COLGROVE JOHN , HAYES JOHN , MILLER ETHAN , SANDVIG CARY
Abstract: A system and method for maintaining a mapping table in a data storage subsystem. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels which may be logically ordered by time. Each level stores pairs of a key value and a pointer value. New records are inserted in a created new (youngest) level. All levels other than the youngest may be read only. In response to detecting a flattening condition, a data storage controller is configured to identify a group of two or more adjacent levels of the plurality of levels for flattening which are logically adjacent in time. A new level is created and one or more records stored within the group are stored in the new level, in response to detecting each of the one or more records stores a unique key among keys stored within the group.
-
-
-
-
-