US20230022758A1 - Garbage collection for heterogenous flash memory storage devices - Google Patents

Garbage collection for heterogenous flash memory storage devices Download PDF

Info

Publication number
US20230022758A1
US20230022758A1 US17/955,491 US202217955491A US2023022758A1 US 20230022758 A1 US20230022758 A1 US 20230022758A1 US 202217955491 A US202217955491 A US 202217955491A US 2023022758 A1 US2023022758 A1 US 2023022758A1
Authority
US
United States
Prior art keywords
storage
data
blocks
erase
data blocks
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
US17/955,491
Inventor
Russell Sears
Surya Pratim Mukherjee
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pure Storage Inc
Original Assignee
Pure Storage Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Pure Storage Inc filed Critical Pure Storage Inc
Priority to US17/955,491 priority Critical patent/US20230022758A1/en
Publication of US20230022758A1 publication Critical patent/US20230022758A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0688Non-volatile semiconductor memory arrays
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • G06F12/0238Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • G06F12/0253Garbage collection, i.e. reclamation of unreferenced memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608Saving storage space on storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061Improving I/O performance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/064Management of blocks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0658Controller construction arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0685Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10Providing a specific technical effect
    • G06F2212/1016Performance improvement
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72Details relating to flash memory management
    • G06F2212/7205Cleaning, compaction, garbage collection, erase control
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72Details relating to flash memory management
    • G06F2212/7208Multiple device management, e.g. distributing data over multiple flash devices

Definitions

  • Storage systems such as enterprise storage systems, may include a centralized or de-centralized repository for data that provides common data management, data protection, and data sharing functions, for example, through connections to computer systems.
  • FIG. 1 A illustrates a first example system for data storage in accordance with some implementations.
  • FIG. 1 B illustrates a second example system for data storage in accordance with some implementations.
  • FIG. 1 C illustrates a third example system for data storage in accordance with some implementations.
  • FIG. 1 D illustrates a fourth example system for data storage in accordance with some implementations.
  • FIG. 2 A 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 B is a block diagram showing an interconnect switch coupling multiple storage nodes in accordance with some embodiments.
  • FIG. 2 C 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. 2 D shows a storage server environment, which uses embodiments of the storage nodes and storage units of some previous figures in accordance with some embodiments.
  • FIG. 2 E 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. 2 F depicts elasticity software layers in blades of a storage cluster, in accordance with some embodiments.
  • FIG. 2 G depicts authorities and storage resources in blades of a storage cluster, in accordance with some embodiments.
  • FIG. 3 A sets forth a diagram of a storage system that is coupled for data communications with a cloud services provider in accordance with some embodiments of the present disclosure.
  • FIG. 3 B sets forth a diagram of a storage system in accordance with some embodiments of the present disclosure.
  • FIG. 3 C sets forth an example of a cloud-based storage system in accordance with some embodiments of the present disclosure.
  • FIG. 3 D illustrates an exemplary computing device that may be specifically configured to perform one or more of the processes described herein.
  • FIG. 4 illustrates an example of a storage system with a storage controller to perform erase block trimming for heterogeneous flash memory storage devices.
  • FIG. 5 is an example method to perform operations of an erase block trimming process in accordance with embodiments of the disclosure.
  • FIG. 6 is an example method to perform operations of an erase block trimming process for heterogeneous flash memory storage devices in accordance with embodiments of the disclosure.
  • FIG. 7 A is an illustration of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to another erase block in accordance with embodiments of the disclosure.
  • FIG. 7 B is an illustration of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to other erase blocks in accordance with embodiments of the disclosure.
  • FIG. 8 is an illustration of an example of forming a wide RAID stripe including multiple erase blocks in accordance with embodiments of the disclosure.
  • FIG. 9 is an example method to perform rebuild operations on failed erase blocks of a storage system using a wide RAID stripe in accordance with embodiments of the disclosure.
  • FIG. 10 is an example method to generate parity for a wide RAID stripe in accordance with embodiments of the disclosure.
  • FIG. 11 A is an illustration of an example of assigning data blocks a reclaimed allocation unit to a free block holder in accordance with embodiments of the disclosure.
  • FIG. 11 B is an illustration of an example of a storage device receiving a request for additional allocation units from an authority in accordance with some embodiments of the disclosure.
  • FIG. 11 C is an illustration of an example of a storage device providing the additional allocation units to an authority in accordance with embodiments of the disclosure.
  • a flash memory storage device has an erase block size that corresponds to the smallest unit of the storage device that can be erased. Flash memory erase block sizes, from different present manufacturers and for projected future flash memory storage devices, are not a single, fixed size. For example, one flash memory may have an erase block size of 4 megabytes (MB), another at 8 MB, 9 MB, 12 MB, 16 MB, 24 MB, 64 MB, etc. Future flash memory storage devices may be available with 80 MB erase blocks. It is projected that an erase block size could be 1 GB within a 3 to 10 year time period. This is not a problem for solid-state drives tied to a single vendor and/or single design of flash memory, with uniform erase block sizes. However, it is a problem for a storage cluster with the ability to add or replace solid state storage devices having different erase block sizes, and having a projected storage cluster lifespan over many years with an evolving heterogeneous mix of blades and solid-state storage devices.
  • MB megabytes
  • a storage system may be built from multiple storage devices (which may be removable) that provide durable storage and present such to the storage system.
  • the durable storage may be built from multiple flash memory storage devices from one or more storage device manufacturers.
  • a storage system manages erase blocks within and across the durable storage elements that contain those flash memory storage devices, or at least maps segments of data managed by the storage system implementation directly onto erase blocks or ranges of erase blocks.
  • one conventional solution is to modify software for every hardware replacement in such a storage system.
  • Another conventional solution is to use the smallest erase block size as a least common denominator for physical memory allocation in the storage devices.
  • such a conventional solution would result in wasted memory space in storage devices having larger erase blocks, decreasing the performance of the storage system.
  • allocation units for data (and metadata) storage are not required to align with erase block boundaries, and may be referred to as unaligned or misaligned allocation units.
  • Misaligned allocation units may give rise to write amplification in a storage system, as a result of having to perform additional write operations when allocation units are trimmed, to move other data in erase blocks so that the erase blocks can be reclaimed through garbage collection. This problem is made worse when write amplification for metadata that tracks the location of data is considered.
  • Write amplification for trimming misaligned allocation units produces write amplification for the data and write amplification for the metadata tracking the data, both of which are associated with the misaligned allocation units.
  • Various aspects in a solution described below reduce data movement from allocation unit trimming and garbage collection and thereby decrease write amplification in the storage system. These aspects can be used singly or in combination in various embodiments of storage systems.
  • Embodiments of the present disclosure address the above deficiencies by processing logic of a storage system determining that an allocation unit that is to be reclaimed is a misaligned allocation unit.
  • the misaligned allocation unit may share one or more erase blocks with data of another allocation unit.
  • the data for the other allocation unit may be relocated to a new erase block. Once the data has been relocated to the new erase block, the erase blocks of the misaligned allocation unit, including the erase block that is shared with the other allocation unit, are reclaimed by erasing the data stored at the erase blocks.
  • a wide RAID stripe may be implemented in addition to RAID 6 stripes to rebuild data that may become corrupted as a result of the write operations being performed on the storage device.
  • the wide RAID stripe may be over a larger number of erase blocks of a storage device than a RAID 6 stripe and may include at least one parity shard.
  • the wide RAID stripe may allow for the rebuilding of corrupted data stored at the storage device that cannot be reconstructed using a RAID 6 rebuild.
  • embodiments of the present disclosure provide for an improved storage system by relocating data sharing an erase block with a misaligned allocation unit of a storage device.
  • the data is preserved while allowing the use of different sized erase blocks that are inherent in a storage system including heterogeneous flash memory storage devices, without requiring the modification of software with the addition of each new flash memory storage device.
  • the ability of the storage system to rebuild corrupted data is enhanced, improving the data retention and reliability of the storage system.
  • FIG. 1 A illustrates an example system for data storage, in accordance with some implementations.
  • System 100 also referred to as “storage system” herein
  • storage system includes numerous elements for purposes of illustration rather than limitation. It may be noted that system 100 may include the same, more, or fewer elements configured in the same or different manner in other implementations.
  • System 100 includes a number of computing devices 164 A-B.
  • Computing devices may be embodied, for example, a server in a data center, a workstation, a personal computer, a notebook, or the like.
  • Computing devices 164 A-B may be coupled for data communications to one or more storage arrays 102 A-B through a storage area network (‘SAN’) 158 or a local area network (‘LAN’) 160 .
  • SAN storage area network
  • LAN local area network
  • the SAN 158 may be implemented with a variety of data communications fabrics, devices, and protocols.
  • the fabrics for SAN 158 may include Fibre Channel, Ethernet, Infiniband, Serial Attached Small Computer System Interface (‘SAS’), or the like.
  • Data communications protocols for use with SAN 158 may include Advanced Technology Attachment (‘ATA’), Fibre Channel Protocol, Small Computer System Interface (‘SCSI’), Internet Small Computer System Interface (‘iSCSI’), HyperSCSI, Non-Volatile Memory Express (‘NVMe’) over Fabrics, or the like.
  • SAN 158 is provided for illustration, rather than limitation.
  • Other data communication couplings may be implemented between computing devices 164 A-B and storage arrays 102 A-B.
  • the LAN 160 may also be implemented with a variety of fabrics, devices, and protocols.
  • the fabrics for LAN 160 may include Ethernet (802.3), wireless (802.11), or the like.
  • Data communication protocols for use in LAN 160 may include Transmission Control Protocol (‘TCP’), User Datagram Protocol (‘UDP’), Internet Protocol (‘IP’), HyperText Transfer Protocol (‘HTTP’), Wireless Access Protocol (‘WAP’), Handheld Device Transport Protocol (‘HDTP’), Session Initiation Protocol (SIP), Real Time Protocol (‘RTP’), or the like.
  • 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
  • Storage arrays 102 A-B may provide persistent data storage for the computing devices 164 A-B.
  • Storage array 102 A may be contained in a chassis (not shown), and storage array 102 B may be contained in another chassis (not shown), in implementations.
  • Storage array 102 A and 102 B may include one or more storage array controllers 110 A-D (also referred to as “controller” herein).
  • a storage array controller 110 A-D may be embodied as a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software. In some implementations, the storage array controllers 110 A-D may be configured to carry out various storage tasks.
  • Storage tasks may include writing data received from the computing devices 164 A-B to storage array 102 A-B, erasing data from storage array 102 A-B, retrieving data from storage array 102 A-B and providing data to computing devices 164 A-B, monitoring and reporting of disk utilization and performance, performing redundancy operations, such as Redundant Array of Independent Drives (‘RAID’) or RAID-like data redundancy operations, compressing data, encrypting data, and so forth.
  • redundancy operations such as Redundant Array of Independent Drives (‘RAID’) or RAID-like data redundancy operations
  • Storage array controller 110 A-D may be implemented in a variety of ways, including as a Field Programmable Gate Array (‘FPGA’), a Programmable Logic Chip (‘PLC’), an Application Specific Integrated Circuit (‘ASIC’), System-on-Chip (‘SOC’), or any computing device that includes discrete components such as a processing device, central processing unit, computer memory, or various adapters.
  • Storage array controller 110 A-D may include, for example, a data communications adapter configured to support communications via the SAN 158 or LAN 160 . In some implementations, storage array controller 110 A-D may be independently coupled to the LAN 160 .
  • storage array controller 110 A-D may include an I/O controller or the like that couples the storage array controller 110 A-D for data communications, through a midplane (not shown), to a persistent storage resource 170 A-B (also referred to as a “storage resource” herein).
  • the persistent storage resource 170 A-B main include any number of storage drives 171 A-F (also referred to as “storage devices” herein) and any number of non-volatile Random Access Memory (‘NVRAM’) devices (not shown).
  • NVRAM non-volatile Random Access Memory
  • the NVRAM devices of a persistent storage resource 170 A-B may be configured to receive, from the storage array controller 110 A-D, data to be stored in the storage drives 171 A-F.
  • the data may originate from computing devices 164 A-B.
  • writing data to the NVRAM device may be carried out more quickly than directly writing data to the storage drive 171 A-F.
  • the storage array controller 110 A-D may be configured to utilize the NVRAM devices as a quickly accessible buffer for data destined to be written to the storage drives 171 A-F. Latency for write requests using NVRAM devices as a buffer may be improved relative to a system in which a storage array controller 110 A-D writes data directly to the storage drives 171 A-F.
  • the NVRAM devices may be implemented with computer memory in the form of high bandwidth, low latency RAM.
  • the NVRAM device is referred to as “non-volatile” because the NVRAM device may receive or include a unique power source that maintains the state of the RAM after main power loss to the NVRAM device.
  • a power source may be a battery, one or more capacitors, or the like.
  • the NVRAM device may be configured to write the contents of the RAM to a persistent storage, such as the storage drives 171 A-F.
  • storage drive 171 A-F may refer to any device configured to record data persistently, where “persistently” or “persistent” refers as to a device's ability to maintain recorded data after loss of power.
  • storage drive 171 A-F may correspond to non-disk storage media.
  • the storage drive 171 A-F may be one or more solid-state drives (‘SSDs’), flash memory based storage, any type of solid-state non-volatile memory, or any other type of non-mechanical storage device.
  • SSDs solid-state drives
  • storage drive 171 A-F may include may include mechanical or spinning hard disk, such as hard-disk drives (‘HDD’).
  • the storage array controllers 110 A-D may be configured for offloading device management responsibilities from storage drive 171 A-F in storage array 102 A-B.
  • storage array controllers 110 A-D may manage control information that may describe the state of one or more memory blocks in the storage drives 171 A-F.
  • the control information may indicate, for example, that a particular memory block has failed and should no longer be written to, that a particular memory block contains boot code for a storage array controller 110 A-D, the number of program-erase (‘P/E’) cycles that have been performed on a particular memory block, the age of data stored in a particular memory block, the type of data that is stored in a particular memory block, and so forth.
  • P/E program-erase
  • control information may be stored with an associated memory block as metadata.
  • control information for the storage drives 171 A-F may be stored in one or more particular memory blocks of the storage drives 171 A-F that are selected by the storage array controller 110 A-D.
  • the selected memory blocks may be tagged with an identifier indicating that the selected memory block contains control information.
  • the identifier may be utilized by the storage array controllers 110 A-D in conjunction with storage drives 171 A-F to quickly identify the memory blocks that contain control information. For example, the storage controllers 110 A-D may issue a command to locate memory blocks that contain control information.
  • control information may be so large that parts of the control information may be stored in multiple locations, that the control information may be stored in multiple locations for purposes of redundancy, for example, or that the control information may otherwise be distributed across multiple memory blocks in the storage drive 171 A-F.
  • storage array controllers 110 A-D may offload device management responsibilities from storage drives 171 A-F of storage array 102 A-B by retrieving, from the storage drives 171 A-F, control information describing the state of one or more memory blocks in the storage drives 171 A-F. Retrieving the control information from the storage drives 171 A-F may be carried out, for example, by the storage array controller 110 A-D querying the storage drives 171 A-F for the location of control information for a particular storage drive 171 A-F.
  • the storage drives 171 A-F may be configured to execute instructions that enable the storage drive 171 A-F to identify the location of the control information.
  • the instructions may be executed by a controller (not shown) associated with or otherwise located on the storage drive 171 A-F and may cause the storage drive 171 A-F to scan a portion of each memory block to identify the memory blocks that store control information for the storage drives 171 A-F.
  • the storage drives 171 A-F may respond by sending a response message to the storage array controller 110 A-D that includes the location of control information for the storage drive 171 A-F. Responsive to receiving the response message, storage array controllers 110 A-D may issue a request to read data stored at the address associated with the location of control information for the storage drives 171 A-F.
  • the storage array controllers 110 A-D may further offload device management responsibilities from storage drives 171 A-F by performing, in response to receiving the control information, a storage drive management operation.
  • a storage drive management operation may include, for example, an operation that is typically performed by the storage drive 171 A-F (e.g., the controller (not shown) associated with a particular storage drive 171 A-F).
  • a storage drive management operation may include, for example, ensuring that data is not written to failed memory blocks within the storage drive 171 A-F, ensuring that data is written to memory blocks within the storage drive 171 A-F in such a way that adequate wear leveling is achieved, and so forth.
  • storage array 102 A-B may implement two or more storage array controllers 110 A-D.
  • storage array 102 A may include storage array controllers 110 A and storage array controllers 110 B.
  • a single storage array controller 110 A-D e.g., storage array controller 110 A
  • primary controller also referred to as “primary controller” herein
  • secondary controller also referred to as “secondary controller” herein
  • the primary controller may have particular rights, such as permission to alter data in persistent storage resource 170 A-B (e.g., writing data to persistent storage resource 170 A-B).
  • At least some of the rights of the primary controller may supersede the rights of the secondary controller.
  • the secondary controller may not have permission to alter data in persistent storage resource 170 A-B when the primary controller has the right.
  • the status of storage array controllers 110 A-D may change.
  • storage array controller 110 A may be designated with secondary status
  • storage array controller 110 B may be designated with primary status.
  • a primary controller such as storage array controller 110 A
  • a second controller such as storage array controller 110 B
  • storage array controller 110 A may be the primary controller for storage array 102 A and storage array 102 B
  • storage array controller 110 B may be the secondary controller for storage array 102 A and 102 B
  • storage array controllers 110 C and 110 D may neither have primary or secondary status.
  • Storage array controllers 110 C and 110 D may act as a communication interface between the primary and secondary controllers (e.g., storage array controllers 110 A and 110 B, respectively) and storage array 102 B.
  • storage array controller 110 A of storage array 102 A may send a write request, via SAN 158 , to storage array 102 B.
  • the write request may be received by both storage array controllers 110 C and 110 D of storage array 102 B.
  • Storage array controllers 110 C and 110 D facilitate the communication, e.g., send the write request to the appropriate storage drive 171 A-F. It may be noted that in some implementations storage processing modules may be used to increase the number of storage drives controlled by the primary and secondary controllers.
  • storage array controllers 110 A-D are communicatively coupled, via a midplane (not shown), to one or more storage drives 171 A-F and to one or more NVRAM devices (not shown) that are included as part of a storage array 102 A-B.
  • the storage array controllers 110 A-D may be coupled to the midplane via one or more data communication links and the midplane may be coupled to the storage drives 171 A-F and the NVRAM devices via one or more data communications links.
  • the data communications links described herein are collectively illustrated by data communications links 108 A-D and may include a Peripheral Component Interconnect Express (‘PCIe’) bus, for example.
  • PCIe Peripheral Component Interconnect Express
  • FIG. 1 B illustrates an example system for data storage, in accordance with some implementations.
  • Storage array controller 101 illustrated in FIG. 1 B may similar to the storage array controllers 110 A-D described with respect to FIG. 1 A .
  • storage array controller 101 may be similar to storage array controller 110 A or storage array controller 110 B.
  • Storage array controller 101 includes numerous elements for purposes of illustration rather than limitation. It may be noted that storage array controller 101 may include the same, more, or fewer elements configured in the same or different manner in other implementations. It may be noted that elements of FIG. 1 A may be included below to help illustrate features of storage array controller 101 .
  • Storage array controller 101 may include one or more processing devices 104 and random access memory (‘RAM’) 111 .
  • Processing device 104 represents one or more general-purpose processing devices such as a microprocessor, central processing unit, or the like. More particularly, the processing device 104 (or controller 101 ) may be a complex instruction set computing (‘CISC’) microprocessor, reduced instruction set computing (‘RISC’) microprocessor, very long instruction word (‘VLIW’) microprocessor, or a processor implementing other instruction sets or processors implementing a combination of instruction sets.
  • CISC complex instruction set computing
  • RISC reduced instruction set computing
  • VLIW very long instruction word
  • the processing device 104 may also be one or more special-purpose processing devices such as an application specific integrated circuit (‘ASIC’), a field programmable gate array (‘FPGA’), a digital signal processor (‘DSP’), network processor, or the like.
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • DSP digital signal processor
  • the processing device 104 may be connected to the RAM 111 via a data communications link 106 , which may be embodied as a high speed memory bus such as a Double-Data Rate 4 (‘DDR4’) bus.
  • a data communications link 106 Stored in RAM 111 is an operating system 112 .
  • instructions 113 are stored in RAM 111 .
  • Instructions 113 may include computer program instructions for performing operations in in a direct-mapped flash storage system.
  • a direct-mapped flash storage system is one that that addresses data blocks within flash drives directly and without an address translation performed by the storage controllers of the flash drives.
  • storage array controller 101 includes one or more host bus adapters 103 A-C that are coupled to the processing device 104 via a data communications link 105 A-C.
  • host bus adapters 103 A-C may be computer hardware that connects a host system (e.g., the storage array controller) to other network and storage arrays.
  • host bus adapters 103 A-C may be a Fibre Channel adapter that enables the storage array controller 101 to connect to a SAN, an Ethernet adapter that enables the storage array controller 101 to connect to a LAN, or the like.
  • Host bus adapters 103 A-C may be coupled to the processing device 104 via a data communications link 105 A-C such as, for example, a PCIe bus.
  • storage array controller 101 may include a host bus adapter 114 that is coupled to an expander 115 .
  • the expander 115 may be used to attach a host system to a larger number of storage drives.
  • the expander 115 may, for example, be a SAS expander utilized to enable the host bus adapter 114 to attach to storage drives in an implementation where the host bus adapter 114 is embodied as a SAS controller.
  • storage array controller 101 may include a switch 116 coupled to the processing device 104 via a data communications link 109 .
  • the switch 116 may be a computer hardware device that can create multiple endpoints out of a single endpoint, thereby enabling multiple devices to share a single endpoint.
  • the switch 116 may, for example, be a PCIe switch that is coupled to a PCIe bus (e.g., data communications link 109 ) and presents multiple PCIe connection points to the midplane.
  • storage array controller 101 includes a data communications link 107 for coupling the storage array controller 101 to other storage array controllers.
  • data communications link 107 may be a QuickPath Interconnect (QPI) interconnect.
  • QPI QuickPath Interconnect
  • a traditional storage system that uses traditional flash drives may implement a process across the flash drives that are part of the traditional storage system. For example, a higher level process of the storage system may initiate and control a process across the flash drives. However, a flash drive of the traditional storage system may include its own storage controller that also performs the process. Thus, for the traditional storage system, a higher level process (e.g., initiated by the storage system) and a lower level process (e.g., initiated by a storage controller of the storage system) may both be performed.
  • a higher level process e.g., initiated by the storage system
  • a lower level process e.g., initiated by a storage controller of the storage system
  • the flash storage system may include flash drives that do not include storage controllers that provide the process.
  • the operating system of the flash storage system itself may initiate and control the process. This may be accomplished by a direct-mapped flash storage system that addresses data blocks within the flash drives directly and without an address translation performed by the storage controllers of the flash drives.
  • the operating system of the flash storage system may identify and maintain a list of allocation units across multiple flash drives of the flash storage system.
  • the allocation units may be entire erase blocks or multiple erase blocks.
  • the operating system may maintain a map or address range that directly maps addresses to erase blocks of the flash drives of the flash storage system.
  • Direct mapping to the erase blocks of the flash drives may be used to rewrite data and erase data.
  • the operations may be performed on one or more allocation units that include a first data and a second data where the first data is to be retained and the second data is no longer being used by the flash storage system.
  • the operating system may initiate the process to write the first data to new locations within other allocation units and erasing the second data and marking the allocation units as being available for use for subsequent data.
  • the process may only be performed by the higher level operating system of the flash storage system without an additional lower level process being performed by controllers of the flash drives.
  • Advantages of the process being performed only by the operating system of the flash storage system include increased reliability of the flash drives of the flash storage system as unnecessary or redundant write operations are not being performed during the process.
  • One possible point of novelty here is the concept of initiating and controlling the process at the operating system of the flash storage system.
  • the process can be controlled by the operating system across multiple flash drives. This is contrast to the process being performed by a storage controller of a flash drive.
  • a storage system can consist of two storage array controllers that share a set of drives for failover purposes, or it could consist of a single storage array controller that provides a storage service that utilizes multiple drives, or it could consist of a distributed network of storage array controllers each with some number of drives or some amount of Flash storage where the storage array controllers in the network collaborate to provide a complete storage service and collaborate on various aspects of a storage service including storage allocation and garbage collection.
  • FIG. 1 C illustrates a third example system 117 for data storage in accordance with some implementations.
  • System 117 also referred to as “storage system” herein
  • storage system includes numerous elements for purposes of illustration rather than limitation. It may be noted that system 117 may include the same, more, or fewer elements configured in the same or different manner in other implementations.
  • system 117 includes a dual Peripheral Component Interconnect (‘PCI’) flash storage device 118 with separately addressable fast write storage.
  • System 117 may include a storage controller 119 .
  • storage controller 119 A-D may be a CPU, ASIC, FPGA, or any other circuitry that may implement control structures necessary according to the present disclosure.
  • system 117 includes flash memory devices (e.g., including flash memory devices 120 a - n ), operatively coupled to various channels of the storage device controller 119 .
  • Flash memory devices 120 a - n may be presented to the controller 119 A-D as an addressable collection of Flash pages, erase blocks, and/or control elements sufficient to allow the storage device controller 119 A-D to program and retrieve various aspects of the Flash.
  • storage device controller 119 A-D may perform operations on flash memory devices 120 a - n including storing and retrieving data content of pages, arranging and erasing any blocks, tracking statistics related to the use and reuse of Flash memory pages, erase blocks, and cells, tracking and predicting error codes and faults within the Flash memory, controlling voltage levels associated with programming and retrieving contents of Flash cells, etc.
  • system 117 may include RAM 121 to store separately addressable fast-write data.
  • RAM 121 may be one or more separate discrete devices.
  • RAM 121 may be integrated into storage device controller 119 A-D or multiple storage device controllers.
  • the RAM 121 may be utilized for other purposes as well, such as temporary program memory for a processing device (e.g., a CPU) in the storage device controller 119 .
  • system 117 may include a stored energy device 122 , such as a rechargeable battery or a capacitor.
  • Stored energy device 122 may store energy sufficient to power the storage device controller 119 , some amount of the RAM (e.g., RAM 121 ), and some amount of Flash memory (e.g., Flash memory 120 a - 120 n ) for sufficient time to write the contents of RAM to Flash memory.
  • storage device controller 119 A-D may write the contents of RAM to Flash Memory if the storage device controller detects loss of external power.
  • system 117 includes two data communications links 123 a , 123 b .
  • data communications links 123 a , 123 b may be PCI interfaces.
  • data communications links 123 a , 123 b may be based on other communications standards (e.g., HyperTransport, InfiniBand, etc.).
  • Data communications links 123 a , 123 b may be based on non-volatile memory express (‘NVMe’) or NVMe over fabrics (‘NVMf’) specifications that allow external connection to the storage device controller 119 A-D from other components in the storage system 117 .
  • NVMe non-volatile memory express
  • NVMf NVMe over fabrics
  • System 117 may also include an external power source (not shown), which may be provided over one or both data communications links 123 a , 123 b , or which may be provided separately.
  • An alternative embodiment includes a separate Flash memory (not shown) dedicated for use in storing the content of RAM 121 .
  • the storage device controller 119 A-D may present a logical device over a PCI bus which may include an addressable fast-write logical device, or a distinct part of the logical address space of the storage device 118 , which may be presented as PCI memory or as persistent storage. In one embodiment, operations to store into the device are directed into the RAM 121 . On power failure, the storage device controller 119 A-D may write stored content associated with the addressable fast-write logical storage to Flash memory (e.g., Flash memory 120 a - n ) for long-term persistent storage.
  • Flash memory e.g., Flash memory 120 a - n
  • the logical device may include some presentation of some or all of the content of the Flash memory devices 120 a - n , where that presentation allows a storage system including a storage device 118 (e.g., storage system 117 ) to directly address Flash memory pages and directly reprogram erase blocks from storage system components that are external to the storage device through the PCI bus.
  • the presentation may also allow one or more of the external components to control and retrieve other aspects of the Flash memory including some or all of: tracking statistics related to use and reuse of Flash memory pages, erase blocks, and cells across all the Flash memory devices; tracking and predicting error codes and faults within and across the Flash memory devices; controlling voltage levels associated with programming and retrieving contents of Flash cells; etc.
  • the stored energy device 122 may be sufficient to ensure completion of in-progress operations to the Flash memory devices 120 a - 120 n stored energy device 122 may power storage device controller 119 A-D and associated Flash memory devices (e.g., 120 a - n ) for those operations, as well as for the storing of fast-write RAM to Flash memory.
  • Stored energy device 122 may be used to store accumulated statistics and other parameters kept and tracked by the Flash memory devices 120 a - n and/or the storage device controller 119 .
  • Separate capacitors or stored energy devices (such as smaller capacitors near or embedded within the Flash memory devices themselves) may be used for some or all of the operations described herein.
  • Various schemes may be used to track and optimize the life span of the stored energy component, such as adjusting voltage levels over time, partially discharging the storage energy device 122 to measure corresponding discharge characteristics, etc. If the available energy decreases over time, the effective available capacity of the addressable fast-write storage may be decreased to ensure that it can be written safely based on the currently available stored energy.
  • FIG. 1 D illustrates a third example system 124 for data storage in accordance with some implementations.
  • system 124 includes storage controllers 125 a , 125 b .
  • storage controllers 125 a , 125 b are operatively coupled to Dual PCI storage devices 119 a , 119 b and 119 c , 119 d , respectively.
  • Storage controllers 125 a , 125 b may be operatively coupled (e.g., via a storage network 130 ) to some number of host computers 127 a - n.
  • two storage controllers provide storage services, such as a SCS) block storage array, a file server, an object server, a database or data analytics service, etc.
  • the storage controllers 125 a , 125 b may provide services through some number of network interfaces (e.g., 126 a - d ) to host computers 127 a - n outside of the storage system 124 .
  • Storage controllers 125 a , 125 b may provide integrated services or an application entirely within the storage system 124 , forming a converged storage and compute system.
  • the storage controllers 125 a , 125 b may utilize the fast write memory within or across storage devices 119 a - d to journal in progress operations to ensure the operations are not lost on a power failure, storage controller removal, storage controller or storage system shutdown, or some fault of one or more software or hardware components within the storage system 124 .
  • controllers 125 a , 125 b operate as PCI masters to one or the other PCI buses 128 a , 128 b .
  • 128 a and 128 b may be based on other communications standards (e.g., HyperTransport, InfiniBand, etc.).
  • Other storage system embodiments may operate storage controllers 125 a , 125 b as multi-masters for both PCI buses 128 a , 128 b .
  • a PCI/NVMe/NVMf switching infrastructure or fabric may connect multiple storage controllers.
  • Some storage system embodiments may allow storage devices to communicate with each other directly rather than communicating only with storage controllers.
  • a storage device controller 119 a may be operable under direction from a storage controller 125 a to synthesize and transfer data to be stored into Flash memory devices from data that has been stored in RAM (e.g., RAM 121 of FIG. 1 C ).
  • RAM e.g., RAM 121 of FIG. 1 C
  • a recalculated version of RAM content may be transferred after a storage controller has determined that an operation has fully committed across the storage system, or when fast-write memory on the device has reached a certain used capacity, or after a certain amount of time, to ensure improve safety of the data or to release addressable fast-write capacity for reuse.
  • This mechanism may be used, for example, to avoid a second transfer over a bus (e.g., 128 a , 128 b ) from the storage controllers 125 a , 125 b .
  • a recalculation may include compressing data, attaching indexing or other metadata, combining multiple data segments together, performing erasure code calculations, etc.
  • a storage device controller 119 a , 119 b may be operable to calculate and transfer data to other storage devices from data stored in RAM (e.g., RAM 121 of FIG. 1 C ) without involvement of the storage controllers 125 a , 125 b .
  • This operation may be used to mirror data stored in one controller 125 a to another controller 125 b , or it could be used to offload compression, data aggregation, and/or erasure coding calculations and transfers to storage devices to reduce load on storage controllers or the storage controller interface 129 a , 129 b to the PCI bus 128 a , 128 b.
  • a storage device controller 119 A-D may include mechanisms for implementing high availability primitives for use by other parts of a storage system external to the Dual PCI storage device 118 .
  • reservation or exclusion primitives may be provided so that, in a storage system with two storage controllers providing a highly available storage service, one storage controller may prevent the other storage controller from accessing or continuing to access the storage device. This could be used, for example, in cases where one controller detects that the other controller is not functioning properly or where the interconnect between the two storage controllers may itself not be functioning properly.
  • a storage system for use with Dual PCI direct mapped storage devices with separately addressable fast write storage includes systems that manage erase blocks or groups of erase blocks as allocation units for storing data on behalf of the storage service, or for storing metadata (e.g., indexes, logs, etc.) associated with the storage service, or for proper management of the storage system itself.
  • Flash pages which may be a few kilobytes in size, may be written as data arrives or as the storage system is to persist data for long intervals of time (e.g., above a defined threshold of time).
  • the storage controllers may first write data into the separately addressable fast write storage on one more storage devices.
  • the storage controllers 125 a , 125 b may initiate the use of erase blocks within and across storage devices (e.g., 118 ) in accordance with an age and expected remaining lifespan of the storage devices, or based on other statistics.
  • the storage controllers 125 a , 125 b may initiate garbage collection and data migration data between storage devices in accordance with pages that are no longer needed as well as to manage Flash page and erase block lifespans and to manage overall system performance.
  • the storage system 124 may utilize mirroring and/or erasure coding schemes as part of storing data into addressable fast write storage and/or as part of writing data into allocation units associated with erase blocks. Erasure codes may be used across storage devices, as well as within erase blocks or allocation units, or within and across Flash memory devices on a single storage device, to provide redundancy against single or multiple storage device failures or to protect against internal corruptions of Flash memory pages resulting from Flash memory operations or from degradation of Flash memory cells. Mirroring and erasure coding at various levels may be used to recover from multiple types of failures that occur separately or in combination.
  • FIGS. 2 A-G illustrate 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, or across multiple 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.
  • a storage node may be referred to as a cluster node, a blade, or a server.
  • the storage cluster may be 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.
  • 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 PCIe, 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.
  • the external communication bus uses different communication bus technologies for inter-chassis and client communication.
  • the switch may act as a translation between multiple protocols or technologies.
  • 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.
  • multiple chassis may be coupled or connected to each other through an aggregator switch.
  • a portion and/or all of the coupled or connected chassis may be designated as a storage cluster.
  • each chassis can have multiple blades, each blade has a media access control (‘MAC’) address, but the storage cluster is presented to an external network as having a single cluster IP address and a single MAC address in some embodiments.
  • MAC media access control
  • 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, 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 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.
  • 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.
  • 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.
  • MRAM magnetoresistive random access memory
  • 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.
  • FIG. 2 A is a perspective view of a storage cluster 161 , 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 161 , 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 161 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 161 has a chassis 138 having multiple slots 142 .
  • chassis 138 may be referred to as a housing, enclosure, or rack unit.
  • 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.
  • 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.
  • 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 includes restoring redundancy and/or rebalancing data or load.
  • Each storage node 150 can have multiple components.
  • the storage node 150 includes a printed circuit board 159 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 .
  • the non-volatile solid state storage 152 includes flash or, in further embodiments, other types of solid-state memory.
  • storage cluster 161 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.
  • a storage node 150 can have any multiple of 4 TB, e.g., 8 TB, 12 TB, 16 TB, 32 TB, etc.
  • 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 B is a block diagram showing a communications interconnect 173 and power distribution bus 172 coupling multiple storage nodes 150 .
  • the communications interconnect 173 can be included in or implemented with the switch fabric 146 in some embodiments. Where multiple storage clusters 161 occupy a rack, the communications interconnect 173 can be included in or implemented with a top of rack switch, in some embodiments. As illustrated in FIG. 2 B , storage cluster 161 is enclosed within a single chassis 138 .
  • External port 176 is coupled to storage nodes 150 through communications interconnect 173 , 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. 2 A .
  • one or more storage nodes 150 may be a compute only storage node as illustrated in FIG. 2 B .
  • 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 .
  • 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 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.
  • authorities 168 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 .
  • 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.
  • 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.
  • 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 .
  • 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.
  • the first stage maps an entity identifier (ID), e.g., a segment number, inode number, or directory number to an authority identifier.
  • ID entity 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.
  • 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.
  • two of the many tasks of the CPU 156 on a storage node 150 are to break up write data, and reassemble read data.
  • the authority 168 for that data is located as above.
  • 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.
  • data is requested to be pulled, and in other embodiments, data is pushed.
  • 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.
  • 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.
  • 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.
  • data segments are handled with a segment number assigned elsewhere.
  • 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.
  • 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 FIGS. 2 E and 2 G ) 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.
  • the directory entries file names which link to an inode.
  • Inodes 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.
  • 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.
  • 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’).
  • 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.
  • 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.
  • rebalancing algorithms attempt to store the copies of all entities within an authority in the same layout and on the same set of machines.
  • 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.
  • 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.
  • the placement of data for storage redundancy is independent of the placement of authorities for data consistency.
  • 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.
  • 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.
  • 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).
  • 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.
  • the system transfers messages between the storage nodes and non-volatile solid state storage units.
  • 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.
  • the persistent messages are being processed, the messages are temporarily stored in multiple durable and non-durable storage hardware technologies.
  • 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.
  • 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, i.e., the system supports non-disruptive upgrades.
  • 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. 2 C 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.
  • NIC network interface controller
  • Each storage node 150 has a CPU 156 , and one or more non-volatile solid state storage 152 , as discussed above.
  • 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 .
  • NVRAM nonvolatile random access memory
  • 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.
  • DRAM dynamic random access memory
  • 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.
  • 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.
  • 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 .
  • DMA direct memory access unit
  • 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).
  • PLD programmable logic device
  • FPGA field programmable gate array
  • 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 .
  • other types of solid-state memory are used in place of, or in addition to flash memory illustrated within flash die 222 .
  • Storage clusters 161 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 161 .
  • 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.
  • 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. 2 D shows a storage server environment, which uses embodiments of the storage nodes 150 and storage units 152 of FIGS. 2 A-C .
  • each storage unit 152 has a processor such as controller 212 (see FIG. 2 C ), an FPGA (field programmable gate array), flash memory 206 , and NVRAM 204 (which is super-capacitor backed DRAM 216 , see FIGS. 2 B and 2 C ) on a PCIe (peripheral component interconnect express) board in a chassis 138 (see FIG. 2 A ).
  • 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 168 independently. Each device provides an amount of storage space to each authority 168 . That authority 168 further manages lifetimes and allocations within that space. Examples of a spool include distributed transactions or notions.
  • 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 .
  • the responsibility of the logical “controller” is distributed across each of the blades containing authorities 168 .
  • This distribution of logical control is shown in FIG. 2 D as a host controller 242 , mid-tier controller 244 and storage unit controller(s) 246 . 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 168 effectively serves as an independent controller.
  • Each authority 168 provides its own data and metadata structures, its own background workers, and maintains its own lifecycle.
  • FIG. 2 E is a blade 252 hardware block diagram, showing a control plane 254 , compute and storage planes 256 , 258 , and authorities 168 interacting with underlying physical resources, using embodiments of the storage nodes 150 and storage units 152 of FIGS. 2 A-C in the storage server environment of FIG. 2 D .
  • the control plane 254 is partitioned into a number of authorities 168 which can use the compute resources in the compute plane 256 to run on any of the blades 252 .
  • the storage plane 258 is partitioned into a set of devices, each of which provides access to flash 206 and NVRAM 204 resources.
  • the compute plane 256 may perform the operations of a storage array controller, as described herein, on one or more devices of the storage plane 258 (e.g., a storage array).
  • the authorities 168 interact with the underlying physical resources (i.e., devices). From the point of view of an authority 168 , its resources are striped over all of the physical devices. From the point of view of a device, it provides resources to all authorities 168 , irrespective of where the authorities happen to run.
  • Each authority 168 has allocated or has been allocated one or more partitions 260 of storage memory in the storage units 152 , e.g. partitions 260 in flash memory 206 and NVRAM 204 . Each authority 168 uses those allocated partitions 260 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 168 could have a larger number of partitions 260 or larger sized partitions 260 in one or more storage units 152 than one or more other authorities 168 .
  • FIG. 2 F depicts elasticity software layers in blades 252 of a storage cluster, in accordance with some embodiments.
  • elasticity software is symmetric, i.e., each blade's compute module 270 runs the three identical layers of processes depicted in FIG. 2 F .
  • Storage managers 274 execute read and write requests from other blades 252 for data and metadata stored in local storage unit 152 NVRAM 204 and flash 206 .
  • Authorities 168 fulfill client requests by issuing the necessary reads and writes to the blades 252 on whose storage units 152 the corresponding data or metadata resides.
  • Endpoints 272 parse client connection requests received from switch fabric 146 supervisory software, relay the client connection requests to the authorities 168 responsible for fulfillment, and relay the authorities' 168 responses to clients.
  • the symmetric three-layer structure enables the storage system's high degree of concurrency. Elasticity scales out efficiently and reliably in these embodiments. In addition, elasticity implements a unique scale-out technique that balances work evenly across all resources regardless of client access pattern, and maximizes concurrency by eliminating much of the need for inter-blade coordination that typically occurs with conventional distributed locking.
  • authorities 168 running in the compute modules 270 of a blade 252 perform the internal operations required to fulfill client requests.
  • authorities 168 are stateless, i.e., they cache active data and metadata in their own blades' 252 DRAMs for fast access, but the authorities store every update in their NVRAM 204 partitions on three separate blades 252 until the update has been written to flash 206 . All the storage system writes to NVRAM 204 are in triplicate to partitions on three separate blades 252 in some embodiments. With triple-mirrored NVRAM 204 and persistent storage protected by parity and Reed-Solomon RAID checksums, the storage system can survive concurrent failure of two blades 252 with no loss of data, metadata, or access to either.
  • authorities 168 are stateless, they can migrate between blades 252 .
  • Each authority 168 has a unique identifier.
  • NVRAM 204 and flash 206 partitions are associated with authorities' 168 identifiers, not with the blades 252 on which they are running in some.
  • the authority 168 continues to manage the same storage partitions from its new location.
  • the system automatically rebalances load by: partitioning the new blade's 252 storage for use by the system's authorities 168 , migrating selected authorities 168 to the new blade 252 , starting endpoints 272 on the new blade 252 and including them in the switch fabric's 146 client connection distribution algorithm.
  • migrated authorities 168 persist the contents of their NVRAM 204 partitions on flash 206 , process read and write requests from other authorities 168 , and fulfill the client requests that endpoints 272 direct to them. Similarly, if a blade 252 fails or is removed, the system redistributes its authorities 168 among the system's remaining blades 252 . The redistributed authorities 168 continue to perform their original functions from their new locations.
  • FIG. 2 G depicts authorities 168 and storage resources in blades 252 of a storage cluster, in accordance with some embodiments.
  • Each authority 168 is exclusively responsible for a partition of the flash 206 and NVRAM 204 on each blade 252 .
  • the authority 168 manages the content and integrity of its partitions independently of other authorities 168 .
  • Authorities 168 compress incoming data and preserve it temporarily in their NVRAM 204 partitions, and then consolidate, RAID-protect, and persist the data in segments of the storage in their flash 206 partitions. As the authorities 168 write data to flash 206 , storage managers 274 perform the necessary flash translation to optimize write performance and maximize media longevity.
  • authorities 168 “garbage collect,” or reclaim space occupied by data that clients have made obsolete by overwriting the data. It should be appreciated that since authorities' 168 partitions are disjoint, there is no need for distributed locking to execute client and writes or to perform background functions.
  • the embodiments described herein may utilize various software, communication and/or networking protocols.
  • the configuration of the hardware and/or software may be adjusted to accommodate various protocols.
  • the embodiments may utilize Active Directory, which is a database based system that provides authentication, directory, policy, and other services in a WINDOWSTM environment.
  • LDAP Lightweight Directory Access Protocol
  • a network lock manager (‘NLM’) is utilized as a facility that works in cooperation with the Network File System (‘NFS’) to provide a System V style of advisory file and record locking over a network.
  • NLM network lock manager
  • SMB Server Message Block
  • CIFS Common Internet File System
  • SMP operates as an application-layer network protocol typically used for providing shared access to files, printers, and serial ports and miscellaneous communications between nodes on a network.
  • SMB also provides an authenticated inter-process communication mechanism.
  • AMAZONTM S3 Simple Storage Service
  • REST representational state transfer
  • SOAP simple object access protocol
  • BitTorrent BitTorrent
  • Each module addresses a particular underlying part of the transaction.
  • the control or permissions provided with these embodiments, especially for object data, may include utilization of an access control list (ACL).
  • ACL is a list of permissions attached to an object and the ACL specifies which users or system processes are granted access to objects, as well as what operations are allowed on given objects.
  • the systems may utilize Internet Protocol version 6 (‘IPv6’), as well as IPv4, for the communications protocol that provides an identification and location system for computers on networks and routes traffic across the Internet.
  • IPv6 Internet Protocol version 6
  • IPv4 Internet Protocol version 6
  • the routing of packets between networked systems may include Equal-cost multi-path routing (‘ECMP’), which is a routing strategy where next-hop packet forwarding to a single destination can occur over multiple “best paths” which tie for top place in routing metric calculations.
  • ECMP Equal-cost multi-path routing
  • Multi-path routing can be used in conjunction with most routing protocols, because it is a per-hop decision limited to a single router.
  • the software may support Multi-tenancy, which is an architecture in which a single instance of a software application serves multiple customers. Each customer may be referred to as a tenant. Tenants may be given the ability to customize some parts of the application, but may not customize the application's code, in some embodiments.
  • the embodiments may maintain audit logs.
  • An audit log is a document that records an event in a computing system. In addition to documenting what resources were accessed, audit log entries typically include destination and source addresses, a timestamp, and user login information for compliance with various regulations.
  • the embodiments may support various key management policies, such as encryption key rotation.
  • the system may support dynamic root passwords or some variation dynamically changing passwords.
  • FIG. 3 A sets forth a diagram of a storage system 306 that is coupled for data communications with a cloud services provider 302 in accordance with some embodiments of the present disclosure.
  • the storage system 306 depicted in FIG. 3 A may be similar to the storage systems described above with reference to FIGS. 1 A- 1 D and FIGS. 2 A- 2 G .
  • the storage system 306 depicted in FIG. 3 A may be similar to the storage systems described above with reference to FIGS. 1 A- 1 D and FIGS. 2 A- 2 G .
  • 3 A may be embodied as a storage system that includes imbalanced active/active controllers, as a storage system that includes balanced active/active controllers, as a storage system that includes active/active controllers where less than all of each controller's resources are utilized such that each controller has reserve resources that may be used to support failover, as a storage system that includes fully active/active controllers, as a storage system that includes dataset-segregated controllers, as a storage system that includes dual-layer architectures with front-end controllers and back-end integrated storage controllers, as a storage system that includes scale-out clusters of dual-controller arrays, as well as combinations of such embodiments.
  • the storage system 306 is coupled to the cloud services provider 302 via a data communications link 304 .
  • the data communications link 304 may be embodied as a dedicated data communications link, as a data communications pathway that is provided through the use of one or data communications networks such as a wide area network (‘WAN’) or local area network (‘LAN’), or as some other mechanism capable of transporting digital information between the storage system 306 and the cloud services provider 302 .
  • WAN wide area network
  • LAN local area network
  • Such a data communications link 304 may be fully wired, fully wireless, or some aggregation of wired and wireless data communications pathways.
  • digital information may be exchanged between the storage system 306 and the cloud services provider 302 via the data communications link 304 using one or more data communications protocols.
  • digital information may be exchanged between the storage system 306 and the cloud services provider 302 via the data communications link 304 using the handheld device transfer protocol (‘HDTP’), hypertext transfer protocol (‘HTTP’), internet protocol (‘IP’), real-time transfer protocol (‘RTP’), transmission control protocol (‘TCP’), user datagram protocol (‘UDP’), wireless application protocol (‘WAP’), or other protocol.
  • HDTP handheld device transfer protocol
  • HTTP hypertext transfer protocol
  • IP internet protocol
  • RTP real-time transfer protocol
  • TCP transmission control protocol
  • UDP user datagram protocol
  • WAP wireless application protocol
  • the cloud services provider 302 depicted in FIG. 3 A may be embodied, for example, as a system and computing environment that provides services to users of the cloud services provider 302 through the sharing of computing resources via the data communications link 304 .
  • the cloud services provider 302 may provide on-demand access to a shared pool of configurable computing resources such as computer networks, servers, storage, applications and services, and so on.
  • the shared pool of configurable resources may be rapidly provisioned and released to a user of the cloud services provider 302 with minimal management effort.
  • the user of the cloud services provider 302 is unaware of the exact computing resources utilized by the cloud services provider 302 to provide the services.
  • a cloud services provider 302 may be accessible via the Internet, readers of skill in the art will recognize that any system that abstracts the use of shared resources to provide services to a user through any data communications link may be considered a cloud services provider 302 .
  • the cloud services provider 302 may be configured to provide a variety of services to the storage system 306 and users of the storage system 306 through the implementation of various service models.
  • the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of an infrastructure as a service (‘IaaS’) service model where the cloud services provider 302 offers computing infrastructure such as virtual machines and other resources as a service to subscribers.
  • the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a platform as a service (‘PaaS’) service model where the cloud services provider 302 offers a development environment to application developers.
  • IaaS infrastructure as a service
  • PaaS platform as a service
  • Such a development environment may include, for example, an operating system, programming-language execution environment, database, web server, or other components that may be utilized by application developers to develop and run software solutions on a cloud platform.
  • the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a software as a service (‘SaaS’) service model where the cloud services provider 302 offers application software, databases, as well as the platforms that are used to run the applications to the storage system 306 and users of the storage system 306 , providing the storage system 306 and users of the storage system 306 with on-demand software and eliminating the need to install and run the application on local computers, which may simplify maintenance and support of the application.
  • SaaS software as a service
  • the cloud services provider 302 may be further configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of an authentication as a service (‘AaaS’) service model where the cloud services provider 302 offers authentication services that can be used to secure access to applications, data sources, or other resources.
  • the cloud services provider 302 may also be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a storage as a service model where the cloud services provider 302 offers access to its storage infrastructure for use by the storage system 306 and users of the storage system 306 .
  • the cloud services provider 302 may be configured to provide additional services to the storage system 306 and users of the storage system 306 through the implementation of additional service models, as the service models described above are included only for explanatory purposes and in no way represent a limitation of the services that may be offered by the cloud services provider 302 or a limitation as to the service models that may be implemented by the cloud services provider 302 .
  • the cloud services provider 302 may be embodied, for example, as a private cloud, as a public cloud, or as a combination of a private cloud and public cloud.
  • the cloud services provider 302 may be dedicated to providing services to a single organization rather than providing services to multiple organizations.
  • the cloud services provider 302 may provide services to multiple organizations.
  • Public cloud and private cloud deployment models may differ and may come with various advantages and disadvantages.
  • the cloud services provider 302 may be embodied as a mix of a private and public cloud services with a hybrid cloud deployment.
  • the storage system 306 may be coupled to (or even include) a cloud storage gateway.
  • a cloud storage gateway may be embodied, for example, as hardware-based or software-based appliance that is located on premise with the storage system 306 .
  • Such a cloud storage gateway may operate as a bridge between local applications that are executing on the storage array 306 and remote, cloud-based storage that is utilized by the storage array 306 .
  • a cloud storage gateway may be configured to emulate a disk array, a block-based device, a file server, or other storage system that can translate the SCSI commands, file server commands, or other appropriate command into REST-space protocols that facilitate communications with the cloud services provider 302 .
  • a cloud migration process may take place during which data, applications, or other elements from an organization's local systems (or even from another cloud environment) are moved to the cloud services provider 302 .
  • middleware such as a cloud migration tool may be utilized to bridge gaps between the cloud services provider's 302 environment and an organization's environment.
  • cloud migration tools may also be configured to address potentially high network costs and long transfer times associated with migrating large volumes of data to the cloud services provider 302 , as well as addressing security concerns associated with sensitive data to the cloud services provider 302 over data communications networks.
  • a cloud orchestrator may also be used to arrange and coordinate automated tasks in pursuit of creating a consolidated process or workflow.
  • Such a cloud orchestrator may perform tasks such as configuring various components, whether those components are cloud components or on-premises components, as well as managing the interconnections between such components.
  • the cloud orchestrator can simplify the inter-component communication and connections to ensure that links are correctly configured and maintained.
  • the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the usage of a SaaS service model where the cloud services provider 302 offers application software, databases, as well as the platforms that are used to run the applications to the storage system 306 and users of the storage system 306 , providing the storage system 306 and users of the storage system 306 with on-demand software and eliminating the need to install and run the application on local computers, which may simplify maintenance and support of the application.
  • Such applications may take many forms in accordance with various embodiments of the present disclosure.
  • the cloud services provider 302 may be configured to provide access to data analytics applications to the storage system 306 and users of the storage system 306 .
  • data analytics applications may be configured, for example, to receive telemetry data phoned home by the storage system 306 .
  • Such telemetry data may describe various operating characteristics of the storage system 306 and may be analyzed, for example, to determine the health of the storage system 306 , to identify workloads that are executing on the storage system 306 , to predict when the storage system 306 will run out of various resources, to recommend configuration changes, hardware or software upgrades, workflow migrations, or other actions that may improve the operation of the storage system 306 .
  • the cloud services provider 302 may also be configured to provide access to virtualized computing environments to the storage system 306 and users of the storage system 306 .
  • virtualized computing environments may be embodied, for example, as a virtual machine or other virtualized computer hardware platforms, virtual storage devices, virtualized computer network resources, and so on. Examples of such virtualized environments can include virtual machines that are created to emulate an actual computer, virtualized desktop environments that separate a logical desktop from a physical machine, virtualized file systems that allow uniform access to different types of concrete file systems, and many others.
  • FIG. 3 B sets forth a diagram of a storage system 306 in accordance with some embodiments of the present disclosure.
  • the storage system 306 depicted in FIG. 3 B may be similar to the storage systems described above with reference to FIGS. 1 A- 1 D and FIGS. 2 A- 2 G as the storage system may include many of the components described above.
  • the storage system 306 depicted in FIG. 3 B may include storage resources 308 , which may be embodied in many forms.
  • the storage resources 308 can include nano-RAM or another form of nonvolatile random access memory that utilizes carbon nanotubes deposited on a substrate.
  • the storage resources 308 may include 3D crosspoint non-volatile memory in which bit storage is based on a change of bulk resistance, in conjunction with a stackable cross-gridded data access array.
  • the storage resources 308 may include flash memory, including single-level cell (‘SLC’) NAND flash, multi-level cell (‘MLC’) NAND flash, triple-level cell (‘TLC’) NAND flash, quad-level cell (‘QLC’) NAND flash, and others.
  • the storage resources 308 may include non-volatile magnetoresistive random-access memory (‘MRAM’), including spin transfer torque (‘STT’) MRAM, in which data is stored through the use of magnetic storage elements.
  • MRAM non-volatile magnetoresistive random-access memory
  • STT spin transfer torque
  • the example storage resources 308 may include non-volatile phase-change memory (‘PCM’) that may have the ability to hold multiple bits in a single cell as cells can achieve a number of distinct intermediary states.
  • PCM non-volatile phase-change memory
  • the storage resources 308 may include quantum memory that allows for the storage and retrieval of photonic quantum information.
  • the example storage resources 308 may include resistive random-access memory (‘ReRAM’) in which data is stored by changing the resistance across a dielectric solid-state material.
  • the storage resources 308 may include storage class memory (‘SCM’) in which solid-state nonvolatile memory may be manufactured at a high density using some combination of sub-lithographic patterning techniques, multiple bits per cell, multiple layers of devices, and so on. Readers will appreciate that other forms of computer memories and storage devices may be utilized by the storage systems described above, including DRAM, SRAM, EEPROM, universal memory, and many others.
  • 3 A may be embodied in a variety of form factors, including but not limited to, dual in-line memory modules (‘DIMMs’), non-volatile dual in-line memory modules (‘NVDIMMs’), M.2, U.2, and others.
  • DIMMs dual in-line memory modules
  • NVDIMMs non-volatile dual in-line memory modules
  • the storage resources 308 depicted in FIG. 3 A may include various forms of storage-class memory (‘SCM’).
  • SCM may effectively treat fast, non-volatile memory (e.g., NAND flash) as an extension of DRAM such that an entire dataset may be treated as an in-memory dataset that resides entirely in DRAM.
  • SCM may include non-volatile media such as, for example, NAND flash.
  • NAND flash may be accessed utilizing NVMe that can use the PCIe bus as its transport, providing for relatively low access latencies compared to older protocols.
  • the network protocols used for SSDs in all-flash arrays can include NVMe using Ethernet (ROCE, NVME TCP), Fibre Channel (NVMe FC), InfiniBand (iWARP), and others that make it possible to treat fast, non-volatile memory as an extension of DRAM.
  • a controller software/hardware stack may be needed to convert the block data to the bytes that are stored in the media. Examples of media and software that may be used as SCM can include, for example, 3D XPoint, Intel Memory Drive Technology, Samsung's Z-SSD, and others.
  • the example storage system 306 depicted in FIG. 3 B may implement a variety of storage architectures.
  • storage systems in accordance with some embodiments of the present disclosure may utilize block storage where data is stored in blocks, and each block essentially acts as an individual hard drive.
  • Storage systems in accordance with some embodiments of the present disclosure may utilize object storage, where data is managed as objects. Each object may include the data itself, a variable amount of metadata, and a globally unique identifier, where object storage can be implemented at multiple levels (e.g., device level, system level, interface level).
  • Storage systems in accordance with some embodiments of the present disclosure utilize file storage in which data is stored in a hierarchical structure. Such data may be saved in files and folders, and presented to both the system storing it and the system retrieving it in the same format.
  • the example storage system 306 depicted in FIG. 3 B may be embodied as a storage system in which additional storage resources can be added through the use of a scale-up model, additional storage resources can be added through the use of a scale-out model, or through some combination thereof.
  • additional storage may be added by adding additional storage devices.
  • additional storage nodes may be added to a cluster of storage nodes, where such storage nodes can include additional processing resources, additional networking resources, and so on.
  • the storage system 306 depicted in FIG. 3 B also includes communications resources 310 that may be useful in facilitating data communications between components within the storage system 306 , as well as data communications between the storage system 306 and computing devices that are outside of the storage system 306 .
  • the communications resources 310 may be configured to utilize a variety of different protocols and data communication fabrics to facilitate data communications between components within the storage systems as well as computing devices that are outside of the storage system.
  • the communications resources 310 can include fibre channel (‘FC’) technologies such as FC fabrics and FC protocols that can transport SCSI commands over FC networks.
  • FCoE’ FC over ethernet
  • the communications resources 310 can also include InfiniBand (‘IB’) technologies in which a switched fabric topology is utilized to facilitate transmissions between channel adapters.
  • the communications resources 310 can also include NVM Express (‘NVMe’) technologies and NVMe over fabrics (‘NVMeoF’) technologies through which non-volatile storage media attached via a PCI express (‘PCIe’) bus may be accessed.
  • NVMe NVM Express
  • NVMeoF NVMe over fabrics
  • the communications resources 310 can also include mechanisms for accessing storage resources 308 within the storage system 306 utilizing serial attached SCSI (‘SAS’), serial ATA (‘SATA’) bus interfaces for connecting storage resources 308 within the storage system 306 to host bus adapters within the storage system 306 , internet small computer systems interface (‘iSCSI’) technologies to provide block-level access to storage resources 308 within the storage system 306 , and other communications resources that that may be useful in facilitating data communications between components within the storage system 306 , as well as data communications between the storage system 306 and computing devices that are outside of the storage system 306 .
  • SAS serial attached SCSI
  • SATA serial ATA
  • iSCSI internet small computer systems interface
  • the storage system 306 depicted in FIG. 3 B also includes processing resources 312 that may be useful in useful in executing computer program instructions and performing other computational tasks within the storage system 306 .
  • the processing resources 312 may include one or more application-specific integrated circuits (‘ASICs’) that are customized for some particular purpose as well as one or more central processing units (‘CPUs’).
  • the processing resources 312 may also include one or more digital signal processors (‘DSPs’), one or more field-programmable gate arrays (‘FPGAs’), one or more systems on a chip (‘SoCs’), or other form of processing resources 312 .
  • DSPs digital signal processors
  • FPGAs field-programmable gate arrays
  • SoCs systems on a chip
  • the storage system 306 may utilize the storage resources 312 to perform a variety of tasks including, but not limited to, supporting the execution of software resources 314 that will be described in greater detail below.
  • the storage system 306 depicted in FIG. 3 B also includes software resources 314 that, when executed by processing resources 312 within the storage system 306 , may perform various tasks.
  • the software resources 314 may include, for example, one or more modules of computer program instructions that when executed by processing resources 312 within the storage system 306 are useful in carrying out various data protection techniques to preserve the integrity of data that is stored within the storage systems. Readers will appreciate that such data protection techniques may be carried out, for example, by system software executing on computer hardware within the storage system, by a cloud services provider, or in other ways.
  • Such data protection techniques can include, for example, data archiving techniques that cause data that is no longer actively used to be moved to a separate storage device or separate storage system for long-term retention, data backup techniques through which data stored in the storage system may be copied and stored in a distinct location to avoid data loss in the event of equipment failure or some other form of catastrophe with the storage system, data replication techniques through which data stored in the storage system is replicated to another storage system such that the data may be accessible via multiple storage systems, data snapshotting techniques through which the state of data within the storage system is captured at various points in time, data and database cloning techniques through which duplicate copies of data and databases may be created, and other data protection techniques.
  • data protection techniques business continuity and disaster recovery objectives may be met as a failure of the storage system may not result in the loss of data stored in the storage system.
  • the software resources 314 may also include software that is useful in implementing software-defined storage (‘SDS’).
  • the software resources 314 may include one or more modules of computer program instructions that, when executed, are useful in policy-based provisioning and management of data storage that is independent of the underlying hardware.
  • Such software resources 314 may be useful in implementing storage virtualization to separate the storage hardware from the software that manages the storage hardware.
  • the software resources 314 may also include software that is useful in facilitating and optimizing I/O operations that are directed to the storage resources 308 in the storage system 306 .
  • the software resources 314 may include software modules that perform carry out various data reduction techniques such as, for example, data compression, data deduplication, and others.
  • the software resources 314 may include software modules that intelligently group together I/O operations to facilitate better usage of the underlying storage resource 308 , software modules that perform data migration operations to migrate from within a storage system, as well as software modules that perform other functions.
  • Such software resources 314 may be embodied as one or more software containers or in many other ways.
  • FIG. 3 C sets forth an example of a cloud-based storage system 318 in accordance with some embodiments of the present disclosure.
  • the cloud-based storage system 318 is created entirely in a cloud computing environment 316 such as, for example, Amazon Web Services (‘AWS’), Microsoft Azure, Google Cloud Platform, IBM Cloud, Oracle Cloud, and others.
  • AWS Amazon Web Services
  • Azure Microsoft Azure
  • Google Cloud Platform IBM Cloud
  • IBM Cloud IBM Cloud
  • Oracle Cloud Oracle Cloud
  • the cloud-based storage system 318 may be used to provide block storage services to users of the cloud-based storage system 318
  • the cloud-based storage system 318 may be used to provide storage services to users of the cloud-based storage system 318 through the use of solid-state storage, and so on.
  • the cloud-based storage system 318 depicted in FIG. 3 C includes two cloud computing instances 320 , 322 that each are used to support the execution of a storage controller application 324 , 326 .
  • the cloud computing instances 320 , 322 may be embodied, for example, as instances of cloud computing resources (e.g., virtual machines) that may be provided by the cloud computing environment 316 to support the execution of software applications such as the storage controller application 324 , 326 .
  • the cloud computing instances 320 , 322 may be embodied as Amazon Elastic Compute Cloud (‘EC2’) instances.
  • an Amazon Machine Image (‘AMI’) that includes the storage controller application 324 , 326 may be booted to create and configure a virtual machine that may execute the storage controller application 324 , 326 .
  • the storage controller application 324 , 326 may be embodied as a module of computer program instructions that, when executed, carries out various storage tasks.
  • the storage controller application 324 , 326 may be embodied as a module of computer program instructions that, when executed, carries out the same tasks as the controllers 110 A, 110 B in FIG.
  • cloud computing instances 320 , 322 that each include the storage controller application 324 , 326
  • one cloud computing instance 320 may operate as the primary controller as described above while the other cloud computing instance 322 may operate as the secondary controller as described above.
  • the cloud computing instance 320 that operates as the primary controller may be deployed on a relatively high-performance and relatively expensive cloud computing instance while the cloud computing instance 322 that operates as the secondary controller may be deployed on a relatively low-performance and relatively inexpensive cloud computing instance.
  • the storage controller application 324 , 326 depicted in FIG. 3 C may include identical source code that is executed within different cloud computing instances 320 , 322 .
  • the cloud computing environment 316 is embodied as AWS and the cloud computing instances are embodied as EC2 instances.
  • AWS offers many types of EC2 instances.
  • AWS offers a suite of general purpose EC2 instances that include varying levels of memory and processing power.
  • the cloud computing instance 320 that operates as the primary controller may be deployed on one of the instance types that has a relatively large amount of memory and processing power while the cloud computing instance 322 that operates as the secondary controller may be deployed on one of the instance types that has a relatively small amount of memory and processing power.
  • a double failover may actually be carried out such that: 1) a first failover event where the cloud computing instance 322 that formerly operated as the secondary controller begins to operate as the primary controller, and 2) a third cloud computing instance (not shown) that is of an instance type that has a relatively large amount of memory and processing power is spun up with a copy of the storage controller application, where the third cloud computing instance begins operating as the primary controller while the cloud computing instance 322 that originally operated as the secondary controller begins operating as the secondary controller again.
  • the cloud computing instance 320 that formerly operated as the primary controller may be terminated.
  • the cloud computing instance 320 that is operating as the secondary controller after the failover event may continue to operate as the secondary controller and the cloud computing instance 322 that operated as the primary controller after the occurrence of the failover event may be terminated once the primary role has been assumed by the third cloud computing instance (not shown).
  • each cloud computing instance 320 , 322 may operate as a primary controller for some portion of the address space supported by the cloud-based storage system 318
  • each cloud computing instance 320 , 322 may operate as a primary controller where the servicing of I/O operations directed to the cloud-based storage system 318 are divided in some other way, and so on.
  • costs savings may be prioritized over performance demands, only a single cloud computing instance may exist that contains the storage controller application.
  • a controller failure may take more time to recover from as a new cloud computing instance that includes the storage controller application would need to be spun up rather than having an already created cloud computing instance take on the role of servicing I/O operations that would have otherwise been handled by the failed cloud computing instance.
  • the cloud-based storage system 318 depicted in FIG. 3 C includes cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 .
  • the cloud computing instances 340 a , 340 b , 340 n depicted in FIG. 3 C may be embodied, for example, as instances of cloud computing resources that may be provided by the cloud computing environment 316 to support the execution of software applications.
  • the cloud computing instances 340 a , 340 b , 340 n of FIG. 3 C may differ from the cloud computing instances 320 , 322 described above as the cloud computing instances 340 a , 340 b , 340 n of FIG.
  • the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 may be embodied, for example, as EC2 M5 instances that include one or more SSDs, as EC2 R5 instances that include one or more SSDs, as EC2 I3 instances that include one or more SSDs, and so on.
  • the local storage 330 , 334 , 338 must be embodied as solid-state storage (e.g., SSDs) rather than storage that makes use of hard disk drives.
  • each of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 can include a software daemon 328 , 332 , 336 that, when executed by a cloud computing instance 340 a , 340 b , 340 n can present itself to the storage controller applications 324 , 326 as if the cloud computing instance 340 a , 340 b , 340 n were a physical storage device (e.g., one or more SSDs).
  • a physical storage device e.g., one or more SSDs
  • the software daemon 328 , 332 , 336 may include computer program instructions similar to those that would normally be contained on a storage device such that the storage controller applications 324 , 326 can send and receive the same commands that a storage controller would send to storage devices.
  • the storage controller applications 324 , 326 may include code that is identical to (or substantially identical to) the code that would be executed by the controllers in the storage systems described above.
  • communications between the storage controller applications 324 , 326 and the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 may utilize iSCSI, NVMe over TCP, messaging, a custom protocol, or in some other mechanism.
  • each of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 may also be coupled to block-storage 342 , 344 , 346 that is offered by the cloud computing environment 316 .
  • the block-storage 342 , 344 , 346 that is offered by the cloud computing environment 316 may be embodied, for example, as Amazon Elastic Block Store (‘EBS’) volumes.
  • EBS Amazon Elastic Block Store
  • a first EBS volume may be coupled to a first cloud computing instance 340 a
  • a second EBS volume may be coupled to a second cloud computing instance 340 b
  • a third EBS volume may be coupled to a third cloud computing instance 340 n .
  • the block-storage 342 , 344 , 346 that is offered by the cloud computing environment 316 may be utilized in a manner that is similar to how the NVRAM devices described above are utilized, as the software daemon 328 , 332 , 336 (or some other module) that is executing within a particular cloud comping instance 340 a , 340 b , 340 n may, upon receiving a request to write data, initiate a write of the data to its attached EBS volume as well as a write of the data to its local storage 330 , 334 , 338 resources.
  • data may only be written to the local storage 330 , 334 , 338 resources within a particular cloud comping instance 340 a , 340 b , 340 n .
  • actual RAM on each of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 may be used as NVRAM, thereby decreasing network utilization costs that would be associated with using an EBS volume as the NVRAM.
  • the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 may be utilized, by cloud computing instances 320 , 322 that support the execution of the storage controller application 324 , 326 to service I/O operations that are directed to the cloud-based storage system 318 .
  • a first cloud computing instance 320 that is executing the storage controller application 324 is operating as the primary controller.
  • the first cloud computing instance 320 that is executing the storage controller application 324 may receive (directly or indirectly via the secondary controller) requests to write data to the cloud-based storage system 318 from users of the cloud-based storage system 318 .
  • the first cloud computing instance 320 that is executing the storage controller application 324 may perform various tasks such as, for example, deduplicating the data contained in the request, compressing the data contained in the request, determining where to the write the data contained in the request, and so on, before ultimately sending a request to write a deduplicated, encrypted, or otherwise possibly updated version of the data to one or more of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 .
  • Either cloud computing instance 320 , 322 may receive a request to read data from the cloud-based storage system 318 and may ultimately send a request to read data to one or more of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 .
  • the software daemon 328 , 332 , 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a , 340 b , 340 n may be configured to not only write the data to its own local storage 330 , 334 , 338 resources and any appropriate block-storage 342 , 344 , 346 that are offered by the cloud computing environment 316 , but the software daemon 328 , 332 , 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a , 340 b , 340 n may also be configured to write the data to cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a , 340 b , 340 n .
  • the cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a , 340 b , 340 n may be embodied, for example, as Amazon Simple Storage Service (‘S3’) storage that is accessible by the particular cloud computing instance 340 a , 340 b , 340 n .
  • the cloud computing instances 320 , 322 that each include the storage controller application 324 , 326 may initiate the storage of the data in the local storage 330 , 334 , 338 of the cloud computing instances 340 a , 340 b , 340 n and the cloud-based object storage 348 .
  • the cloud-based storage system 318 may be used to provide block storage services to users of the cloud-based storage system 318 . While the local storage 330 , 334 , 338 resources and the block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n may support block-level access, the cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a , 340 b , 340 n supports only object-based access.
  • the software daemon 328 , 332 , 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a , 340 b , 340 n may be configured to take blocks of data, package those blocks into objects, and write the objects to the cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a , 340 b , 340 n.
  • writing the data to the local storage 330 , 334 , 338 resources and the block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n is relatively straightforward as 5 blocks that are 1 MB in size are written to the local storage 330 , 334 , 338 resources and the block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n .
  • the software daemon 328 , 332 , 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a , 340 b , 340 n may be configured to: 1) create a first object that includes the first 1 MB of data and write the first object to the cloud-based object storage 348 , 2) create a second object that includes the second 1 MB of data and write the second object to the cloud-based object storage 348 , 3) create a third object that includes the third 1 MB of data and write the third object to the cloud-based object storage 348 , and so on.
  • each object that is written to the cloud-based object storage 348 may be identical (or nearly identical) in size. Readers will appreciate that in such an example, metadata that is associated with the data itself may be included in each object (e.g., the first 1 MB of the object is data and the remaining portion is metadata associated with the data).
  • the cloud-based object storage 348 may be incorporated into the cloud-based storage system 318 to increase the durability of the cloud-based storage system 318 .
  • the cloud computing instances 340 a , 340 b , 340 n are EC2 instances
  • relying on the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 as the only source of persistent data storage in the cloud-based storage system 318 may result in a relatively unreliable storage system.
  • EBS volumes are designed for 99.999% availability. As such, even relying on EBS as the persistent data store in the cloud-based storage system 318 may result in a storage system that is not sufficiently durable.
  • Amazon S3 is designed to provide 99.999999999% durability, meaning that a cloud-based storage system 318 that can incorporate S3 into its pool of storage is substantially more durable than various other options.
  • the cloud-based storage system 318 not only stores data in S3 but the cloud-based storage system 318 also stores data in local storage 330 , 334 , 338 resources and block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n , such that read operations can be serviced from local storage 330 , 334 , 338 resources and the block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n , thereby reducing read latency when users of the cloud-based storage system 318 attempt to read data from the cloud-based storage system 318 .
  • all data that is stored by the cloud-based storage system 318 may be stored in both: 1) the cloud-based object storage 348 , and 2) at least one of the local storage 330 , 334 , 338 resources or block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n .
  • the local storage 330 , 334 , 338 resources and block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n may effectively operate as cache that generally includes all data that is also stored in S3, such that all reads of data may be serviced by the cloud computing instances 340 a , 340 b , 340 n without requiring the cloud computing instances 340 a , 340 b , 340 n to access the cloud-based object storage 348 .
  • all data that is stored by the cloud-based storage system 318 may be stored in the cloud-based object storage 348 , but less than all data that is stored by the cloud-based storage system 318 may be stored in at least one of the local storage 330 , 334 , 338 resources or block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n .
  • various policies may be utilized to determine which subset of the data that is stored by the cloud-based storage system 318 should reside in both: 1) the cloud-based object storage 348 , and 2) at least one of the local storage 330 , 334 , 338 resources or block-storage 342 , 344 , 346 resources that are utilized by the cloud computing instances 340 a , 340 b , 340 n.
  • the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 are embodied as EC2 instances
  • the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 are only guaranteed to have a monthly uptime of 99.9% and data stored in the local instance store only persists during the lifetime of each cloud computing instance 340 a , 340 b , 340 n with local storage 330 , 334 , 338 .
  • one or more modules of computer program instructions that are executing within the cloud-based storage system 318 may be designed to handle the failure of one or more of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 .
  • the monitoring module may handle the failure of one or more of the cloud computing instances 340 a , 340 b , 340 n with local storage 330 , 334 , 338 by creating one or more new cloud computing instances with local storage, retrieving data that was stored on the failed cloud computing instances 340 a , 340 b , 340 n from the cloud-based object storage 348 , and storing the data retrieved from the cloud-based object storage 348 in local storage on the newly created cloud computing instances. Readers will appreciate that many variants of this process may be implemented.
  • the monitoring module may create new cloud computing instances with local storage, where high-bandwidth instances types are selected that allow for the maximum data transfer rates between the newly created high-bandwidth cloud computing instances with local storage and the cloud-based object storage 348 .
  • instances types are selected that allow for the maximum data transfer rates between the new cloud computing instances and the cloud-based object storage 348 such that the new high-bandwidth cloud computing instances can be rehydrated with data from the cloud-based object storage 348 as quickly as possible.
  • the new high-bandwidth cloud computing instances are rehydrated with data from the cloud-based object storage 348 , less expensive lower-bandwidth cloud computing instances may be created, data may be migrated to the less expensive lower-bandwidth cloud computing instances, and the high-bandwidth cloud computing instances may be terminated.
  • the number of new cloud computing instances that are created may substantially exceed the number of cloud computing instances that are needed to locally store all of the data stored by the cloud-based storage system 318 .
  • the number of new cloud computing instances that are created may substantially exceed the number of cloud computing instances that are needed to locally store all of the data stored by the cloud-based storage system 318 in order to more rapidly pull data from the cloud-based object storage 348 and into the new cloud computing instances, as each new cloud computing instance can (in parallel) retrieve some portion of the data stored by the cloud-based storage system 318 .
  • the data stored by the cloud-based storage system 318 has been pulled into the newly created cloud computing instances, the data may be consolidated within a subset of the newly created cloud computing instances and those newly created cloud computing instances that are excessive may be terminated.
  • the monitoring module may cause 100,000 cloud computing instances to be created, where each cloud computing instance is responsible for retrieving, from the cloud-based object storage 348 , distinct 1/100,000th chunks of the valid data that users of the cloud-based storage system 318 have written to the cloud-based storage system 318 and locally storing the distinct chunk of the dataset that it retrieved.
  • the caching layer may be restored 100 times faster as compared to an embodiment where the monitoring module only create 1000 replacement cloud computing instances.
  • the data that is stored locally in the 100,000 could be consolidated into 1,000 cloud computing instances and the remaining 99,000 cloud computing instances could be terminated.
  • cloud-based storage system 318 may be monitored (e.g., by a monitoring module that is executing in an EC2 instance) such that the cloud-based storage system 318 can be scaled-up or scaled-out as needed.
  • the monitoring module monitors the performance of the could-based storage system 318 via communications with one or more of the cloud computing instances 320 , 322 that each are used to support the execution of a storage controller application 324 , 326 , via monitoring communications between cloud computing instances 320 , 322 , 340 a , 340 b , 340 n , via monitoring communications between cloud computing instances 320 , 322 , 340 a , 340 b , 340 n and the cloud-based object storage 348 , or in some other way.
  • the monitoring module determines that the cloud computing instances 320 , 322 that are used to support the execution of a storage controller application 324 , 326 are undersized and not sufficiently servicing the I/O requests that are issued by users of the cloud-based storage system 318 .
  • the monitoring module may create a new, more powerful cloud computing instance (e.g., a cloud computing instance of a type that includes more processing power, more memory, etc . . . ) that includes the storage controller application such that the new, more powerful cloud computing instance can begin operating as the primary controller.
  • the monitoring module may create a new, less powerful (and less expensive) cloud computing instance that includes the storage controller application such that the new, less powerful cloud computing instance can begin operating as the primary controller.
  • the monitoring module determines that the utilization of the local storage that is collectively provided by the cloud computing instances 340 a , 340 b , 340 n has reached a predetermined utilization threshold (e.g., 95%).
  • the monitoring module may create additional cloud computing instances with local storage to expand the pool of local storage that is offered by the cloud computing instances.
  • the monitoring module may create one or more new cloud computing instances that have larger amounts of local storage than the already existing cloud computing instances 340 a , 340 b , 340 n , such that data stored in an already existing cloud computing instance 340 a , 340 b , 340 n can be migrated to the one or more new cloud computing instances and the already existing cloud computing instance 340 a , 340 b , 340 n can be terminated, thereby expanding the pool of local storage that is offered by the cloud computing instances.
  • the pool of local storage that is offered by the cloud computing instances is unnecessarily large, data can be consolidated and some cloud computing instances can be terminated.
  • the cloud-based storage system 318 may be sized up and down automatically by a monitoring module applying a predetermined set of rules that may be relatively simple of relatively complicated.
  • the monitoring module may not only take into account the current state of the cloud-based storage system 318 , but the monitoring module may also apply predictive policies that are based on, for example, observed behavior (e.g., every night from 10 PM until 6 AM usage of the storage system is relatively light), predetermined fingerprints (e.g., every time a virtual desktop infrastructure adds 100 virtual desktops, the number of IOPS directed to the storage system increase by X), and so on.
  • the dynamic scaling of the cloud-based storage system 318 may be based on current performance metrics, predicted workloads, and many other factors, including combinations thereof
  • the cloud-based storage system 318 may be dynamically scaled, the cloud-based storage system 318 may even operate in a way that is more dynamic.
  • garbage collection In a traditional storage system, the amount of storage is fixed. As such, at some point the storage system may be forced to perform garbage collection as the amount of available storage has become so constrained that the storage system is on the verge of running out of storage.
  • the cloud-based storage system 318 described here can always ‘add’ additional storage (e.g., by adding more cloud computing instances with local storage). Because the cloud-based storage system 318 described here can always ‘add’ additional storage, the cloud-based storage system 318 can make more intelligent decisions regarding when to perform garbage collection.
  • the cloud-based storage system 318 may implement a policy that garbage collection only be performed when the number of IOPS being serviced by the cloud-based storage system 318 falls below a certain level.
  • other system-level functions e.g., deduplication, compression
  • embodiments of the present disclosure resolve an issue with block-storage services offered by some cloud computing environments as some cloud computing environments only allow for one cloud computing instance to connect to a block-storage volume at a single time.
  • some cloud computing environments only allow for one cloud computing instance to connect to a block-storage volume at a single time.
  • Amazon AWS only a single EC2 instance may be connected to an EBS volume.
  • the drive instances may include software executing within the drive instance that allows the drive instance to support I/O directed to a particular volume from each connected EC2 instance.
  • some embodiments of the present disclosure may be embodied as multi-connect block storage services that may not include all of the components depicted in FIG. 3 C .
  • the cloud-based storage system 318 may include one or more modules (e.g., a module of computer program instructions executing on an EC2 instance) that are configured to ensure that when the local storage of a particular cloud computing instance is rehydrated with data from S3, the appropriate data is actually in S3.
  • modules e.g., a module of computer program instructions executing on an EC2 instance
  • S3 implements an eventual consistency model where, when overwriting an existing object, reads of the object will eventually (but not necessarily immediately) become consistent and will eventually (but not necessarily immediately) return the overwritten version of the object.
  • objects in S3 are never overwritten. Instead, a traditional ‘overwrite’ would result in the creation of the new object (that includes the updated version of the data) and the eventual deletion of the old object (that includes the previous version of the data).
  • the resultant object may be tagged with a sequence number.
  • these sequence numbers may be persisted elsewhere (e.g., in a database) such that at any point in time, the sequence number associated with the most up-to-date version of some piece of data can be known. In such a way, a determination can be made as to whether S3 has the most recent version of some piece of data by merely reading the sequence number associated with an object—and without actually reading the data from S3.
  • the ability to make this determination may be particularly important when a cloud computing instance with local storage crashes, as it would be undesirable to rehydrate the local storage of a replacement cloud computing instance with out-of-date data.
  • the cloud-based storage system 318 does not need to access the data to verify its validity, the data can stay encrypted and access charges can be avoided.
  • the storage systems described above may carry out intelligent data backup techniques through which data stored in the storage system may be copied and stored in a distinct location to avoid data loss in the event of equipment failure or some other form of catastrophe.
  • the storage systems described above may be configured to examine each backup to avoid restoring the storage system to an undesirable state.
  • the storage system may include software resources 314 that can scan each backup to identify backups that were captured before the malware infected the storage system and those backups that were captured after the malware infected the storage system.
  • the storage system may restore itself from a backup that does not include the malware—or at least not restore the portions of a backup that contained the malware.
  • the storage system may include software resources 314 that can scan each backup to identify the presences of malware (or a virus, or some other undesirable), for example, by identifying write operations that were serviced by the storage system and originated from a network subnet that is suspected to have delivered the malware, by identifying write operations that were serviced by the storage system and originated from a user that is suspected to have delivered the malware, by identifying write operations that were serviced by the storage system and examining the content of the write operation against fingerprints of the malware, and in many other ways.
  • malware or a virus, or some other undesirable
  • the backups may also be utilized to perform rapid recovery of the storage system.
  • software resources 314 within the storage system may be configured to detect the presence of ransomware and may be further configured to restore the storage system to a point-in-time, using the retained backups, prior to the point-in-time at which the ransomware infected the storage system.
  • the presence of ransomware may be explicitly detected through the use of software tools utilized by the system, through the use of a key (e.g., a USB drive) that is inserted into the storage system, or in a similar way.
  • the presence of ransomware may be inferred in response to system activity meeting a predetermined fingerprint such as, for example, no reads or writes coming into the system for a predetermined period of time.
  • Such converged infrastructures may include pools of computers, storage and networking resources that can be shared by multiple applications and managed in a collective manner using policy-driven processes. Such converged infrastructures may minimize compatibility issues between various components within the storage system 306 while also reducing various costs associated with the establishment and operation of the storage system 306 .
  • Such converged infrastructures may be implemented with a converged infrastructure reference architecture, with standalone appliances, with a software driven hyper-converged approach (e.g., hyper-converged infrastructures), or in other ways.
  • the storage system 306 depicted in FIG. 3 B may be useful for supporting various types of software applications.
  • the storage system 306 may be useful in supporting artificial intelligence (‘AI’) applications, database applications, DevOps projects, electronic design automation tools, event-driven software applications, high performance computing applications, simulation applications, high-speed data capture and analysis applications, machine learning applications, media production applications, media serving applications, picture archiving and communication systems (‘PACS’) applications, software development applications, virtual reality applications, augmented reality applications, and many other types of applications by providing storage resources to such applications.
  • AI artificial intelligence
  • database applications database applications
  • DevOps projects electronic design automation tools
  • event-driven software applications high performance computing applications
  • simulation applications high-speed data capture and analysis applications
  • machine learning applications machine learning applications
  • media production applications media serving applications
  • picture archiving and communication systems (‘PACS’) applications software development applications
  • virtual reality applications virtual reality applications
  • augmented reality applications and many other types of applications by providing storage resources to such applications.
  • the storage systems described above may operate to support a wide variety of applications.
  • the storage systems may be well suited to support applications that are resource intensive such as, for example, AI applications.
  • AI applications may enable devices to perceive their environment and take actions that maximize their chance of success at some goal. Examples of such AI applications can include IBM Watson, Microsoft Oxford, Google DeepMind, Baidu Minwa, and others.
  • the storage systems described above may also be well suited to support other types of applications that are resource intensive such as, for example, machine learning applications.
  • Machine learning applications may perform various types of data analysis to automate analytical model building. Using algorithms that iteratively learn from data, machine learning applications can enable computers to learn without being explicitly programmed.
  • Reinforcement learning involves taking suitable actions to maximize reward in a particular situation.
  • Reinforcement learning may be employed to find the best possible behavior or path that a particular software application or machine should take in a specific situation.
  • Reinforcement learning differs from other areas of machine learning (e.g., supervised learning, unsupervised learning) in that correct input/output pairs need not be presented for reinforcement learning and sub-optimal actions need not be explicitly corrected.
  • the storage systems described above may also include graphics processing units (‘GPUs’), occasionally referred to as visual processing unit (‘VPUs’).
  • GPUs graphics processing units
  • VPUs visual processing unit
  • Such GPUs may be embodied as specialized electronic circuits that rapidly manipulate and alter memory to accelerate the creation of images in a frame buffer intended for output to a display device.
  • Such GPUs may be included within any of the computing devices that are part of the storage systems described above, including as one of many individually scalable components of a storage system, where other examples of individually scalable components of such storage system can include storage components, memory components, compute components (e.g., CPUs, FPGAs, ASICs), networking components, software components, and others.
  • the storage systems described above may also include neural network processors (‘NNPs’) for use in various aspects of neural network processing. Such NNPs may be used in place of (or in addition to) GPUs and may be also be independently scalable.
  • NNPs neural network processors
  • the storage systems described herein may be configured to support artificial intelligence applications, machine learning applications, big data analytics applications, and many other types of applications.
  • the rapid growth in these sort of applications is being driven by three technologies: deep learning (DL), GPU processors, and Big Data.
  • Deep learning is a computing model that makes use of massively parallel neural networks inspired by the human brain. Instead of experts handcrafting software, a deep learning model writes its own software by learning from lots of examples.
  • a GPU is a modern processor with thousands of cores, well-suited to run algorithms that loosely represent the parallel nature of the human brain.
  • AI artificial intelligence
  • data scientists With improved algorithms, larger data sets, and various frameworks (including open-source software libraries for machine learning across a range of tasks), data scientists are tackling new use cases like autonomous driving vehicles, natural language processing and understanding, computer vision, machine reasoning, strong AI, and many others.
  • Applications of such techniques may include: machine and vehicular object detection, identification and avoidance; visual recognition, classification and tagging; algorithmic financial trading strategy performance management; simultaneous localization and mapping; predictive maintenance of high-value machinery; prevention against cyber security threats, expertise automation; image recognition and classification; question answering; robotics; text analytics (extraction, classification) and text generation and translation; and many others.
  • AI techniques has materialized in a wide array of products include, for example, Amazon Echo's speech recognition technology that allows users to talk to their machines, Google TranslateTM which allows for machine-based language translation, Spotify's Discover Weekly that provides recommendations on new songs and artists that a user may like based on the user's usage and traffic analysis, Quill's text generation offering that takes structured data and turns it into narrative stories, Chatbots that provide real-time, contextually specific answers to questions in a dialog format, and many others.
  • AI may impact a wide variety of industries and sectors. For example, AI solutions may be used in healthcare to take clinical notes, patient files, research data, and other inputs to generate potential treatment options for doctors to explore. Likewise, AI solutions may be used by retailers to personalize consumer recommendations based on a person's digital footprint of behaviors, profile data, or other data.
  • GPUs are massively parallel processors capable of operating on large amounts of data simultaneously.
  • a high throughput pipeline may be required to feed input data from storage to the compute engines. Deep learning is more than just constructing and training models. There also exists an entire data pipeline that must be designed for the scale, iteration, and experimentation necessary for a data science team to succeed.
  • Data samples may undergo a series of processing steps including, but not limited to: 1) ingesting the data from an external source into the training system and storing the data in raw form, 2) cleaning and transforming the data in a format convenient for training, including linking data samples to the appropriate label, 3) exploring parameters and models, quickly testing with a smaller dataset, and iterating to converge on the most promising models to push into the production cluster, 4) executing training phases to select random batches of input data, including both new and older samples, and feeding those into production GPU servers for computation to update model parameters, and 5) evaluating including using a holdback portion of the data not used in training in order to evaluate model accuracy on the holdout data.
  • This lifecycle may apply for any type of parallelized machine learning, not just neural networks or deep learning.
  • each stage in the AI data pipeline may have varying requirements from the data hub (e.g., the storage system or collection of storage systems).
  • Scale-out storage systems must deliver uncompromising performance for all manner of access types and patterns—from small, metadata-heavy to large files, from random to sequential access patterns, and from low to high concurrency.
  • the storage systems described above may serve as an ideal AI data hub as the systems may service unstructured workloads.
  • data is ideally ingested and stored on to the same data hub that following stages will use, in order to avoid excess data copying.
  • the next two steps can be done on a standard compute server that optionally includes a GPU, and then in the fourth and last stage, full training production jobs are run on powerful GPU-accelerated servers.
  • the GPU-accelerated servers can be used independently for different models or joined together to train on one larger model, even spanning multiple systems for distributed training. If the shared storage tier is slow, then data must be copied to local storage for each phase, resulting in wasted time staging data onto different servers.
  • the ideal data hub for the AI training pipeline delivers performance similar to data stored locally on the server node while also having the simplicity and performance to enable all pipeline stages to operate concurrently.
  • a data scientist works to improve the usefulness of the trained model through a wide variety of approaches: more data, better data, smarter training, and deeper models.
  • Multiple, concurrent workloads of data processing, experimentation, and full-scale training layer the demands of multiple access patterns on the storage tier. In other words, storage cannot just satisfy large file reads, but must contend with a mix of large and small file reads and writes.
  • the storage systems described above may provide a natural shared storage home for the dataset, with data protection redundancy (e.g., by using RAID6) and the performance necessary to be a common access point for multiple developers and multiple experiments.
  • Using the storage systems described above may avoid the need to carefully copy subsets of the data for local work, saving both engineering and GPU-accelerated servers use time. These copies become a constant and growing tax as the raw data set and desired transformations constantly update and change.
  • the storage systems described above may make building, operating, and growing an AI system easier due to the random read bandwidth provided by the storage systems, the ability to of the storage systems to randomly read small files (50 KB) high rates (meaning that no extra effort is required to aggregate individual data points to make larger, storage-friendly files), the ability of the storage systems to scale capacity and performance as either the dataset grows or the throughput requirements grow, the ability of the storage systems to support files or objects, the ability of the storage systems to tune performance for large or small files (i.e., no need for the user to provision filesystems), the ability of the storage systems to support non-disruptive upgrades of hardware and software even during production model training, and for many other reasons.
  • Small file performance of the storage tier may be critical as many types of inputs, including text, audio, or images will be natively stored as small files. If the storage tier does not handle small files well, an extra step will be required to pre-process and group samples into larger files. Storage, built on top of spinning disks, that relies on SSD as a caching tier, may fall short of the performance needed. Because training with random input batches results in more accurate models, the entire data set must be accessible with full performance. SSD caches only provide high performance for a small subset of the data and will be ineffective at hiding the latency of spinning drives.
  • DDL distributed deep learning
  • Distributed deep learning may be used to significantly accelerate deep learning with distributed computing on GPUs (or other form of accelerator or computer program instruction executor), such that parallelism can be achieved.
  • the output of training machine learning and deep learning models such as a fully trained machine learning model, may be used for a variety of purposes and in conjunction with other tools.
  • trained machine learning models may be used in conjunction with tools like Core ML to integrate a broad variety of machine learning model types into an application.
  • trained models may be run through Core ML converter tools and inserted into a custom application that can be deployed on compatible devices.
  • the storage systems described above may also be paired with other technologies such as TensorFlow, an open-source software library for dataflow programming across a range of tasks that may be used for machine learning applications such as neural networks, to facilitate the development of such machine learning models, applications, and so on.
  • TensorFlow an open-source software library for dataflow programming across a range of tasks that may be used for machine learning applications such as neural networks, to facilitate the development of such machine learning models, applications, and so on.
  • the systems described above may be deployed in a variety of ways to support the democratization of AI, as AI becomes more available for mass consumption.
  • the democratization of AI may include, for example, the ability to offer AI as a Platform-as-a-Service, the growth of Artificial general intelligence offerings, the proliferation of Autonomous level 4 and Autonomous level 5 vehicles, the availability of autonomous mobile robots, the development of conversational AI platforms, and many others.
  • the systems described above may be deployed in cloud environments, edge environments, or other environments that are useful in supporting the democratization of AI.
  • a movement may occur from narrow AI that consists of highly scoped machine learning solutions that target a particular task to artificial general intelligence where the use of machine learning is expanded to handle a broad range of use cases that could essentially perform any intelligent task that a human could perform and could learn dynamically, much like a human.
  • Neuromorphic computing is a form of computing that mimics brain cells.
  • an architecture of interconnected “neurons” replace traditional computing models with low-powered signals that go directly between neurons for more efficient computation.
  • Neuromorphic computing may make use of very-large-scale integration (VLSI) systems containing electronic analog circuits to mimic neuro-biological architectures present in the nervous system, as well as analog, digital, mixed-mode analog/digital VLSI, and software systems that implement models of neural systems for perception, motor control, or multisensory integration.
  • VLSI very-large-scale integration
  • Blockchains may be embodied as a continuously growing list of records, called blocks, which are linked and secured using cryptography. Each block in a blockchain may contain a hash pointer as a link to a previous block, a timestamp, transaction data, and so on. Blockchains may be designed to be resistant to modification of the data and can serve as an open, distributed ledger that can record transactions between two parties efficiently and in a verifiable and permanent way. This makes blockchains potentially suitable for the recording of events, medical records, and other records management activities, such as identity management, transaction processing, and others.
  • the storage systems described above may also support the storage and use of derivative items such as, for example, open source blockchains and related tools that are part of the IBMTM Hyperledger project, permissioned blockchains in which a certain number of trusted parties are allowed to access the block chain, blockchain products that enable developers to build their own distributed ledger projects, and others.
  • derivative items such as, for example, open source blockchains and related tools that are part of the IBMTM Hyperledger project, permissioned blockchains in which a certain number of trusted parties are allowed to access the block chain, blockchain products that enable developers to build their own distributed ledger projects, and others.
  • blockchain technologies may impact a wide variety of industries and sectors.
  • blockchain technologies may be used in real estate transactions as blockchain based contracts whose use can eliminate the need for 3 rd parties and enable self-executing actions when conditions are met.
  • universal health records can be created by aggregating and placing a person's health history onto a blockchain ledger for any healthcare provider, or permissioned health care providers, to access and update.
  • blockchains may be leveraged to enable the decentralized aggregation, ordering, timestamping and archiving of any type of information, including structured data, correspondence, documentation, or other data.
  • participants can provably and permanently agree on exactly what data was entered, when and by whom, without relying on a trusted intermediary.
  • SAP's recently launched blockchain platform which supports MultiChain and Hyperledger Fabric, targets a broad range of supply chain and other non-financial applications.
  • One way to use a blockchain for recording data is to embed each piece of data directly inside a transaction. Every blockchain transaction may be digitally signed by one or more parties, replicated to a plurality of nodes, ordered and timestamped by the chain's consensus algorithm, and stored permanently in a tamper-proof way. Any data within the transaction will therefore be stored identically but independently by every node, along with a proof of who wrote it and when. The chain's users are able to retrieve this information at any future time.
  • This type of storage may be referred to as on-chain storage. On-chain storage may not be particularly practical, however, when attempting to store a very large dataset. As such, in accordance with embodiments of the present disclosure, blockchains and the storage systems described herein may be leveraged to support on-chain storage of data as well as off-chain storage of data.
  • Off-chain storage of data can be implemented in a variety of ways and can occur when the data itself is not stored within the blockchain.
  • a hash function may be utilized and the data itself may be fed into the hash function to generate a hash value.
  • the hashes of large pieces of data may be embedded within transactions, instead of the data itself.
  • Each hash may serve as a commitment to its input data, with the data itself being stored outside of the blockchain. Readers will appreciate that any blockchain participant that needs an off-chain piece of data cannot reproduce the data from its hash, but if the data can be retrieved in some other way, then the on-chain hash serves to confirm who created it and when.
  • the hash may be embedded inside a digitally signed transaction, which was included in the chain by consensus.
  • a blockweave may be used to facilitate the decentralized storage of information.
  • a blockweave may utilize a consensus mechanism that is based on proof of access (PoA) and proof of work (PoW). While typical PoW systems only depend on the previous block in order to generate each successive block, the PoA algorithm may incorporate data from a randomly chosen previous block.
  • PoA proof of access
  • PoW proof of work
  • miners do not need to store all blocks (forming a blockchain), but rather can store any previous blocks forming a weave of blocks (a blockweave).
  • This enables increased levels of scalability, speed and low-cost and reduces the cost of data storage in part because miners need not store all blocks, thereby resulting in a substantial reduction in the amount of electricity that is consumed during the mining process because, as the network expands, electricity consumption decreases because a blockweave demands less and less hashing power for consensus as data is added to the system.
  • blockweaves may be deployed on a decentralized storage network in which incentives are created to encourage rapid data sharing.
  • Such decentralized storage networks may also make use of blockshadowing techniques, where nodes only send a minimal block “shadow” to other nodes that allows peers to reconstruct a full block, instead of transmitting the full block itself.
  • the storage systems described above may, either alone or in combination with other computing devices, be used to support in-memory computing applications.
  • In memory computing involves the storage of information in RAM that is distributed across a cluster of computers.
  • In-memory computing helps business customers, including retailers, banks and utilities, to quickly detect patterns, analyze massive data volumes on the fly, and perform their operations quickly. Readers will appreciate that the storage systems described above, especially those that are configurable with customizable amounts of processing resources, storage resources, and memory resources (e.g., those systems in which blades that contain configurable amounts of each type of resource), may be configured in a way so as to provide an infrastructure that can support in-memory computing.
  • the storage systems described above may include component parts (e.g., NVDIMMs, 3D crosspoint storage that provide fast random access memory that is persistent) that can actually provide for an improved in-memory computing environment as compared to in-memory computing environments that rely on RAM distributed across dedicated servers.
  • component parts e.g., NVDIMMs, 3D crosspoint storage that provide fast random access memory that is persistent
  • the storage systems described above may be configured to operate as a hybrid in-memory computing environment that includes a universal interface to all storage media (e.g., RAM, flash storage, 3D crosspoint storage).
  • the storage system may (in the background) move data to the fastest layer available—including intelligently placing the data in dependence upon various characteristics of the data or in dependence upon some other heuristic.
  • the storage systems may even make use of existing products such as Apache Ignite and GridGain to move data between the various storage layers, or the storage systems may make use of custom software to move data between the various storage layers.
  • the storage systems described herein may implement various optimizations to improve the performance of in-memory computing such as, for example, having computations occur as close to the data as possible.
  • the storage systems described above may be paired with other resources to support the applications described above.
  • one infrastructure could include primary compute in the form of servers and workstations which specialize in using General-purpose computing on graphics processing units (‘GPGPU’) to accelerate deep learning applications that are interconnected into a computation engine to train parameters for deep neural networks.
  • GPU General-purpose computing on graphics processing units
  • Each system may have Ethernet external connectivity, InfiniBand external connectivity, some other form of external connectivity, or some combination thereof.
  • the GPUs can be grouped for a single large training or used independently to train multiple models.
  • the infrastructure could also include a storage system such as those described above to provide, for example, a scale-out all-flash file or object store through which data can be accessed via high-performance protocols such as NFS, S3, and so on.
  • the infrastructure can also include, for example, redundant top-of-rack Ethernet switches connected to storage and compute via ports in MLAG port channels for redundancy.
  • the infrastructure could also include additional compute in the form of whitebox servers, optionally with GPUs, for data ingestion, pre-processing, and model debugging. Readers will appreciate that additional infrastructures are also be possible.
  • DDAS distributed direct-attached storage
  • server nodes Such DDAS solutions may be built for handling large, less sequential accesses but may be less able to handle small, random accesses.
  • DDAS solutions may be built for handling large, less sequential accesses but may be less able to handle small, random accesses.
  • the storage systems described above may be utilized to provide a platform for the applications described above that is preferable to the utilization of cloud-based resources as the storage systems may be included in an on-site or in-house infrastructure that is more secure, more locally and internally managed, more robust in feature sets and performance, or otherwise preferable to the utilization of cloud-based resources as part of a platform to support the applications described above.
  • AI as a service may be less desirable than internally managed and offered AI as a service that is supported by storage systems such as the storage systems described above, for a wide array of technical reasons as well as for various business reasons.
  • the storage systems described above may be configured to support other AI related tools.
  • the storage systems may make use of tools like ONXX or other open neural network exchange formats that make it easier to transfer models written in different AI frameworks.
  • the storage systems may be configured to support tools like Amazon's Gluon that allow developers to prototype, build, and train deep learning models.
  • the storage systems described above may be part of a larger platform, such as IBMTM Cloud Private for Data, that includes integrated data science, data engineering and application building services.
  • Such platforms may seamlessly collect, organize, secure, and analyze data across an enterprise, as well as simplify hybrid data management, unified data governance and integration, data science and business analytics with a single solution.
  • the storage systems described above may also be deployed as an edge solution.
  • Such an edge solution may be in place to optimize cloud computing systems by performing data processing at the edge of the network, near the source of the data.
  • Edge computing can push applications, data and computing power (i.e., services) away from centralized points to the logical extremes of a network.
  • computational tasks may be performed using the compute resources provided by such storage systems, data may be storage using the storage resources of the storage system, and cloud-based services may be accessed through the use of various resources of the storage system (including networking resources).
  • While many tasks may benefit from the utilization of an edge solution, some particular uses may be especially suited for deployment in such an environment.
  • devices like drones, autonomous cars, robots, and others may require extremely rapid processing—so fast, in fact, that sending data up to a cloud environment and back to receive data processing support may simply be too slow.
  • machines like locomotives and gas turbines that generate large amounts of information through the use of a wide array of data-generating sensors may benefit from the rapid data processing capabilities of an edge solution.
  • IoT devices such as connected video cameras may not be well-suited for the utilization of cloud-based resources as it may be impractical (not only from a privacy perspective, security perspective, or a financial perspective) to send the data to the cloud simply because of the pure volume of data that is involved.
  • many tasks that really on data processing, storage, or communications may be better suited by platforms that include edge solutions such as the storage systems described above.
  • a large inventory, warehousing, shipping, order-fulfillment, manufacturing or other operation has a large amount of inventory on inventory shelves, and high resolution digital cameras that produce a firehose of large data. All of this data may be taken into an image processing system, which may reduce the amount of data to a firehose of small data. All of the small data may be stored on-premises in storage.
  • the on-premises storage, at the edge of the facility, may be coupled to the cloud, for external reports, real-time control and cloud storage.
  • Inventory management may be performed with the results of the image processing, so that inventory can be tracked on the shelves and restocked, moved, shipped, modified with new products, or discontinued/obsolescent products deleted, etc.
  • the above scenario is a prime candidate for an embodiment of the configurable processing and storage systems described above.
  • a combination of compute-only blades and offload blades suited for the image processing, perhaps with deep learning on offload-FPGA or offload-custom blade(s) could take in the firehose of large data from all of the digital cameras, and produce the firehose of small data. All of the small data could then be stored by storage nodes, operating with storage units in whichever combination of types of storage blades best handles the data flow. This is an example of storage and function acceleration and integration.
  • the system could be sized for storage and compute management with bursty workloads and variable conductivity reliability. Also, depending on other inventory management aspects, the system could be configured for scheduling and resource management in a hybrid edge/cloud environment.
  • the storage systems described above may alone, or in combination with other computing resources, serves as a network edge platform that combines compute resources, storage resources, networking resources, cloud technologies and network virtualization technologies, and so on.
  • the edge may take on characteristics similar to other network facilities, from the customer premise and backhaul aggregation facilities to Points of Presence (PoPs) and regional data centers. Readers will appreciate that network workloads, such as Virtual Network Functions (VNFs) and others, will reside on the network edge platform. Enabled by a combination of containers and virtual machines, the network edge platform may rely on controllers and schedulers that are no longer geographically co-located with the data processing resources.
  • VNFs Virtual Network Functions
  • control planes may split into control planes, user and data planes, or even state machines, allowing for independent optimization and scaling techniques to be applied.
  • user and data planes may be enabled through increased accelerators, both those residing in server platforms, such as FPGAs and Smart NICs, and through SDN-enabled merchant silicon and programmable ASICs.
  • Big data analytics may be generally described as the process of examining large and varied data sets to uncover hidden patterns, unknown correlations, market trends, customer preferences and other useful information that can help organizations make more-informed business decisions.
  • Big data analytics applications enable data scientists, predictive modelers, statisticians and other analytics professionals to analyze growing volumes of structured transaction data, plus other forms of data that are often left untapped by conventional business intelligence (BI) and analytics programs.
  • BI business intelligence
  • semi-structured and unstructured data such as, for example, internet clickstream data, web server logs, social media content, text from customer emails and survey responses, mobile-phone call-detail records, IoT sensor data, and other data may be converted to a structured form.
  • Big data analytics is a form of advanced analytics, which involves complex applications with elements such as predictive models, statistical algorithms and what-if analyses powered by high-performance analytics systems.
  • the storage systems described above may also support (including implementing as a system interface) applications that perform tasks in response to human speech.
  • the storage systems may support the execution intelligent personal assistant applications such as, for example, Amazon's Alexa, Apple Siri, Google Voice, Samsung Bixby, Microsoft Cortana, and others.
  • the examples described in the previous sentence make use of voice as input
  • the storage systems described above may also support chatbots, talkbots, chatterbots, or artificial conversational entities or other applications that are configured to conduct a conversation via auditory or textual methods.
  • the storage system may actually execute such an application to enable a user such as a system administrator to interact with the storage system via speech.
  • Such applications are generally capable of voice interaction, music playback, making to-do lists, setting alarms, streaming podcasts, playing audiobooks, and providing weather, traffic, and other real time information, such as news, although in embodiments in accordance with the present disclosure, such applications may be utilized as interfaces to various system management operations.
  • the storage systems described above may also implement AI platforms for delivering on the vision of self-driving storage.
  • AI platforms may be configured to deliver global predictive intelligence by collecting and analyzing large amounts of storage system telemetry data points to enable effortless management, analytics and support.
  • storage systems may be capable of predicting both capacity and performance, as well as generating intelligent advice on workload deployment, interaction and optimization.
  • AI platforms may be configured to scan all incoming storage system telemetry data against a library of issue fingerprints to predict and resolve incidents in real-time, before they impact customer environments, and captures hundreds of variables related to performance that are used to forecast performance load.
  • the storage systems described above may support the serialized or simultaneous execution artificial intelligence applications, machine learning applications, data analytics applications, data transformations, and other tasks that collectively may form an AI ladder.
  • Such an AI ladder may effectively be formed by combining such elements to form a complete data science pipeline, where exist dependencies between elements of the AI ladder. For example, AI may require that some form of machine learning has taken place, machine learning may require that some form of analytics has taken place, analytics may require that some form of data and information architecting has taken place, and so on.
  • each element may be viewed as a rung in an AI ladder that collectively can form a complete and sophisticated AI solution.
  • the storage systems described above may also, either alone or in combination with other computing environments, be used to deliver an AI everywhere experience where AI permeates wide and expansive aspects of business and life.
  • AI may play an important role in the delivery of deep learning solutions, deep reinforcement learning solutions, artificial general intelligence solutions, autonomous vehicles, cognitive computing solutions, commercial UAVs or drones, conversational user interfaces, enterprise taxonomies, ontology management solutions, machine learning solutions, smart dust, smart robots, smart workplaces, and many others.
  • the storage systems described above may also, either alone or in combination with other computing environments, be used to deliver a wide range of transparently immersive experiences where technology can introduce transparency between people, businesses, and things.
  • Such transparently immersive experiences may be delivered as augmented reality technologies, connected homes, virtual reality technologies, brain-computer interfaces, human augmentation technologies, nanotube electronics, volumetric displays, 4D printing technologies, or others.
  • the storage systems described above may also, either alone or in combination with other computing environments, be used to support a wide variety of digital platforms.
  • digital platforms can include, for example, 5G wireless systems and platforms, digital twin platforms, edge computing platforms, IoT platforms, quantum computing platforms, serverless PaaS, software-defined security, neuromorphic computing platforms, and so on.
  • digital twins of various “things” such as people, places, processes, systems, and so on.
  • Such digital twins and other immersive technologies can alter the way that humans interact with technology, as conversational platforms, augmented reality, virtual reality and mixed reality provide a more natural and immersive interaction with the digital world.
  • digital twins may be linked with the real-world, perhaps even in real-time, to understand the state of a thing or system, respond to changes, and so on. Because digital twins consolidate massive amounts of information on individual assets and groups of assets (even possibly providing control of those assets), digital twins may communicate with each other to digital factory models of multiple linked digital twins.
  • the storage systems described above may also be part of a multi-cloud environment in which multiple cloud computing and storage services are deployed in a single heterogeneous architecture.
  • DevOps tools may be deployed to enable orchestration across clouds.
  • continuous development and continuous integration tools may be deployed to standardize processes around continuous integration and delivery, new feature rollout and provisioning cloud workloads. By standardizing these processes, a multi-cloud strategy may be implemented that enables the utilization of the best provider for each workload.
  • application monitoring and visibility tools may be deployed to move application workloads around different clouds, identify performance issues, and perform other tasks.
  • security and compliance tools may be deployed for to ensure compliance with security requirements, government regulations, and so on.
  • Such a multi-cloud environment may also include tools for application delivery and smart workload management to ensure efficient application delivery and help direct workloads across the distributed and heterogeneous infrastructure, as well as tools that ease the deployment and maintenance of packaged and custom applications in the cloud and enable portability amongst clouds.
  • the multi-cloud environment may similarly include tools for data portability.
  • the storage systems described above may be used as a part of a platform to enable the use of crypto-anchors that may be used to authenticate a product's origins and contents to ensure that it matches a blockchain record associated with the product.
  • Such crypto-anchors may take many forms including, for example, as edible ink, as a mobile sensor, as a microchip, and others.
  • the storage systems described above may implement various encryption technologies and schemes, including lattice cryptography.
  • Lattice cryptography can involve constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof.
  • public-key schemes such as the RSA, Diffie-Hellman or Elliptic-Curve cryptosystems, which are easily attacked by a quantum computer, some lattice-based constructions appear to be resistant to attack by both classical and quantum computers.
  • a quantum computer is a device that performs quantum computing.
  • Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.
  • Quantum computers differ from traditional computers that are based on transistors, as such traditional computers require that data be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1).
  • quantum computers use quantum bits, which can be in superpositions of states.
  • a quantum computer maintains a sequence of qubits, where a single qubit can represent a one, a zero, or any quantum superposition of those two qubit states.
  • a pair of qubits can be in any quantum superposition of 4 states, and three qubits in any superposition of 8 states.
  • a quantum computer with n qubits can generally be in an arbitrary superposition of up to 2 ⁇ circumflex over ( ) ⁇ n different states simultaneously, whereas a traditional computer can only be in one of these states at any one time.
  • a quantum Turing machine is a theoretical model of such a computer.
  • the storage systems described above may also be paired with FPGA-accelerated servers as part of a larger AI or ML infrastructure.
  • FPGA-accelerated servers may reside near (e.g., in the same data center) the storage systems described above or even incorporated into an appliance that includes one or more storage systems, one or more FPGA-accelerated servers, networking infrastructure that supports communications between the one or more storage systems and the one or more FPGA-accelerated servers, as well as other hardware and software components.
  • FPGA-accelerated servers may reside within a cloud computing environment that may be used to perform compute-related tasks for AI and ML jobs. Any of the embodiments described above may be used to collectively serve as a FPGA-based AI or ML platform.
  • the FPGAs that are contained within the FPGA-accelerated servers may be reconfigured for different types of ML models (e.g., LSTMs, CNNs, GRUs).
  • ML models e.g., LSTMs, CNNs, GRUs.
  • the ability to reconfigure the FPGAs that are contained within the FPGA-accelerated servers may enable the acceleration of a ML or AI application based on the most optimal numerical precision and memory model being used.
  • Readers will appreciate that by treating the collection of FPGA-accelerated servers as a pool of FPGAs, any CPU in the data center may utilize the pool of FPGAs as a shared hardware microservice, rather than limiting a server to dedicated accelerators plugged into it.
  • the FPGA-accelerated servers and the GPU-accelerated servers described above may implement a model of computing where, rather than keeping a small amount of data in a CPU and running a long stream of instructions over it as occurred in more traditional computing models, the machine learning model and parameters are pinned into the high-bandwidth on-chip memory with lots of data streaming though the high-bandwidth on-chip memory.
  • FPGAs may even be more efficient than GPUs for this computing model, as the FPGAs can be programmed with only the instructions needed to run this kind of computing model.
  • the storage systems described above may be configured to provide parallel storage, for example, through the use of a parallel file system such as BeeGFS.
  • a parallel file system such as BeeGFS.
  • Such parallel files systems may include a distributed metadata architecture.
  • the parallel file system may include a plurality of metadata servers across which metadata is distributed, as well as components that include services for clients and storage servers.
  • file contents may be distributed over a plurality of storage servers using striping and metadata may be distributed over a plurality of metadata servers on a directory level, with each server storing a part of the complete file system tree.
  • the storage servers and metadata servers may run in userspace on top of an existing local file system.
  • dedicated hardware is not required for client services, the metadata servers, or the hardware servers as metadata servers, storage servers, and even the client services may be run on the same machines.
  • an information technology platform may be needed to integrate all of these technologies and drive new business opportunities by quickly delivering revenue-generating products, services, and experiences—rather than merely providing the technology to automate internal business processes.
  • Information technology organizations may need to balance resources and investments needed to keep core legacy systems up and running while also integrating technologies to build an information technology platform that can provide the speed and flexibility in areas such as, for example, exploiting big data, managing unstructured data, and working with cloud applications and services.
  • Such an information technology platform is a composable infrastructure that includes fluid resource pools, such as many of the systems described above that, can meet the changing needs of applications by allowing for the composition and recomposition of blocks of disaggregated compute, storage, and fabric infrastructure.
  • a composable infrastructure can also include a single management interface to eliminate complexity and a unified API to discover, search, inventory, configure, provision, update, and diagnose the composable infrastructure.
  • Containerized applications can be managed using a variety of tools.
  • containerized applications may be managed using Docker Swarm, a clustering and scheduling tool for Docker containers that enables IT administrators and developers to establish and manage a cluster of Docker nodes as a single virtual system.
  • containerized applications may be managed through the use of Kubernetes, a container-orchestration system for automating deployment, scaling and management of containerized applications.
  • Kubernetes may execute on top of operating systems such as, for example, Red Hat Enterprise Linux, Ubuntu Server, SUSE Linux Enterprise Servers, and others.
  • a master node may assign tasks to worker/minion nodes.
  • Kubernetes can include a set of components (e.g., kubelet, kube-proxy, cAdvisor) that manage individual nodes as a well as a set of components (e.g., etcd, API server, Scheduler, Control Manager) that form a control plane.
  • Various controllers e.g., Replication Controller, DaemonSet Controller
  • Containerized applications may be used to facilitate a serverless, cloud native computing deployment and management model for software applications.
  • containers may be used as part of an event handling mechanisms (e.g., AWS Lambdas) such that various events cause a containerized application to be spun up to operate as an event handler.
  • an event handling mechanisms e.g., AWS Lambdas
  • the systems described above may be deployed in a variety of ways, including being deployed in ways that support fifth generation (‘5G’) networks.
  • 5G networks may support substantially faster data communications than previous generations of mobile communications networks and, as a consequence may lead to the disaggregation of data and computing resources as modern massive data centers may become less prominent and may be replaced, for example, by more-local, micro data centers that are close to the mobile-network towers.
  • the systems described above may be included in such local, micro data centers and may be part of or paired to multi-access edge computing (‘MEC’) systems.
  • MEC multi-access edge computing
  • Such MEC systems may enable cloud computing capabilities and an IT service environment at the edge of the cellular network. By running applications and performing related processing tasks closer to the cellular customer, network congestion may be reduced and applications may perform better.
  • MEC technology is designed to be implemented at the cellular base stations or other edge nodes, and enables flexible and rapid deployment of new applications and services for customers. MEC may also allow cellular operators to open their radio access network (‘RAN’) to authorized third-parties, such as application developers and content provider. Furthermore, edge computing and micro data centers may substantially reduce the cost of smartphones that work with the 5G network because customer may not need devices with such intensive processing power and the expensive requisite components.
  • RAN radio access network
  • 5G networks may generate more data than previous network generations, especially in view of the fact that the high network bandwidth offered by 5G networks may cause the 5G networks to handle amounts and types of data (e.g., sensor data from self-driving cars, data generated by AR/VR technologies) that did't as feasible for previous generation networks.
  • data e.g., sensor data from self-driving cars, data generated by AR/VR technologies
  • the scalability offered by the systems described above may be very valuable as the amount of data increases, adoption of emerging technologies increase, and so on.
  • FIG. 3 D illustrates an exemplary computing device 350 that may be specifically configured to perform one or more of the processes described herein.
  • computing device 350 may include a communication interface 352 , a processor 354 , a storage device 356 , and an input/output (“I/O”) module 358 communicatively connected one to another via a communication infrastructure 360 .
  • I/O input/output
  • FIG. 3 D the components illustrated in FIG. 3 D are not intended to be limiting. Additional or alternative components may be used in other embodiments. Components of computing device 350 shown in FIG. 3 D will now be described in additional detail.
  • Communication interface 352 may be configured to communicate with one or more computing devices. Examples of communication interface 352 include, without limitation, a wired network interface (such as a network interface card), a wireless network interface (such as a wireless network interface card), a modem, an audio/video connection, and any other suitable interface.
  • a wired network interface such as a network interface card
  • a wireless network interface such as a wireless network interface card
  • modem an audio/video connection
  • Processor 354 generally represents any type or form of processing unit capable of processing data and/or interpreting, executing, and/or directing execution of one or more of the instructions, processes, and/or operations described herein. Processor 354 may perform operations by executing computer-executable instructions 362 (e.g., an application, software, code, and/or other executable data instance) stored in storage device 356 .
  • computer-executable instructions 362 e.g., an application, software, code, and/or other executable data instance
  • Storage device 356 may include one or more data storage media, devices, or configurations and may employ any type, form, and combination of data storage media and/or device.
  • storage device 356 may include, but is not limited to, any combination of the non-volatile media and/or volatile media described herein.
  • Electronic data, including data described herein, may be temporarily and/or permanently stored in storage device 356 .
  • data representative of computer-executable instructions 362 configured to direct processor 354 to perform any of the operations described herein may be stored within storage device 356 .
  • data may be arranged in one or more databases residing within storage device 356 .
  • I/O module 358 may include one or more I/O modules configured to receive user input and provide user output.
  • I/O module 358 may include any hardware, firmware, software, or combination thereof supportive of input and output capabilities.
  • I/O module 358 may include hardware and/or software for capturing user input, including, but not limited to, a keyboard or keypad, a touchscreen component (e.g., touchscreen display), a receiver (e.g., an RF or infrared receiver), motion sensors, and/or one or more input buttons.
  • I/O module 358 may include one or more devices for presenting output to a user, including, but not limited to, a graphics engine, a display (e.g., a display screen), one or more output drivers (e.g., display drivers), one or more audio speakers, and one or more audio drivers.
  • I/O module 358 is configured to provide graphical data to a display for presentation to a user.
  • the graphical data may be representative of one or more graphical user interfaces and/or any other graphical content as may serve a particular implementation.
  • any of the systems, computing devices, and/or other components described herein may be implemented by computing device 350 .
  • FIG. 4 illustrates an example of a storage system 400 with a storage controller to perform erase block trimming for heterogeneous flash memory storage devices.
  • the storage system 400 may include an erase block trimming component 406 that may perform an erase block trimming process for a storage array.
  • the storage system 400 may include a storage controller 401 and storage devices 402 and 403 of a storage array. Although a single storage controller and two storage devices are illustrated, any number of storage controllers and storage devices may be included in the storage system 400 .
  • the storage devices 402 and 403 may be direct-mapped storage devices that do not include an internal storage controller.
  • the storage devices 402 and 403 may be heterogeneous solid-state storage devices, where storage device 402 has a different erase block size than storage device 403 .
  • the storage controller 401 may include an erase block trimming component 406 that initiates and/or performs erase block trimming (also referred to as “reclaiming” hereafter) for heterogeneous storage devices 402 and 403 .
  • the erase block trimming component 406 may determine whether an allocation unit shares an erase block with another allocation unit (e.g., the allocation unit is a misaligned allocation unit). The erase block trimming component 406 may further relocate the data of the other allocation unit that shares the erase block with the misaligned allocation unit. Upon relocating the data, the erase block trimming component 406 may reclaim the erase blocks associated with the misaligned allocation unit. Further details with regards to the read frequency determination process are described in conjunction with FIGS. 5 - 11 below.
  • FIG. 5 is an example method 500 to perform operations of an erase block trimming process in accordance with embodiments of the disclosure.
  • the method 500 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof.
  • the erase block trimming component 406 of FIG. 4 may perform the method 500 .
  • Method 500 may begin at block 502 , where the processing logic determines that a first allocation unit has a first portion occupying a first group of erase blocks and a second portion sharing a second erase block with a portion of a second allocation unit.
  • the first allocation unit may be a misaligned allocation unit.
  • the first allocation unit may have data stored at an erase block that is shared with other data for the second allocation unit.
  • the processing logic relocates data of the portion of the second allocation unit to another erase block. For example, the processing logic may relocate the other data stored at the erase block that is shared with the first allocation unit to another erase block to prevent the data from being lost when the erase blocks associated with the first allocation unit are reclaimed.
  • the processing logic may reclaim the first group of erase blocks and the second erase block that are associated with the first allocation unit. For example, a garbage collection process may be performed on the erase blocks of the first allocation unit to erase the data stored at the erase blocks and make the blocks available for subsequent programming operations.
  • FIG. 6 is an example method 600 to perform operations of an erase block trimming process for heterogeneous flash memory storage devices in accordance with embodiments of the disclosure.
  • the method 600 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof.
  • the erase block trimming component 406 of FIG. 4 that is external to a storage device may perform the method 600 .
  • Method 600 may begin at block 602 , where the processing logic receives a request to trim a first allocation unit of a storage device of a storage array.
  • the request to trim the allocation unit may be received from an authority, as previously described.
  • the processing logic may receive a request from an authority to trim the data stored at erase blocks of the first allocation unit.
  • the processing logic determines whether the first allocation unit shares a portion of an erase block with a second allocation unit. If the processing logic determines that the first allocation unit does not share a portion of an erase block with a second allocation unit, then the first allocation unit is not a misaligned allocation unit. Accordingly, the erase blocks of the first allocation unit may be trimmed without the need to relocate any data. If the processing logic determines that the first allocation unit shares a portion of an erase block with a second allocation unit, then the first allocation unit is a misaligned allocation unit. Accordingly, data of the second allocation unit that shares the erase block with the first allocation unit may need to be relocated prior to trimming the erase blocks of the first allocation unit to prevent loss of the data.
  • the processing logic relocates data of the portion of the second allocation unit. For example, the processing logic may relocate the data by reading the data from the storage device and subsequently programming the data to a new erase block. In embodiments, the processing logic may update a mapping data structure and/or program metadata to associate the data with the location of the new erase block the data was relocated to.
  • the processing logic trims erase blocks associated with the first allocation unit. For example, the processing logic may trim the erase blocks of the first allocation unit, including the erase block that was shared with the second allocation unit.
  • FIG. 7 A is an illustration 700 of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to another erase block in accordance with embodiments of the disclosure.
  • the storage system is directed to trim an allocation unit A, for example from a file system or authority direction to delete a file or other direction to delete data.
  • Allocation unit A occupies erase blocks 702 numbered 1, 2, 3 and 4, and part of erase blocks 702 numbered 0 and 5. Also, part of erase block 702 numbered 0 is occupied by part of allocation unit B, and part of erase block 702 numbered 5 is occupied by part of allocation unit C.
  • allocation units B and C do not belong to a same RAID 6 stripe.
  • the storage system for example a storage array controller, a storage unit controller, a storage node processor, or a high-availability storage controller, etc., writes metadata to declare allocation unit A is obsoleted (e.g., declares obsoleted or dead data) in erase blocks 702 numbered 0, 1, 2, 3, 4 and 5.
  • the storage system relocates data of allocation units B and C from erase blocks 702 numbered 0 and 5, respectively, to erase block 704 .
  • the storage system may determine the amount of data of allocation unit B and allocation unit C.
  • the data of allocation units B and C may both be relocated to erase block 704 . If the amount of data of allocation unit B, when combined with the amount of data of allocation unit C, is greater than the size of erase block 704 , then the data of allocation units B and C may be relocated to different erase blocks, as will be described below at FIG. 7 B .
  • garbage collection can then proceed to erase and reclaim erase blocks 702 numbered 0, 1, 2, 3, 4 and 5.
  • the six erase blocks 702 are reserved for another allocation unit.
  • the allocation unit may be assigned to a free block holder that includes other available allocation units of the storage device, as will be described in further detail below.
  • the numbers of erase blocks, and the various allocation units and alignments can be varied in further examples as readily understood and devised.
  • FIG. 7 B is an illustration 750 of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to other erase blocks in accordance with embodiments of the disclosure.
  • Illustration 750 includes similar components as illustration 700 of FIG. 7 A .
  • the amount of the amount of data of allocation unit B when combined with the amount of data of allocation unit C, is greater than the size of erase block 704 .
  • the data of allocation units B and C may be relocated to different erase blocks. Accordingly, data of allocation unit B may be relocated to erase block 704 and data of allocation unit C may be relocated to erase block 706 .
  • FIG. 8 is an illustration 800 of an example of forming a wide RAID stripe including multiple erase blocks in accordance with embodiments of the disclosure.
  • one or more of the erase blocks 802 are in RAID 6 stripes 806 a and 806 b.
  • the probability of failure of one of the RAID 6 stripes 806 in the storage system increases due to the larger number of RAID 6 stripes 806 in the storage system, even though the failure rate of a specific RAID 6 stripe 806 is unchanged.
  • the use of a wide RAID stripe 804 with a number of erase blocks 802 that is greater than any of the RAID 6 stripes 806 , improves reliability as the total amount of storage memory increases.
  • the wide RAID stripe 804 is formed of one hundred erase blocks 802 wide plus a parity shard (e.g., parity shard P) in erase block 802 numbered 100 .
  • the parity shard in one embodiment, is calculated by performing XOR operations from erase blocks 802 , on a bitwise, page-wise or erase block basis. If an erase block fails, the storage system performs a RAID 6 rebuild. For example, the RAID 6 stripe affected by the failed erase block may be rebuilt, or a portion of the RAID 6 stripe could be rebuilt. Occasionally, however, a RAID rebuild fails.
  • the storage system reads the erase blocks 802 , including the parity shard, of the wide RAID stripe 804 , and performs a rebuild based on those erase blocks 802 .
  • the storage system could rebuild a page of the failed erase block 802 , or more pages, or the entire erase block 802 .
  • the system verifies the recovery of the failed erase block 802 and verifies the recovery of the RAID 6 stripe 806 .
  • the system could perform a RAID 6 rebuild for the RAID 6 stripe 806 , using the rebuilt page(s) or rebuilt erase block 802 . With this double-level redundancy to correct failed erase blocks in the storage system, first in the RAID 6 stripe 806 , and then in the wide RAID stripe 804 , the storage system has improved reliability for data stored at the storage system.
  • the trimming of the allocation unit A and relocation of data from portions of allocation units B and C from wide RAID stripe 804 affects the parity of the wide RAID stripe 804 .
  • the storage system may obsolete the data of the parity shard P in erase block 802 numbered 100 , then calculate and write a new parity shard into the erase block 802 numbered 100 .
  • the data of the parity shard P erase block 802 numbered 100 is left intact and a new parity shard (e.g., P′ at erase block 802 numbered 101 ) is calculated.
  • the new parity shard may be calculated by performing XOR operations across the remaining data and the earlier parity shard P, and write parity shard P′ to erase block 802 numbered 101 . This process can be repeated until there are too many parity shards, for example the number of erase blocks 802 for parity shards exceeds a threshold, as will be described in further detail below. Then, the erase blocks 802 for parity shards can be trimmed, and a new parity shard calculated for the remaining data in the wide RAID stripe 804 .
  • FIG. 9 is an example method 900 to perform rebuild operations on failed erase blocks of a storage system using a wide RAID stripe in accordance with embodiments of the disclosure.
  • the method 900 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof.
  • the storage controller 401 of FIG. 4 that is external to a storage device may perform the method 900 .
  • Method 900 may begin at block 902 , where the processing logic forms multiple RAID 6 stripes across erase blocks of a solid-state storage device.
  • the processing logic forms a wide RAID stripe, including at least one parity shard, across a number of erase blocks of the solid-state storage memory.
  • the number of erase blocks of the solid-state storage memory may be greater than the number of erase blocks for a single RAID 6 stripe formed at block 902 .
  • the processing logic determines if an erase block failure has occurred. If the processing logic determines that an erase block failure has not occurred, then the storage system may proceed with normal operations. If the processing logic determines that an erase block failure has occurred, then at block 908 the processing logic performs a RAID 6 rebuild for the RAID 6 stripe that is affected by the failed erase block.
  • the processing logic determines if a RAID 6 rebuild failure occurred. If the processing logic determines that a RAID 6 rebuild failure has not occurred, then the storage system may proceed with normal operations. If the processing logic determines that a RAID 6 rebuild failure has occurred, then at block 912 , the processing logic reads all erase blocks of the wide RAID stripe, including the at least one parity shard.
  • the processing logic rebuilds one or more pages of the failed erase block in accordance with all the erase blocks of the wide RAID stripe, including the at least one parity shard.
  • the processing logic verifies that the rebuilding of the failed erase block and the rebuilding of the RAID 6 stripe were successful. In some embodiments, if the RAID 6 stripe has not been successfully rebuilt, the processing logic may perform a RAID 6 rebuild for the RAID 6 stripe affected by the failed erase block using the rebuilt pages of the failed erase block.
  • FIG. 10 is an example method 1000 to generate parity for a wide RAID stripe in accordance with embodiments of the disclosure.
  • the method 1000 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof.
  • the storage controller 401 of FIG. 4 may perform the method 1000 .
  • Method 1000 may begin at block 1002 , where the processing logic trims an allocation unit from a wide RAID stripe.
  • the processing logic determines a new parity shard based on the previous parity shard of the wide RAID stripe and remaining data of the wide RAID stripe. The new parity shard is then stored at a new erase block of the wide RAID stripe.
  • the processing logic determines if the number of erase blocks used for parity shards in the wide RAID stripe exceeds a threshold. If the number of erase blocks used for parity shards in the wide RAID stripe exceeds a threshold, at block 1008 the processing logic trims erase blocks used for parity shards in the wide RAID stipe. Upon trimming the erase blocks used for parity shards, at block 1010 the processing logic determines another parity shard from the remaining data in the wide RAID stripe. The other parity shard is then stored at an erase block of the wide RAID stripe. If the processing logic determines that the number of erase blocks used for parity shards does not exceed the threshold, then at block 1012 the processing logic determines to not trim erase blocks used for parity shards.
  • FIG. 11 A is an illustration 1100 of an example of assigning data blocks of a reclaimed allocation unit to a free block holder in accordance with embodiments of the disclosure.
  • authority 1102 may direct storage device 1104 of a storage system to reclaim an allocation unit (AU).
  • the AU may be reclaimed/trimmed, as previously described, resulting in reclaimed AU 1106 .
  • the data blocks of the reclaimed AU 1106 may be assigned to a free block holder 1108 that includes other available data blocks on storage device 1104 .
  • free block holder 1108 is shown for illustrative purposes and is not a physical component of storage device 1104 .
  • illustration 1100 shows a single authority and a single storage device, embodiments of the disclosure may utilize any number of authorities and any number of storage devices in any combination.
  • FIG. 11 B is an illustration 1125 of an example of a storage device receiving a request for additional allocation units from an authority in accordance with some embodiments of the disclosure.
  • authority 1102 determines that additional AUs are required for programming operations to store data at storage device 1104 . Accordingly, authority 1102 may transmit a request for additional AUs to storage device 1104 . The request may include a particular number of AUs required by the authority 1102 .
  • the storage device 1104 may generate new AUs from available data blocks, including the data blocks of reclaimed AU 1106 , assigned to the free block holder 1108 to provide to the authority 1102 .
  • the storage device 1104 may select data blocks from the free block holder 1108 that correspond to physical locations on the storage device 1104 that allow for the performance of parallel programming operations.
  • the new AUs may have data blocks that are located on certain word lines of the storage device 1104 that allow for programming operations to be performed on the blocks in parallel. By selecting data blocks and providing AUs in such a manner, the performance of the storage system may be improved by allowing multiple programming operations to be performed in parallel with one another.
  • FIG. 11 C is an illustration 1150 of an example of a storage device providing the additional allocation units to an authority in accordance with embodiments of the disclosure.
  • storage device 1104 may provide authority 1102 with the new AUs including data blocks from the free block holder 1108 .
  • the storage device 1104 may provide the authority 1102 with AU identifiers for the identified AUs from the free block holder 1108 .
  • the authority 1102 may then use the AU identifiers provided by the storage device 1104 for subsequent programming operations by providing data to be stored at the AUs along with the AU identifiers.
  • the authority 1102 may send a subsequent direction to reclaim the AUs, and the process as previously described at FIGS. 11 A-C may be repeated.
  • the AU identifiers provided by the storage device 1104 to the authority 1102 may correspond to sequence numbers that are incrementally increased as each AU is identified by the storage device 1104 .
  • storage device 1104 may be able to determine if the authority 1102 received previously identified AUs of the storage device 1104 before sending additional AUs to the authority 1102 .
  • authority 1102 may request AUs from storage device 1104 .
  • the request for AUs from the authority 1102 may include an indication of the highest sequence number of an AU identifier that was most recently provided to the authority 1102 prior to the request. For example, if the highest sequence number of an AU identifier that was most recently provided to the authority prior to the request was 2000, then the request for AUs sent to storage device 1104 may indicate that the highest sequence number of an AU previously provided to the authority 1102 is 2000.
  • the storage device 1104 may generate AUs and assign sequence numbers that incrementally increase to the generated AUs. For example, if the storage device 1104 generates 50 AUs that are to be provided to the authority 1102 , the storage device 1104 may incrementally assign sequence numbers 2001-2050 to the 50 new AUs.
  • the storage system may experience an unexpected loss of power or storage device 1104 may crash.
  • the authority 1102 if the authority 1102 does not receive AUs in response to the request, the authority 1102 sends an additional request for AUs to storage device 1104 .
  • the storage device 1104 unaware that the authority 1102 never received the previously generated AUs (e.g., AUs 2001-2050), generates 50 new AUs and provides these 50 new AUs to the authority 1102 .
  • the authority 1102 may never direct the storage device 1104 to trim the previously generated AUs so that the previously generated AUs can be used for subsequent programming operations. This results in the previously generated AUs being in an idle state where the previously generated AUs are never used for the storage of data, decreasing the storage capacity and performance of the storage system.
  • the storage device 1104 can determine that the authority 1102 has not received the previously generated AUs by comparing the highest sequence number of an AU generated by the storage device 1104 to the sequence number included in the request from the authority 1102 . For example, the storage device 1104 may receive a request from the authority 1102 that indicates the highest sequence number for the most recently provided AU is 2000. The storage device 1104 may then compare this value with the highest sequence number (e.g., 2050) of an AU generated by the storage device 1104 .
  • the highest sequence number e.g., 2050
  • the storage device 1104 determines that the authority 1102 never received the 50 previously generated AUs. Accordingly, rather than generating 50 new AUs, the storage device 1104 provides the 50 previously identified AUs to the authority 1102 . By providing the previously generated AUs to the authority 1102 rather than generating and providing new AUs, the storage capacity and performance of the storage system is increased.

Abstract

A system includes a solid-state storage array having a plurality of solid-state storage devices and a storage controller coupled to the solid-state storage array, the storage controller including a processing device, the processing device to determine that a first allocation unit has a first portion occupying a first plurality of erase blocks and a second portion sharing a second erase block with a portion of a second allocation unit. The processing device is further to relocate data of the portion of the second allocation unit sharing the second erase block with the second portion of the first allocation unit to another erase block and in response to relocating the data of the portion of the second allocation unit, reclaim the first plurality of erase blocks and the second erase block.

Description

  • Storage systems, such as enterprise storage systems, may include a centralized or de-centralized repository for data that provides common data management, data protection, and data sharing functions, for example, through connections to computer systems.
  • BRIEF DESCRIPTION OF DRAWINGS
  • FIG. 1A illustrates a first example system for data storage in accordance with some implementations.
  • FIG. 1B illustrates a second example system for data storage in accordance with some implementations.
  • FIG. 1C illustrates a third example system for data storage in accordance with some implementations.
  • FIG. 1D illustrates a fourth example system for data storage in accordance with some implementations.
  • FIG. 2A 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. 2B is a block diagram showing an interconnect switch coupling multiple storage nodes in accordance with some embodiments.
  • FIG. 2C 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. 2D shows a storage server environment, which uses embodiments of the storage nodes and storage units of some previous figures in accordance with some embodiments.
  • FIG. 2E 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. 2F depicts elasticity software layers in blades of a storage cluster, in accordance with some embodiments.
  • FIG. 2G depicts authorities and storage resources in blades of a storage cluster, in accordance with some embodiments.
  • FIG. 3A sets forth a diagram of a storage system that is coupled for data communications with a cloud services provider in accordance with some embodiments of the present disclosure.
  • FIG. 3B sets forth a diagram of a storage system in accordance with some embodiments of the present disclosure.
  • FIG. 3C sets forth an example of a cloud-based storage system in accordance with some embodiments of the present disclosure.
  • FIG. 3D illustrates an exemplary computing device that may be specifically configured to perform one or more of the processes described herein.
  • FIG. 4 illustrates an example of a storage system with a storage controller to perform erase block trimming for heterogeneous flash memory storage devices.
  • FIG. 5 is an example method to perform operations of an erase block trimming process in accordance with embodiments of the disclosure.
  • FIG. 6 is an example method to perform operations of an erase block trimming process for heterogeneous flash memory storage devices in accordance with embodiments of the disclosure.
  • FIG. 7A is an illustration of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to another erase block in accordance with embodiments of the disclosure.
  • FIG. 7B is an illustration of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to other erase blocks in accordance with embodiments of the disclosure.
  • FIG. 8 is an illustration of an example of forming a wide RAID stripe including multiple erase blocks in accordance with embodiments of the disclosure.
  • FIG. 9 is an example method to perform rebuild operations on failed erase blocks of a storage system using a wide RAID stripe in accordance with embodiments of the disclosure.
  • FIG. 10 is an example method to generate parity for a wide RAID stripe in accordance with embodiments of the disclosure.
  • FIG. 11A is an illustration of an example of assigning data blocks a reclaimed allocation unit to a free block holder in accordance with embodiments of the disclosure.
  • FIG. 11B is an illustration of an example of a storage device receiving a request for additional allocation units from an authority in accordance with some embodiments of the disclosure.
  • FIG. 11C is an illustration of an example of a storage device providing the additional allocation units to an authority in accordance with embodiments of the disclosure.
  • DETAILED DESCRIPTION
  • A flash memory storage device has an erase block size that corresponds to the smallest unit of the storage device that can be erased. Flash memory erase block sizes, from different present manufacturers and for projected future flash memory storage devices, are not a single, fixed size. For example, one flash memory may have an erase block size of 4 megabytes (MB), another at 8 MB, 9 MB, 12 MB, 16 MB, 24 MB, 64 MB, etc. Future flash memory storage devices may be available with 80 MB erase blocks. It is projected that an erase block size could be 1 GB within a 3 to 10 year time period. This is not a problem for solid-state drives tied to a single vendor and/or single design of flash memory, with uniform erase block sizes. However, it is a problem for a storage cluster with the ability to add or replace solid state storage devices having different erase block sizes, and having a projected storage cluster lifespan over many years with an evolving heterogeneous mix of blades and solid-state storage devices.
  • A storage system may be built from multiple storage devices (which may be removable) that provide durable storage and present such to the storage system. For example, the durable storage may be built from multiple flash memory storage devices from one or more storage device manufacturers. Within that context, a storage system manages erase blocks within and across the durable storage elements that contain those flash memory storage devices, or at least maps segments of data managed by the storage system implementation directly onto erase blocks or ranges of erase blocks.
  • To compensate for a different erase block size of a newly added storage device, one conventional solution is to modify software for every hardware replacement in such a storage system. However, such a process is tedious, time consuming and error prone. Another conventional solution is to use the smallest erase block size as a least common denominator for physical memory allocation in the storage devices. However, such a conventional solution would result in wasted memory space in storage devices having larger erase blocks, decreasing the performance of the storage system.
  • Turning now to embodiments of a storage system that has low write amplification, aspects of allocation unit trimming, data relocation, wide RAID stripe formation and data recovery are discussed. In the examples below, allocation units for data (and metadata) storage are not required to align with erase block boundaries, and may be referred to as unaligned or misaligned allocation units. Misaligned allocation units may give rise to write amplification in a storage system, as a result of having to perform additional write operations when allocation units are trimmed, to move other data in erase blocks so that the erase blocks can be reclaimed through garbage collection. This problem is made worse when write amplification for metadata that tracks the location of data is considered. Write amplification for trimming misaligned allocation units produces write amplification for the data and write amplification for the metadata tracking the data, both of which are associated with the misaligned allocation units. Various aspects in a solution described below reduce data movement from allocation unit trimming and garbage collection and thereby decrease write amplification in the storage system. These aspects can be used singly or in combination in various embodiments of storage systems.
  • Embodiments of the present disclosure address the above deficiencies by processing logic of a storage system determining that an allocation unit that is to be reclaimed is a misaligned allocation unit. The misaligned allocation unit may share one or more erase blocks with data of another allocation unit. To prevent the data of the other allocation unit that is sharing an erase block with the misaligned allocation unit from being lost when the misaligned allocation unit is reclaimed, the data for the other allocation unit may be relocated to a new erase block. Once the data has been relocated to the new erase block, the erase blocks of the misaligned allocation unit, including the erase block that is shared with the other allocation unit, are reclaimed by erasing the data stored at the erase blocks.
  • In some embodiments, a wide RAID stripe may be implemented in addition to RAID 6 stripes to rebuild data that may become corrupted as a result of the write operations being performed on the storage device. The wide RAID stripe may be over a larger number of erase blocks of a storage device than a RAID 6 stripe and may include at least one parity shard. The wide RAID stripe may allow for the rebuilding of corrupted data stored at the storage device that cannot be reconstructed using a RAID 6 rebuild.
  • Accordingly, embodiments of the present disclosure provide for an improved storage system by relocating data sharing an erase block with a misaligned allocation unit of a storage device. By relocating the data, the data is preserved while allowing the use of different sized erase blocks that are inherent in a storage system including heterogeneous flash memory storage devices, without requiring the modification of software with the addition of each new flash memory storage device. Furthermore, in embodiments utilizing a wide RAID stripe, the ability of the storage system to rebuild corrupted data is enhanced, improving the data retention and reliability of the storage system.
  • Example methods, apparatus, and products for erase block trimming for heterogeneous flash memory storage devices in accordance with embodiments of the present disclosure are described with reference to the accompanying drawings, beginning with FIG. 1A. FIG. 1A illustrates an example system for data storage, in accordance with some implementations. System 100 (also referred to as “storage system” herein) includes numerous elements for purposes of illustration rather than limitation. It may be noted that system 100 may include the same, more, or fewer elements configured in the same or different manner in other implementations.
  • System 100 includes a number of computing devices 164A-B. Computing devices (also referred to as “client devices” herein) may be embodied, for example, a server in a data center, a workstation, a personal computer, a notebook, or the like. Computing devices 164A-B may be coupled for data communications to one or more storage arrays 102A-B through a storage area network (‘SAN’) 158 or a local area network (‘LAN’) 160.
  • The SAN 158 may be implemented with a variety of data communications fabrics, devices, and protocols. For example, the fabrics for SAN 158 may include Fibre Channel, Ethernet, Infiniband, Serial Attached Small Computer System Interface (‘SAS’), or the like. Data communications protocols for use with SAN 158 may include Advanced Technology Attachment (‘ATA’), Fibre Channel Protocol, Small Computer System Interface (‘SCSI’), Internet Small Computer System Interface (‘iSCSI’), HyperSCSI, Non-Volatile Memory Express (‘NVMe’) over Fabrics, or the like. It may be noted that SAN 158 is provided for illustration, rather than limitation. Other data communication couplings may be implemented between computing devices 164A-B and storage arrays 102A-B.
  • The LAN 160 may also be implemented with a variety of fabrics, devices, and protocols. For example, the fabrics for LAN 160 may include Ethernet (802.3), wireless (802.11), or the like. Data communication protocols for use in LAN 160 may include Transmission Control Protocol (‘TCP’), User Datagram Protocol (‘UDP’), Internet Protocol (‘IP’), HyperText Transfer Protocol (‘HTTP’), Wireless Access Protocol (‘WAP’), Handheld Device Transport Protocol (‘HDTP’), Session Initiation Protocol (SIP), Real Time Protocol (‘RTP’), or the like.
  • Storage arrays 102A-B may provide persistent data storage for the computing devices 164A-B. Storage array 102A may be contained in a chassis (not shown), and storage array 102B may be contained in another chassis (not shown), in implementations. Storage array 102A and 102B may include one or more storage array controllers 110A-D (also referred to as “controller” herein). A storage array controller 110A-D may be embodied as a module of automated computing machinery comprising computer hardware, computer software, or a combination of computer hardware and software. In some implementations, the storage array controllers 110A-D may be configured to carry out various storage tasks. Storage tasks may include writing data received from the computing devices 164A-B to storage array 102A-B, erasing data from storage array 102A-B, retrieving data from storage array 102A-B and providing data to computing devices 164A-B, monitoring and reporting of disk utilization and performance, performing redundancy operations, such as Redundant Array of Independent Drives (‘RAID’) or RAID-like data redundancy operations, compressing data, encrypting data, and so forth.
  • Storage array controller 110A-D may be implemented in a variety of ways, including as a Field Programmable Gate Array (‘FPGA’), a Programmable Logic Chip (‘PLC’), an Application Specific Integrated Circuit (‘ASIC’), System-on-Chip (‘SOC’), or any computing device that includes discrete components such as a processing device, central processing unit, computer memory, or various adapters. Storage array controller 110A-D may include, for example, a data communications adapter configured to support communications via the SAN 158 or LAN 160. In some implementations, storage array controller 110A-D may be independently coupled to the LAN 160. In implementations, storage array controller 110A-D may include an I/O controller or the like that couples the storage array controller 110A-D for data communications, through a midplane (not shown), to a persistent storage resource 170A-B (also referred to as a “storage resource” herein). The persistent storage resource 170A-B main include any number of storage drives 171A-F (also referred to as “storage devices” herein) and any number of non-volatile Random Access Memory (‘NVRAM’) devices (not shown).
  • In some implementations, the NVRAM devices of a persistent storage resource 170A-B may be configured to receive, from the storage array controller 110A-D, data to be stored in the storage drives 171A-F. In some examples, the data may originate from computing devices 164A-B. In some examples, writing data to the NVRAM device may be carried out more quickly than directly writing data to the storage drive 171A-F. In implementations, the storage array controller 110A-D may be configured to utilize the NVRAM devices as a quickly accessible buffer for data destined to be written to the storage drives 171A-F. Latency for write requests using NVRAM devices as a buffer may be improved relative to a system in which a storage array controller 110A-D writes data directly to the storage drives 171A-F. In some implementations, the NVRAM devices may be implemented with computer memory in the form of high bandwidth, low latency RAM. The NVRAM device is referred to as “non-volatile” because the NVRAM device may receive or include a unique power source that maintains the state of the RAM after main power loss to the NVRAM device. Such a power source may be a battery, one or more capacitors, or the like. In response to a power loss, the NVRAM device may be configured to write the contents of the RAM to a persistent storage, such as the storage drives 171A-F.
  • In implementations, storage drive 171A-F may refer to any device configured to record data persistently, where “persistently” or “persistent” refers as to a device's ability to maintain recorded data after loss of power. In some implementations, storage drive 171A-F may correspond to non-disk storage media. For example, the storage drive 171A-F may be one or more solid-state drives (‘SSDs’), flash memory based storage, any type of solid-state non-volatile memory, or any other type of non-mechanical storage device. In other implementations, storage drive 171A-F may include may include mechanical or spinning hard disk, such as hard-disk drives (‘HDD’).
  • In some implementations, the storage array controllers 110A-D may be configured for offloading device management responsibilities from storage drive 171A-F in storage array 102A-B. For example, storage array controllers 110A-D may manage control information that may describe the state of one or more memory blocks in the storage drives 171A-F. The control information may indicate, for example, that a particular memory block has failed and should no longer be written to, that a particular memory block contains boot code for a storage array controller 110A-D, the number of program-erase (‘P/E’) cycles that have been performed on a particular memory block, the age of data stored in a particular memory block, the type of data that is stored in a particular memory block, and so forth. In some implementations, the control information may be stored with an associated memory block as metadata. In other implementations, the control information for the storage drives 171A-F may be stored in one or more particular memory blocks of the storage drives 171A-F that are selected by the storage array controller 110A-D. The selected memory blocks may be tagged with an identifier indicating that the selected memory block contains control information. The identifier may be utilized by the storage array controllers 110A-D in conjunction with storage drives 171A-F to quickly identify the memory blocks that contain control information. For example, the storage controllers 110A-D may issue a command to locate memory blocks that contain control information. It may be noted that control information may be so large that parts of the control information may be stored in multiple locations, that the control information may be stored in multiple locations for purposes of redundancy, for example, or that the control information may otherwise be distributed across multiple memory blocks in the storage drive 171A-F.
  • In implementations, storage array controllers 110A-D may offload device management responsibilities from storage drives 171A-F of storage array 102A-B by retrieving, from the storage drives 171A-F, control information describing the state of one or more memory blocks in the storage drives 171A-F. Retrieving the control information from the storage drives 171A-F may be carried out, for example, by the storage array controller 110A-D querying the storage drives 171A-F for the location of control information for a particular storage drive 171A-F. The storage drives 171A-F may be configured to execute instructions that enable the storage drive 171A-F to identify the location of the control information. The instructions may be executed by a controller (not shown) associated with or otherwise located on the storage drive 171A-F and may cause the storage drive 171A-F to scan a portion of each memory block to identify the memory blocks that store control information for the storage drives 171A-F. The storage drives 171A-F may respond by sending a response message to the storage array controller 110A-D that includes the location of control information for the storage drive 171A-F. Responsive to receiving the response message, storage array controllers 110A-D may issue a request to read data stored at the address associated with the location of control information for the storage drives 171A-F.
  • In other implementations, the storage array controllers 110A-D may further offload device management responsibilities from storage drives 171A-F by performing, in response to receiving the control information, a storage drive management operation. A storage drive management operation may include, for example, an operation that is typically performed by the storage drive 171A-F (e.g., the controller (not shown) associated with a particular storage drive 171A-F). A storage drive management operation may include, for example, ensuring that data is not written to failed memory blocks within the storage drive 171A-F, ensuring that data is written to memory blocks within the storage drive 171A-F in such a way that adequate wear leveling is achieved, and so forth.
  • In implementations, storage array 102A-B may implement two or more storage array controllers 110A-D. For example, storage array 102A may include storage array controllers 110A and storage array controllers 110B. At a given instance, a single storage array controller 110A-D (e.g., storage array controller 110A) of a storage system 100 may be designated with primary status (also referred to as “primary controller” herein), and other storage array controllers 110A-D (e.g., storage array controller 110A) may be designated with secondary status (also referred to as “secondary controller” herein). The primary controller may have particular rights, such as permission to alter data in persistent storage resource 170A-B (e.g., writing data to persistent storage resource 170A-B). At least some of the rights of the primary controller may supersede the rights of the secondary controller. For instance, the secondary controller may not have permission to alter data in persistent storage resource 170A-B when the primary controller has the right. The status of storage array controllers 110A-D may change. For example, storage array controller 110A may be designated with secondary status, and storage array controller 110B may be designated with primary status.
  • In some implementations, a primary controller, such as storage array controller 110A, may serve as the primary controller for one or more storage arrays 102A-B, and a second controller, such as storage array controller 110B, may serve as the secondary controller for the one or more storage arrays 102A-B. For example, storage array controller 110A may be the primary controller for storage array 102A and storage array 102B, and storage array controller 110B may be the secondary controller for storage array 102A and 102B. In some implementations, storage array controllers 110C and 110D (also referred to as “storage processing modules”) may neither have primary or secondary status. Storage array controllers 110C and 110D, implemented as storage processing modules, may act as a communication interface between the primary and secondary controllers (e.g., storage array controllers 110A and 110B, respectively) and storage array 102B. For example, storage array controller 110A of storage array 102A may send a write request, via SAN 158, to storage array 102B. The write request may be received by both storage array controllers 110C and 110D of storage array 102B. Storage array controllers 110C and 110D facilitate the communication, e.g., send the write request to the appropriate storage drive 171A-F. It may be noted that in some implementations storage processing modules may be used to increase the number of storage drives controlled by the primary and secondary controllers.
  • In implementations, storage array controllers 110A-D are communicatively coupled, via a midplane (not shown), to one or more storage drives 171A-F and to one or more NVRAM devices (not shown) that are included as part of a storage array 102A-B. The storage array controllers 110A-D may be coupled to the midplane via one or more data communication links and the midplane may be coupled to the storage drives 171A-F and the NVRAM devices via one or more data communications links. The data communications links described herein are collectively illustrated by data communications links 108A-D and may include a Peripheral Component Interconnect Express (‘PCIe’) bus, for example.
  • FIG. 1B illustrates an example system for data storage, in accordance with some implementations. Storage array controller 101 illustrated in FIG. 1B may similar to the storage array controllers 110A-D described with respect to FIG. 1A. In one example, storage array controller 101 may be similar to storage array controller 110A or storage array controller 110B. Storage array controller 101 includes numerous elements for purposes of illustration rather than limitation. It may be noted that storage array controller 101 may include the same, more, or fewer elements configured in the same or different manner in other implementations. It may be noted that elements of FIG. 1A may be included below to help illustrate features of storage array controller 101.
  • Storage array controller 101 may include one or more processing devices 104 and random access memory (‘RAM’) 111. Processing device 104 (or controller 101) represents one or more general-purpose processing devices such as a microprocessor, central processing unit, or the like. More particularly, the processing device 104 (or controller 101) may be a complex instruction set computing (‘CISC’) microprocessor, reduced instruction set computing (‘RISC’) microprocessor, very long instruction word (‘VLIW’) microprocessor, or a processor implementing other instruction sets or processors implementing a combination of instruction sets. The processing device 104 (or controller 101) may also be one or more special-purpose processing devices such as an application specific integrated circuit (‘ASIC’), a field programmable gate array (‘FPGA’), a digital signal processor (‘DSP’), network processor, or the like.
  • The processing device 104 may be connected to the RAM 111 via a data communications link 106, which may be embodied as a high speed memory bus such as a Double-Data Rate 4 (‘DDR4’) bus. Stored in RAM 111 is an operating system 112. In some implementations, instructions 113 are stored in RAM 111. Instructions 113 may include computer program instructions for performing operations in in a direct-mapped flash storage system. In one embodiment, a direct-mapped flash storage system is one that that addresses data blocks within flash drives directly and without an address translation performed by the storage controllers of the flash drives.
  • In implementations, storage array controller 101 includes one or more host bus adapters 103A-C that are coupled to the processing device 104 via a data communications link 105A-C. In implementations, host bus adapters 103A-C may be computer hardware that connects a host system (e.g., the storage array controller) to other network and storage arrays. In some examples, host bus adapters 103A-C may be a Fibre Channel adapter that enables the storage array controller 101 to connect to a SAN, an Ethernet adapter that enables the storage array controller 101 to connect to a LAN, or the like. Host bus adapters 103A-C may be coupled to the processing device 104 via a data communications link 105A-C such as, for example, a PCIe bus.
  • In implementations, storage array controller 101 may include a host bus adapter 114 that is coupled to an expander 115. The expander 115 may be used to attach a host system to a larger number of storage drives. The expander 115 may, for example, be a SAS expander utilized to enable the host bus adapter 114 to attach to storage drives in an implementation where the host bus adapter 114 is embodied as a SAS controller.
  • In implementations, storage array controller 101 may include a switch 116 coupled to the processing device 104 via a data communications link 109. The switch 116 may be a computer hardware device that can create multiple endpoints out of a single endpoint, thereby enabling multiple devices to share a single endpoint. The switch 116 may, for example, be a PCIe switch that is coupled to a PCIe bus (e.g., data communications link 109) and presents multiple PCIe connection points to the midplane.
  • In implementations, storage array controller 101 includes a data communications link 107 for coupling the storage array controller 101 to other storage array controllers. In some examples, data communications link 107 may be a QuickPath Interconnect (QPI) interconnect.
  • A traditional storage system that uses traditional flash drives may implement a process across the flash drives that are part of the traditional storage system. For example, a higher level process of the storage system may initiate and control a process across the flash drives. However, a flash drive of the traditional storage system may include its own storage controller that also performs the process. Thus, for the traditional storage system, a higher level process (e.g., initiated by the storage system) and a lower level process (e.g., initiated by a storage controller of the storage system) may both be performed.
  • To resolve various deficiencies of a traditional storage system, operations may be performed by higher level processes and not by the lower level processes. For example, the flash storage system may include flash drives that do not include storage controllers that provide the process. Thus, the operating system of the flash storage system itself may initiate and control the process. This may be accomplished by a direct-mapped flash storage system that addresses data blocks within the flash drives directly and without an address translation performed by the storage controllers of the flash drives.
  • The operating system of the flash storage system may identify and maintain a list of allocation units across multiple flash drives of the flash storage system. The allocation units may be entire erase blocks or multiple erase blocks. The operating system may maintain a map or address range that directly maps addresses to erase blocks of the flash drives of the flash storage system.
  • Direct mapping to the erase blocks of the flash drives may be used to rewrite data and erase data. For example, the operations may be performed on one or more allocation units that include a first data and a second data where the first data is to be retained and the second data is no longer being used by the flash storage system. The operating system may initiate the process to write the first data to new locations within other allocation units and erasing the second data and marking the allocation units as being available for use for subsequent data. Thus, the process may only be performed by the higher level operating system of the flash storage system without an additional lower level process being performed by controllers of the flash drives.
  • Advantages of the process being performed only by the operating system of the flash storage system include increased reliability of the flash drives of the flash storage system as unnecessary or redundant write operations are not being performed during the process. One possible point of novelty here is the concept of initiating and controlling the process at the operating system of the flash storage system. In addition, the process can be controlled by the operating system across multiple flash drives. This is contrast to the process being performed by a storage controller of a flash drive.
  • A storage system can consist of two storage array controllers that share a set of drives for failover purposes, or it could consist of a single storage array controller that provides a storage service that utilizes multiple drives, or it could consist of a distributed network of storage array controllers each with some number of drives or some amount of Flash storage where the storage array controllers in the network collaborate to provide a complete storage service and collaborate on various aspects of a storage service including storage allocation and garbage collection.
  • FIG. 1C illustrates a third example system 117 for data storage in accordance with some implementations. System 117 (also referred to as “storage system” herein) includes numerous elements for purposes of illustration rather than limitation. It may be noted that system 117 may include the same, more, or fewer elements configured in the same or different manner in other implementations.
  • In one embodiment, system 117 includes a dual Peripheral Component Interconnect (‘PCI’) flash storage device 118 with separately addressable fast write storage. System 117 may include a storage controller 119. In one embodiment, storage controller 119A-D may be a CPU, ASIC, FPGA, or any other circuitry that may implement control structures necessary according to the present disclosure. In one embodiment, system 117 includes flash memory devices (e.g., including flash memory devices 120 a-n), operatively coupled to various channels of the storage device controller 119. Flash memory devices 120 a-n, may be presented to the controller 119A-D as an addressable collection of Flash pages, erase blocks, and/or control elements sufficient to allow the storage device controller 119A-D to program and retrieve various aspects of the Flash. In one embodiment, storage device controller 119A-D may perform operations on flash memory devices 120 a-n including storing and retrieving data content of pages, arranging and erasing any blocks, tracking statistics related to the use and reuse of Flash memory pages, erase blocks, and cells, tracking and predicting error codes and faults within the Flash memory, controlling voltage levels associated with programming and retrieving contents of Flash cells, etc.
  • In one embodiment, system 117 may include RAM 121 to store separately addressable fast-write data. In one embodiment, RAM 121 may be one or more separate discrete devices. In another embodiment, RAM 121 may be integrated into storage device controller 119A-D or multiple storage device controllers. The RAM 121 may be utilized for other purposes as well, such as temporary program memory for a processing device (e.g., a CPU) in the storage device controller 119.
  • In one embodiment, system 117 may include a stored energy device 122, such as a rechargeable battery or a capacitor. Stored energy device 122 may store energy sufficient to power the storage device controller 119, some amount of the RAM (e.g., RAM 121), and some amount of Flash memory (e.g., Flash memory 120 a-120 n) for sufficient time to write the contents of RAM to Flash memory. In one embodiment, storage device controller 119A-D may write the contents of RAM to Flash Memory if the storage device controller detects loss of external power.
  • In one embodiment, system 117 includes two data communications links 123 a, 123 b. In one embodiment, data communications links 123 a, 123 b may be PCI interfaces. In another embodiment, data communications links 123 a, 123 b may be based on other communications standards (e.g., HyperTransport, InfiniBand, etc.). Data communications links 123 a, 123 b may be based on non-volatile memory express (‘NVMe’) or NVMe over fabrics (‘NVMf’) specifications that allow external connection to the storage device controller 119A-D from other components in the storage system 117. It should be noted that data communications links may be interchangeably referred to herein as PCI buses for convenience.
  • System 117 may also include an external power source (not shown), which may be provided over one or both data communications links 123 a, 123 b, or which may be provided separately. An alternative embodiment includes a separate Flash memory (not shown) dedicated for use in storing the content of RAM 121. The storage device controller 119A-D may present a logical device over a PCI bus which may include an addressable fast-write logical device, or a distinct part of the logical address space of the storage device 118, which may be presented as PCI memory or as persistent storage. In one embodiment, operations to store into the device are directed into the RAM 121. On power failure, the storage device controller 119A-D may write stored content associated with the addressable fast-write logical storage to Flash memory (e.g., Flash memory 120 a-n) for long-term persistent storage.
  • In one embodiment, the logical device may include some presentation of some or all of the content of the Flash memory devices 120 a-n, where that presentation allows a storage system including a storage device 118 (e.g., storage system 117) to directly address Flash memory pages and directly reprogram erase blocks from storage system components that are external to the storage device through the PCI bus. The presentation may also allow one or more of the external components to control and retrieve other aspects of the Flash memory including some or all of: tracking statistics related to use and reuse of Flash memory pages, erase blocks, and cells across all the Flash memory devices; tracking and predicting error codes and faults within and across the Flash memory devices; controlling voltage levels associated with programming and retrieving contents of Flash cells; etc.
  • In one embodiment, the stored energy device 122 may be sufficient to ensure completion of in-progress operations to the Flash memory devices 120 a-120 n stored energy device 122 may power storage device controller 119A-D and associated Flash memory devices (e.g., 120 a-n) for those operations, as well as for the storing of fast-write RAM to Flash memory. Stored energy device 122 may be used to store accumulated statistics and other parameters kept and tracked by the Flash memory devices 120 a-n and/or the storage device controller 119. Separate capacitors or stored energy devices (such as smaller capacitors near or embedded within the Flash memory devices themselves) may be used for some or all of the operations described herein.
  • Various schemes may be used to track and optimize the life span of the stored energy component, such as adjusting voltage levels over time, partially discharging the storage energy device 122 to measure corresponding discharge characteristics, etc. If the available energy decreases over time, the effective available capacity of the addressable fast-write storage may be decreased to ensure that it can be written safely based on the currently available stored energy.
  • FIG. 1D illustrates a third example system 124 for data storage in accordance with some implementations. In one embodiment, system 124 includes storage controllers 125 a, 125 b. In one embodiment, storage controllers 125 a, 125 b are operatively coupled to Dual PCI storage devices 119 a, 119 b and 119 c, 119 d, respectively. Storage controllers 125 a, 125 b may be operatively coupled (e.g., via a storage network 130) to some number of host computers 127 a-n.
  • In one embodiment, two storage controllers (e.g., 125 a and 125 b) provide storage services, such as a SCS) block storage array, a file server, an object server, a database or data analytics service, etc. The storage controllers 125 a, 125 b may provide services through some number of network interfaces (e.g., 126 a-d) to host computers 127 a-n outside of the storage system 124. Storage controllers 125 a, 125 b may provide integrated services or an application entirely within the storage system 124, forming a converged storage and compute system. The storage controllers 125 a, 125 b may utilize the fast write memory within or across storage devices 119 a-d to journal in progress operations to ensure the operations are not lost on a power failure, storage controller removal, storage controller or storage system shutdown, or some fault of one or more software or hardware components within the storage system 124.
  • In one embodiment, controllers 125 a, 125 b operate as PCI masters to one or the other PCI buses 128 a, 128 b. In another embodiment, 128 a and 128 b may be based on other communications standards (e.g., HyperTransport, InfiniBand, etc.). Other storage system embodiments may operate storage controllers 125 a, 125 b as multi-masters for both PCI buses 128 a, 128 b. Alternately, a PCI/NVMe/NVMf switching infrastructure or fabric may connect multiple storage controllers. Some storage system embodiments may allow storage devices to communicate with each other directly rather than communicating only with storage controllers. In one embodiment, a storage device controller 119 a may be operable under direction from a storage controller 125 a to synthesize and transfer data to be stored into Flash memory devices from data that has been stored in RAM (e.g., RAM 121 of FIG. 1C). For example, a recalculated version of RAM content may be transferred after a storage controller has determined that an operation has fully committed across the storage system, or when fast-write memory on the device has reached a certain used capacity, or after a certain amount of time, to ensure improve safety of the data or to release addressable fast-write capacity for reuse. This mechanism may be used, for example, to avoid a second transfer over a bus (e.g., 128 a, 128 b) from the storage controllers 125 a, 125 b. In one embodiment, a recalculation may include compressing data, attaching indexing or other metadata, combining multiple data segments together, performing erasure code calculations, etc.
  • In one embodiment, under direction from a storage controller 125 a, 125 b, a storage device controller 119 a, 119 b may be operable to calculate and transfer data to other storage devices from data stored in RAM (e.g., RAM 121 of FIG. 1C) without involvement of the storage controllers 125 a, 125 b. This operation may be used to mirror data stored in one controller 125 a to another controller 125 b, or it could be used to offload compression, data aggregation, and/or erasure coding calculations and transfers to storage devices to reduce load on storage controllers or the storage controller interface 129 a, 129 b to the PCI bus 128 a, 128 b.
  • A storage device controller 119A-D may include mechanisms for implementing high availability primitives for use by other parts of a storage system external to the Dual PCI storage device 118. For example, reservation or exclusion primitives may be provided so that, in a storage system with two storage controllers providing a highly available storage service, one storage controller may prevent the other storage controller from accessing or continuing to access the storage device. This could be used, for example, in cases where one controller detects that the other controller is not functioning properly or where the interconnect between the two storage controllers may itself not be functioning properly.
  • In one embodiment, a storage system for use with Dual PCI direct mapped storage devices with separately addressable fast write storage includes systems that manage erase blocks or groups of erase blocks as allocation units for storing data on behalf of the storage service, or for storing metadata (e.g., indexes, logs, etc.) associated with the storage service, or for proper management of the storage system itself. Flash pages, which may be a few kilobytes in size, may be written as data arrives or as the storage system is to persist data for long intervals of time (e.g., above a defined threshold of time). To commit data more quickly, or to reduce the number of writes to the Flash memory devices, the storage controllers may first write data into the separately addressable fast write storage on one more storage devices.
  • In one embodiment, the storage controllers 125 a, 125 b may initiate the use of erase blocks within and across storage devices (e.g., 118) in accordance with an age and expected remaining lifespan of the storage devices, or based on other statistics. The storage controllers 125 a, 125 b may initiate garbage collection and data migration data between storage devices in accordance with pages that are no longer needed as well as to manage Flash page and erase block lifespans and to manage overall system performance.
  • In one embodiment, the storage system 124 may utilize mirroring and/or erasure coding schemes as part of storing data into addressable fast write storage and/or as part of writing data into allocation units associated with erase blocks. Erasure codes may be used across storage devices, as well as within erase blocks or allocation units, or within and across Flash memory devices on a single storage device, to provide redundancy against single or multiple storage device failures or to protect against internal corruptions of Flash memory pages resulting from Flash memory operations or from degradation of Flash memory cells. Mirroring and erasure coding at various levels may be used to recover from multiple types of failures that occur separately or in combination.
  • The embodiments depicted with reference to FIGS. 2A-G illustrate 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, or across multiple 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.
  • The storage cluster may be 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 PCIe, 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. In some embodiments, multiple chassis may be coupled or connected to each other through an aggregator switch. A portion and/or all of the coupled or connected chassis may be designated as a storage cluster. As discussed above, each chassis can have multiple blades, each blade has a media access control (‘MAC’) address, but the storage cluster is presented to an external network as having a single cluster IP address and a single MAC address in some embodiments.
  • 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, 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 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. 2A is a perspective view of a storage cluster 161, 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 161, 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 161 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 161 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 herein, 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 159 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. 2A, storage cluster 161 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. 2B is a block diagram showing a communications interconnect 173 and power distribution bus 172 coupling multiple storage nodes 150. Referring back to FIG. 2A, the communications interconnect 173 can be included in or implemented with the switch fabric 146 in some embodiments. Where multiple storage clusters 161 occupy a rack, the communications interconnect 173 can be included in or implemented with a top of rack switch, in some embodiments. As illustrated in FIG. 2B, storage cluster 161 is enclosed within a single chassis 138. External port 176 is coupled to storage nodes 150 through communications interconnect 173, 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. 2A. In addition, one or more storage nodes 150 may be a compute only storage node as illustrated in FIG. 2B. 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. 2A and 2B, 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 FIGS. 2E and 2G) 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. Inodes 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, i.e., the system supports non-disruptive upgrades.
  • 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. 2C 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. 2C, 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. 2C, 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 161, 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 161. 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 161, 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. 2D shows a storage server environment, which uses embodiments of the storage nodes 150 and storage units 152 of FIGS. 2A-C. In this version, each storage unit 152 has a processor such as controller 212 (see FIG. 2C), an FPGA (field programmable gate array), flash memory 206, and NVRAM 204 (which is super-capacitor backed DRAM 216, see FIGS. 2B and 2C) on a PCIe (peripheral component interconnect express) board in a chassis 138 (see FIG. 2A). 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 168 independently. Each device provides an amount of storage space to each authority 168. That authority 168 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 168. This distribution of logical control is shown in FIG. 2D as a host controller 242, mid-tier controller 244 and storage unit controller(s) 246. 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 168 effectively serves as an independent controller. Each authority 168 provides its own data and metadata structures, its own background workers, and maintains its own lifecycle.
  • FIG. 2E is a blade 252 hardware block diagram, showing a control plane 254, compute and storage planes 256, 258, and authorities 168 interacting with underlying physical resources, using embodiments of the storage nodes 150 and storage units 152 of FIGS. 2A-C in the storage server environment of FIG. 2D. The control plane 254 is partitioned into a number of authorities 168 which can use the compute resources in the compute plane 256 to run on any of the blades 252. The storage plane 258 is partitioned into a set of devices, each of which provides access to flash 206 and NVRAM 204 resources. In one embodiment, the compute plane 256 may perform the operations of a storage array controller, as described herein, on one or more devices of the storage plane 258 (e.g., a storage array).
  • In the compute and storage planes 256, 258 of FIG. 2E, the authorities 168 interact with the underlying physical resources (i.e., devices). From the point of view of an authority 168, its resources are striped over all of the physical devices. From the point of view of a device, it provides resources to all authorities 168, irrespective of where the authorities happen to run. Each authority 168 has allocated or has been allocated one or more partitions 260 of storage memory in the storage units 152, e.g. partitions 260 in flash memory 206 and NVRAM 204. Each authority 168 uses those allocated partitions 260 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 168 could have a larger number of partitions 260 or larger sized partitions 260 in one or more storage units 152 than one or more other authorities 168.
  • FIG. 2F depicts elasticity software layers in blades 252 of a storage cluster, in accordance with some embodiments. In the elasticity structure, elasticity software is symmetric, i.e., each blade's compute module 270 runs the three identical layers of processes depicted in FIG. 2F. Storage managers 274 execute read and write requests from other blades 252 for data and metadata stored in local storage unit 152 NVRAM 204 and flash 206. Authorities 168 fulfill client requests by issuing the necessary reads and writes to the blades 252 on whose storage units 152 the corresponding data or metadata resides. Endpoints 272 parse client connection requests received from switch fabric 146 supervisory software, relay the client connection requests to the authorities 168 responsible for fulfillment, and relay the authorities' 168 responses to clients. The symmetric three-layer structure enables the storage system's high degree of concurrency. Elasticity scales out efficiently and reliably in these embodiments. In addition, elasticity implements a unique scale-out technique that balances work evenly across all resources regardless of client access pattern, and maximizes concurrency by eliminating much of the need for inter-blade coordination that typically occurs with conventional distributed locking.
  • Still referring to FIG. 2F, authorities 168 running in the compute modules 270 of a blade 252 perform the internal operations required to fulfill client requests. One feature of elasticity is that authorities 168 are stateless, i.e., they cache active data and metadata in their own blades' 252 DRAMs for fast access, but the authorities store every update in their NVRAM 204 partitions on three separate blades 252 until the update has been written to flash 206. All the storage system writes to NVRAM 204 are in triplicate to partitions on three separate blades 252 in some embodiments. With triple-mirrored NVRAM 204 and persistent storage protected by parity and Reed-Solomon RAID checksums, the storage system can survive concurrent failure of two blades 252 with no loss of data, metadata, or access to either.
  • Because authorities 168 are stateless, they can migrate between blades 252. Each authority 168 has a unique identifier. NVRAM 204 and flash 206 partitions are associated with authorities' 168 identifiers, not with the blades 252 on which they are running in some. Thus, when an authority 168 migrates, the authority 168 continues to manage the same storage partitions from its new location. When a new blade 252 is installed in an embodiment of the storage cluster, the system automatically rebalances load by: partitioning the new blade's 252 storage for use by the system's authorities 168, migrating selected authorities 168 to the new blade 252, starting endpoints 272 on the new blade 252 and including them in the switch fabric's 146 client connection distribution algorithm.
  • From their new locations, migrated authorities 168 persist the contents of their NVRAM 204 partitions on flash 206, process read and write requests from other authorities 168, and fulfill the client requests that endpoints 272 direct to them. Similarly, if a blade 252 fails or is removed, the system redistributes its authorities 168 among the system's remaining blades 252. The redistributed authorities 168 continue to perform their original functions from their new locations.
  • FIG. 2G depicts authorities 168 and storage resources in blades 252 of a storage cluster, in accordance with some embodiments. Each authority 168 is exclusively responsible for a partition of the flash 206 and NVRAM 204 on each blade 252. The authority 168 manages the content and integrity of its partitions independently of other authorities 168. Authorities 168 compress incoming data and preserve it temporarily in their NVRAM 204 partitions, and then consolidate, RAID-protect, and persist the data in segments of the storage in their flash 206 partitions. As the authorities 168 write data to flash 206, storage managers 274 perform the necessary flash translation to optimize write performance and maximize media longevity. In the background, authorities 168 “garbage collect,” or reclaim space occupied by data that clients have made obsolete by overwriting the data. It should be appreciated that since authorities' 168 partitions are disjoint, there is no need for distributed locking to execute client and writes or to perform background functions.
  • The embodiments described herein may utilize various software, communication and/or networking protocols. In addition, the configuration of the hardware and/or software may be adjusted to accommodate various protocols. For example, the embodiments may utilize Active Directory, which is a database based system that provides authentication, directory, policy, and other services in a WINDOWS™ environment. In these embodiments, LDAP (Lightweight Directory Access Protocol) is one example application protocol for querying and modifying items in directory service providers such as Active Directory. In some embodiments, a network lock manager (‘NLM’) is utilized as a facility that works in cooperation with the Network File System (‘NFS’) to provide a System V style of advisory file and record locking over a network. The Server Message Block (‘SMB’) protocol, one version of which is also known as Common Internet File System (‘CIFS’), may be integrated with the storage systems discussed herein. SMP operates as an application-layer network protocol typically used for providing shared access to files, printers, and serial ports and miscellaneous communications between nodes on a network. SMB also provides an authenticated inter-process communication mechanism. AMAZON™ S3 (Simple Storage Service) is a web service offered by Amazon Web Services, and the systems described herein may interface with Amazon S3 through web services interfaces (REST (representational state transfer), SOAP (simple object access protocol), and BitTorrent). A RESTful API (application programming interface) breaks down a transaction to create a series of small modules. Each module addresses a particular underlying part of the transaction. The control or permissions provided with these embodiments, especially for object data, may include utilization of an access control list (ACL). The ACL is a list of permissions attached to an object and the ACL specifies which users or system processes are granted access to objects, as well as what operations are allowed on given objects. The systems may utilize Internet Protocol version 6 (‘IPv6’), as well as IPv4, for the communications protocol that provides an identification and location system for computers on networks and routes traffic across the Internet. The routing of packets between networked systems may include Equal-cost multi-path routing (‘ECMP’), which is a routing strategy where next-hop packet forwarding to a single destination can occur over multiple “best paths” which tie for top place in routing metric calculations. Multi-path routing can be used in conjunction with most routing protocols, because it is a per-hop decision limited to a single router. The software may support Multi-tenancy, which is an architecture in which a single instance of a software application serves multiple customers. Each customer may be referred to as a tenant. Tenants may be given the ability to customize some parts of the application, but may not customize the application's code, in some embodiments. The embodiments may maintain audit logs. An audit log is a document that records an event in a computing system. In addition to documenting what resources were accessed, audit log entries typically include destination and source addresses, a timestamp, and user login information for compliance with various regulations. The embodiments may support various key management policies, such as encryption key rotation. In addition, the system may support dynamic root passwords or some variation dynamically changing passwords.
  • FIG. 3A sets forth a diagram of a storage system 306 that is coupled for data communications with a cloud services provider 302 in accordance with some embodiments of the present disclosure. Although depicted in less detail, the storage system 306 depicted in FIG. 3A may be similar to the storage systems described above with reference to FIGS. 1A-1D and FIGS. 2A-2G. In some embodiments, the storage system 306 depicted in FIG. 3A may be embodied as a storage system that includes imbalanced active/active controllers, as a storage system that includes balanced active/active controllers, as a storage system that includes active/active controllers where less than all of each controller's resources are utilized such that each controller has reserve resources that may be used to support failover, as a storage system that includes fully active/active controllers, as a storage system that includes dataset-segregated controllers, as a storage system that includes dual-layer architectures with front-end controllers and back-end integrated storage controllers, as a storage system that includes scale-out clusters of dual-controller arrays, as well as combinations of such embodiments.
  • In the example depicted in FIG. 3A, the storage system 306 is coupled to the cloud services provider 302 via a data communications link 304. The data communications link 304 may be embodied as a dedicated data communications link, as a data communications pathway that is provided through the use of one or data communications networks such as a wide area network (‘WAN’) or local area network (‘LAN’), or as some other mechanism capable of transporting digital information between the storage system 306 and the cloud services provider 302. Such a data communications link 304 may be fully wired, fully wireless, or some aggregation of wired and wireless data communications pathways. In such an example, digital information may be exchanged between the storage system 306 and the cloud services provider 302 via the data communications link 304 using one or more data communications protocols. For example, digital information may be exchanged between the storage system 306 and the cloud services provider 302 via the data communications link 304 using the handheld device transfer protocol (‘HDTP’), hypertext transfer protocol (‘HTTP’), internet protocol (‘IP’), real-time transfer protocol (‘RTP’), transmission control protocol (‘TCP’), user datagram protocol (‘UDP’), wireless application protocol (‘WAP’), or other protocol.
  • The cloud services provider 302 depicted in FIG. 3A may be embodied, for example, as a system and computing environment that provides services to users of the cloud services provider 302 through the sharing of computing resources via the data communications link 304. The cloud services provider 302 may provide on-demand access to a shared pool of configurable computing resources such as computer networks, servers, storage, applications and services, and so on. The shared pool of configurable resources may be rapidly provisioned and released to a user of the cloud services provider 302 with minimal management effort. Generally, the user of the cloud services provider 302 is unaware of the exact computing resources utilized by the cloud services provider 302 to provide the services. Although in many cases such a cloud services provider 302 may be accessible via the Internet, readers of skill in the art will recognize that any system that abstracts the use of shared resources to provide services to a user through any data communications link may be considered a cloud services provider 302.
  • In the example depicted in FIG. 3A, the cloud services provider 302 may be configured to provide a variety of services to the storage system 306 and users of the storage system 306 through the implementation of various service models. For example, the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of an infrastructure as a service (‘IaaS’) service model where the cloud services provider 302 offers computing infrastructure such as virtual machines and other resources as a service to subscribers. In addition, the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a platform as a service (‘PaaS’) service model where the cloud services provider 302 offers a development environment to application developers. Such a development environment may include, for example, an operating system, programming-language execution environment, database, web server, or other components that may be utilized by application developers to develop and run software solutions on a cloud platform. Furthermore, the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a software as a service (‘SaaS’) service model where the cloud services provider 302 offers application software, databases, as well as the platforms that are used to run the applications to the storage system 306 and users of the storage system 306, providing the storage system 306 and users of the storage system 306 with on-demand software and eliminating the need to install and run the application on local computers, which may simplify maintenance and support of the application. The cloud services provider 302 may be further configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of an authentication as a service (‘AaaS’) service model where the cloud services provider 302 offers authentication services that can be used to secure access to applications, data sources, or other resources. The cloud services provider 302 may also be configured to provide services to the storage system 306 and users of the storage system 306 through the implementation of a storage as a service model where the cloud services provider 302 offers access to its storage infrastructure for use by the storage system 306 and users of the storage system 306. Readers will appreciate that the cloud services provider 302 may be configured to provide additional services to the storage system 306 and users of the storage system 306 through the implementation of additional service models, as the service models described above are included only for explanatory purposes and in no way represent a limitation of the services that may be offered by the cloud services provider 302 or a limitation as to the service models that may be implemented by the cloud services provider 302.
  • In the example depicted in FIG. 3A, the cloud services provider 302 may be embodied, for example, as a private cloud, as a public cloud, or as a combination of a private cloud and public cloud. In an embodiment in which the cloud services provider 302 is embodied as a private cloud, the cloud services provider 302 may be dedicated to providing services to a single organization rather than providing services to multiple organizations. In an embodiment where the cloud services provider 302 is embodied as a public cloud, the cloud services provider 302 may provide services to multiple organizations. Public cloud and private cloud deployment models may differ and may come with various advantages and disadvantages. For example, because a public cloud deployment involves the sharing of a computing infrastructure across different organization, such a deployment may not be ideal for organizations with security concerns, mission-critical workloads, uptime requirements demands, and so on. While a private cloud deployment can address some of these issues, a private cloud deployment may require on-premises staff to manage the private cloud. In still alternative embodiments, the cloud services provider 302 may be embodied as a mix of a private and public cloud services with a hybrid cloud deployment.
  • Although not explicitly depicted in FIG. 3A, readers will appreciate that additional hardware components and additional software components may be necessary to facilitate the delivery of cloud services to the storage system 306 and users of the storage system 306. For example, the storage system 306 may be coupled to (or even include) a cloud storage gateway. Such a cloud storage gateway may be embodied, for example, as hardware-based or software-based appliance that is located on premise with the storage system 306. Such a cloud storage gateway may operate as a bridge between local applications that are executing on the storage array 306 and remote, cloud-based storage that is utilized by the storage array 306. Through the use of a cloud storage gateway, organizations may move primary iSCSI or NAS to the cloud services provider 302, thereby enabling the organization to save space on their on-premises storage systems. Such a cloud storage gateway may be configured to emulate a disk array, a block-based device, a file server, or other storage system that can translate the SCSI commands, file server commands, or other appropriate command into REST-space protocols that facilitate communications with the cloud services provider 302.
  • In order to enable the storage system 306 and users of the storage system 306 to make use of the services provided by the cloud services provider 302, a cloud migration process may take place during which data, applications, or other elements from an organization's local systems (or even from another cloud environment) are moved to the cloud services provider 302. In order to successfully migrate data, applications, or other elements to the cloud services provider's 302 environment, middleware such as a cloud migration tool may be utilized to bridge gaps between the cloud services provider's 302 environment and an organization's environment. Such cloud migration tools may also be configured to address potentially high network costs and long transfer times associated with migrating large volumes of data to the cloud services provider 302, as well as addressing security concerns associated with sensitive data to the cloud services provider 302 over data communications networks. In order to further enable the storage system 306 and users of the storage system 306 to make use of the services provided by the cloud services provider 302, a cloud orchestrator may also be used to arrange and coordinate automated tasks in pursuit of creating a consolidated process or workflow. Such a cloud orchestrator may perform tasks such as configuring various components, whether those components are cloud components or on-premises components, as well as managing the interconnections between such components. The cloud orchestrator can simplify the inter-component communication and connections to ensure that links are correctly configured and maintained.
  • In the example depicted in FIG. 3A, and as described briefly above, the cloud services provider 302 may be configured to provide services to the storage system 306 and users of the storage system 306 through the usage of a SaaS service model where the cloud services provider 302 offers application software, databases, as well as the platforms that are used to run the applications to the storage system 306 and users of the storage system 306, providing the storage system 306 and users of the storage system 306 with on-demand software and eliminating the need to install and run the application on local computers, which may simplify maintenance and support of the application. Such applications may take many forms in accordance with various embodiments of the present disclosure. For example, the cloud services provider 302 may be configured to provide access to data analytics applications to the storage system 306 and users of the storage system 306. Such data analytics applications may be configured, for example, to receive telemetry data phoned home by the storage system 306. Such telemetry data may describe various operating characteristics of the storage system 306 and may be analyzed, for example, to determine the health of the storage system 306, to identify workloads that are executing on the storage system 306, to predict when the storage system 306 will run out of various resources, to recommend configuration changes, hardware or software upgrades, workflow migrations, or other actions that may improve the operation of the storage system 306.
  • The cloud services provider 302 may also be configured to provide access to virtualized computing environments to the storage system 306 and users of the storage system 306. Such virtualized computing environments may be embodied, for example, as a virtual machine or other virtualized computer hardware platforms, virtual storage devices, virtualized computer network resources, and so on. Examples of such virtualized environments can include virtual machines that are created to emulate an actual computer, virtualized desktop environments that separate a logical desktop from a physical machine, virtualized file systems that allow uniform access to different types of concrete file systems, and many others.
  • For further explanation, FIG. 3B sets forth a diagram of a storage system 306 in accordance with some embodiments of the present disclosure. Although depicted in less detail, the storage system 306 depicted in FIG. 3B may be similar to the storage systems described above with reference to FIGS. 1A-1D and FIGS. 2A-2G as the storage system may include many of the components described above.
  • The storage system 306 depicted in FIG. 3B may include storage resources 308, which may be embodied in many forms. For example, in some embodiments the storage resources 308 can include nano-RAM or another form of nonvolatile random access memory that utilizes carbon nanotubes deposited on a substrate. In some embodiments, the storage resources 308 may include 3D crosspoint non-volatile memory in which bit storage is based on a change of bulk resistance, in conjunction with a stackable cross-gridded data access array. In some embodiments, the storage resources 308 may include flash memory, including single-level cell (‘SLC’) NAND flash, multi-level cell (‘MLC’) NAND flash, triple-level cell (‘TLC’) NAND flash, quad-level cell (‘QLC’) NAND flash, and others. In some embodiments, the storage resources 308 may include non-volatile magnetoresistive random-access memory (‘MRAM’), including spin transfer torque (‘STT’) MRAM, in which data is stored through the use of magnetic storage elements. In some embodiments, the example storage resources 308 may include non-volatile phase-change memory (‘PCM’) that may have the ability to hold multiple bits in a single cell as cells can achieve a number of distinct intermediary states. In some embodiments, the storage resources 308 may include quantum memory that allows for the storage and retrieval of photonic quantum information. In some embodiments, the example storage resources 308 may include resistive random-access memory (‘ReRAM’) in which data is stored by changing the resistance across a dielectric solid-state material. In some embodiments, the storage resources 308 may include storage class memory (‘SCM’) in which solid-state nonvolatile memory may be manufactured at a high density using some combination of sub-lithographic patterning techniques, multiple bits per cell, multiple layers of devices, and so on. Readers will appreciate that other forms of computer memories and storage devices may be utilized by the storage systems described above, including DRAM, SRAM, EEPROM, universal memory, and many others. The storage resources 308 depicted in FIG. 3A may be embodied in a variety of form factors, including but not limited to, dual in-line memory modules (‘DIMMs’), non-volatile dual in-line memory modules (‘NVDIMMs’), M.2, U.2, and others.
  • The storage resources 308 depicted in FIG. 3A may include various forms of storage-class memory (‘SCM’). SCM may effectively treat fast, non-volatile memory (e.g., NAND flash) as an extension of DRAM such that an entire dataset may be treated as an in-memory dataset that resides entirely in DRAM. SCM may include non-volatile media such as, for example, NAND flash. Such NAND flash may be accessed utilizing NVMe that can use the PCIe bus as its transport, providing for relatively low access latencies compared to older protocols. In fact, the network protocols used for SSDs in all-flash arrays can include NVMe using Ethernet (ROCE, NVME TCP), Fibre Channel (NVMe FC), InfiniBand (iWARP), and others that make it possible to treat fast, non-volatile memory as an extension of DRAM. In view of the fact that DRAM is often byte-addressable and fast, non-volatile memory such as NAND flash is block-addressable, a controller software/hardware stack may be needed to convert the block data to the bytes that are stored in the media. Examples of media and software that may be used as SCM can include, for example, 3D XPoint, Intel Memory Drive Technology, Samsung's Z-SSD, and others.
  • The example storage system 306 depicted in FIG. 3B may implement a variety of storage architectures. For example, storage systems in accordance with some embodiments of the present disclosure may utilize block storage where data is stored in blocks, and each block essentially acts as an individual hard drive. Storage systems in accordance with some embodiments of the present disclosure may utilize object storage, where data is managed as objects. Each object may include the data itself, a variable amount of metadata, and a globally unique identifier, where object storage can be implemented at multiple levels (e.g., device level, system level, interface level). Storage systems in accordance with some embodiments of the present disclosure utilize file storage in which data is stored in a hierarchical structure. Such data may be saved in files and folders, and presented to both the system storing it and the system retrieving it in the same format.
  • The example storage system 306 depicted in FIG. 3B may be embodied as a storage system in which additional storage resources can be added through the use of a scale-up model, additional storage resources can be added through the use of a scale-out model, or through some combination thereof. In a scale-up model, additional storage may be added by adding additional storage devices. In a scale-out model, however, additional storage nodes may be added to a cluster of storage nodes, where such storage nodes can include additional processing resources, additional networking resources, and so on.
  • The storage system 306 depicted in FIG. 3B also includes communications resources 310 that may be useful in facilitating data communications between components within the storage system 306, as well as data communications between the storage system 306 and computing devices that are outside of the storage system 306. The communications resources 310 may be configured to utilize a variety of different protocols and data communication fabrics to facilitate data communications between components within the storage systems as well as computing devices that are outside of the storage system. For example, the communications resources 310 can include fibre channel (‘FC’) technologies such as FC fabrics and FC protocols that can transport SCSI commands over FC networks. The communications resources 310 can also include FC over ethernet (‘FCoE’) technologies through which FC frames are encapsulated and transmitted over Ethernet networks. The communications resources 310 can also include InfiniBand (‘IB’) technologies in which a switched fabric topology is utilized to facilitate transmissions between channel adapters. The communications resources 310 can also include NVM Express (‘NVMe’) technologies and NVMe over fabrics (‘NVMeoF’) technologies through which non-volatile storage media attached via a PCI express (‘PCIe’) bus may be accessed. The communications resources 310 can also include mechanisms for accessing storage resources 308 within the storage system 306 utilizing serial attached SCSI (‘SAS’), serial ATA (‘SATA’) bus interfaces for connecting storage resources 308 within the storage system 306 to host bus adapters within the storage system 306, internet small computer systems interface (‘iSCSI’) technologies to provide block-level access to storage resources 308 within the storage system 306, and other communications resources that that may be useful in facilitating data communications between components within the storage system 306, as well as data communications between the storage system 306 and computing devices that are outside of the storage system 306.
  • The storage system 306 depicted in FIG. 3B also includes processing resources 312 that may be useful in useful in executing computer program instructions and performing other computational tasks within the storage system 306. The processing resources 312 may include one or more application-specific integrated circuits (‘ASICs’) that are customized for some particular purpose as well as one or more central processing units (‘CPUs’). The processing resources 312 may also include one or more digital signal processors (‘DSPs’), one or more field-programmable gate arrays (‘FPGAs’), one or more systems on a chip (‘SoCs’), or other form of processing resources 312. The storage system 306 may utilize the storage resources 312 to perform a variety of tasks including, but not limited to, supporting the execution of software resources 314 that will be described in greater detail below.
  • The storage system 306 depicted in FIG. 3B also includes software resources 314 that, when executed by processing resources 312 within the storage system 306, may perform various tasks. The software resources 314 may include, for example, one or more modules of computer program instructions that when executed by processing resources 312 within the storage system 306 are useful in carrying out various data protection techniques to preserve the integrity of data that is stored within the storage systems. Readers will appreciate that such data protection techniques may be carried out, for example, by system software executing on computer hardware within the storage system, by a cloud services provider, or in other ways. Such data protection techniques can include, for example, data archiving techniques that cause data that is no longer actively used to be moved to a separate storage device or separate storage system for long-term retention, data backup techniques through which data stored in the storage system may be copied and stored in a distinct location to avoid data loss in the event of equipment failure or some other form of catastrophe with the storage system, data replication techniques through which data stored in the storage system is replicated to another storage system such that the data may be accessible via multiple storage systems, data snapshotting techniques through which the state of data within the storage system is captured at various points in time, data and database cloning techniques through which duplicate copies of data and databases may be created, and other data protection techniques. Through the use of such data protection techniques, business continuity and disaster recovery objectives may be met as a failure of the storage system may not result in the loss of data stored in the storage system.
  • The software resources 314 may also include software that is useful in implementing software-defined storage (‘SDS’). In such an example, the software resources 314 may include one or more modules of computer program instructions that, when executed, are useful in policy-based provisioning and management of data storage that is independent of the underlying hardware. Such software resources 314 may be useful in implementing storage virtualization to separate the storage hardware from the software that manages the storage hardware.
  • The software resources 314 may also include software that is useful in facilitating and optimizing I/O operations that are directed to the storage resources 308 in the storage system 306. For example, the software resources 314 may include software modules that perform carry out various data reduction techniques such as, for example, data compression, data deduplication, and others. The software resources 314 may include software modules that intelligently group together I/O operations to facilitate better usage of the underlying storage resource 308, software modules that perform data migration operations to migrate from within a storage system, as well as software modules that perform other functions. Such software resources 314 may be embodied as one or more software containers or in many other ways.
  • Readers will appreciate that the presence of such software resources 314 may provide for an improved user experience of the storage system 306, an expansion of functionality supported by the storage system 306, and many other benefits. Consider the specific example of the software resources 314 carrying out data backup techniques through which data stored in the storage system may be copied and stored in a distinct location to avoid data loss in the event of equipment failure or some other form of catastrophe. In such an example, the systems described herein may more reliably (and with less burden placed on the user) perform backup operations relative to interactive backup management systems that require high degrees of user interactivity, offer less robust automation and feature sets, and so on.
  • For further explanation, FIG. 3C sets forth an example of a cloud-based storage system 318 in accordance with some embodiments of the present disclosure. In the example depicted in FIG. 3C, the cloud-based storage system 318 is created entirely in a cloud computing environment 316 such as, for example, Amazon Web Services (‘AWS’), Microsoft Azure, Google Cloud Platform, IBM Cloud, Oracle Cloud, and others. The cloud-based storage system 318 may be used to provide services similar to the services that may be provided by the storage systems described above. For example, the cloud-based storage system 318 may be used to provide block storage services to users of the cloud-based storage system 318, the cloud-based storage system 318 may be used to provide storage services to users of the cloud-based storage system 318 through the use of solid-state storage, and so on.
  • The cloud-based storage system 318 depicted in FIG. 3C includes two cloud computing instances 320, 322 that each are used to support the execution of a storage controller application 324, 326. The cloud computing instances 320, 322 may be embodied, for example, as instances of cloud computing resources (e.g., virtual machines) that may be provided by the cloud computing environment 316 to support the execution of software applications such as the storage controller application 324, 326. In one embodiment, the cloud computing instances 320, 322 may be embodied as Amazon Elastic Compute Cloud (‘EC2’) instances. In such an example, an Amazon Machine Image (‘AMI’) that includes the storage controller application 324, 326 may be booted to create and configure a virtual machine that may execute the storage controller application 324, 326.
  • In the example method depicted in FIG. 3C, the storage controller application 324, 326 may be embodied as a module of computer program instructions that, when executed, carries out various storage tasks. For example, the storage controller application 324, 326 may be embodied as a module of computer program instructions that, when executed, carries out the same tasks as the controllers 110A, 110B in FIG. 1A described above such as writing data received from the users of the cloud-based storage system 318 to the cloud-based storage system 318, erasing data from the cloud-based storage system 318, retrieving data from the cloud-based storage system 318 and providing such data to users of the cloud-based storage system 318, monitoring and reporting of disk utilization and performance, performing redundancy operations, such as RAID or RAID-like data redundancy operations, compressing data, encrypting data, deduplicating data, and so forth. Readers will appreciate that because there are two cloud computing instances 320, 322 that each include the storage controller application 324, 326, in some embodiments one cloud computing instance 320 may operate as the primary controller as described above while the other cloud computing instance 322 may operate as the secondary controller as described above. In such an example, in order to save costs, the cloud computing instance 320 that operates as the primary controller may be deployed on a relatively high-performance and relatively expensive cloud computing instance while the cloud computing instance 322 that operates as the secondary controller may be deployed on a relatively low-performance and relatively inexpensive cloud computing instance. Readers will appreciate that the storage controller application 324, 326 depicted in FIG. 3C may include identical source code that is executed within different cloud computing instances 320, 322.
  • Consider an example in which the cloud computing environment 316 is embodied as AWS and the cloud computing instances are embodied as EC2 instances. In such an example, AWS offers many types of EC2 instances. For example, AWS offers a suite of general purpose EC2 instances that include varying levels of memory and processing power. In such an example, the cloud computing instance 320 that operates as the primary controller may be deployed on one of the instance types that has a relatively large amount of memory and processing power while the cloud computing instance 322 that operates as the secondary controller may be deployed on one of the instance types that has a relatively small amount of memory and processing power. In such an example, upon the occurrence of a failover event where the roles of primary and secondary are switched, a double failover may actually be carried out such that: 1) a first failover event where the cloud computing instance 322 that formerly operated as the secondary controller begins to operate as the primary controller, and 2) a third cloud computing instance (not shown) that is of an instance type that has a relatively large amount of memory and processing power is spun up with a copy of the storage controller application, where the third cloud computing instance begins operating as the primary controller while the cloud computing instance 322 that originally operated as the secondary controller begins operating as the secondary controller again. In such an example, the cloud computing instance 320 that formerly operated as the primary controller may be terminated. Readers will appreciate that in alternative embodiments, the cloud computing instance 320 that is operating as the secondary controller after the failover event may continue to operate as the secondary controller and the cloud computing instance 322 that operated as the primary controller after the occurrence of the failover event may be terminated once the primary role has been assumed by the third cloud computing instance (not shown).
  • Readers will appreciate that while the embodiments described above relate to embodiments where one cloud computing instance 320 operates as the primary controller and the second cloud computing instance 322 operates as the secondary controller, other embodiments are within the scope of the present disclosure. For example, each cloud computing instance 320, 322 may operate as a primary controller for some portion of the address space supported by the cloud-based storage system 318, each cloud computing instance 320, 322 may operate as a primary controller where the servicing of I/O operations directed to the cloud-based storage system 318 are divided in some other way, and so on. In fact, in other embodiments where costs savings may be prioritized over performance demands, only a single cloud computing instance may exist that contains the storage controller application. In such an example, a controller failure may take more time to recover from as a new cloud computing instance that includes the storage controller application would need to be spun up rather than having an already created cloud computing instance take on the role of servicing I/O operations that would have otherwise been handled by the failed cloud computing instance.
  • The cloud-based storage system 318 depicted in FIG. 3C includes cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338. The cloud computing instances 340 a, 340 b, 340 n depicted in FIG. 3C may be embodied, for example, as instances of cloud computing resources that may be provided by the cloud computing environment 316 to support the execution of software applications. The cloud computing instances 340 a, 340 b, 340 n of FIG. 3C may differ from the cloud computing instances 320, 322 described above as the cloud computing instances 340 a, 340 b, 340 n of FIG. 3C have local storage 330, 334, 338 resources whereas the cloud computing instances 320, 322 that support the execution of the storage controller application 324, 326 need not have local storage resources. The cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 may be embodied, for example, as EC2 M5 instances that include one or more SSDs, as EC2 R5 instances that include one or more SSDs, as EC2 I3 instances that include one or more SSDs, and so on. In some embodiments, the local storage 330, 334, 338 must be embodied as solid-state storage (e.g., SSDs) rather than storage that makes use of hard disk drives.
  • In the example depicted in FIG. 3C, each of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 can include a software daemon 328, 332, 336 that, when executed by a cloud computing instance 340 a, 340 b, 340 n can present itself to the storage controller applications 324, 326 as if the cloud computing instance 340 a, 340 b, 340 n were a physical storage device (e.g., one or more SSDs). In such an example, the software daemon 328, 332, 336 may include computer program instructions similar to those that would normally be contained on a storage device such that the storage controller applications 324, 326 can send and receive the same commands that a storage controller would send to storage devices. In such a way, the storage controller applications 324, 326 may include code that is identical to (or substantially identical to) the code that would be executed by the controllers in the storage systems described above. In these and similar embodiments, communications between the storage controller applications 324, 326 and the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 may utilize iSCSI, NVMe over TCP, messaging, a custom protocol, or in some other mechanism.
  • In the example depicted in FIG. 3C, each of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 may also be coupled to block- storage 342, 344, 346 that is offered by the cloud computing environment 316. The block- storage 342, 344, 346 that is offered by the cloud computing environment 316 may be embodied, for example, as Amazon Elastic Block Store (‘EBS’) volumes. For example, a first EBS volume may be coupled to a first cloud computing instance 340 a, a second EBS volume may be coupled to a second cloud computing instance 340 b, and a third EBS volume may be coupled to a third cloud computing instance 340 n. In such an example, the block- storage 342, 344, 346 that is offered by the cloud computing environment 316 may be utilized in a manner that is similar to how the NVRAM devices described above are utilized, as the software daemon 328, 332, 336 (or some other module) that is executing within a particular cloud comping instance 340 a, 340 b, 340 n may, upon receiving a request to write data, initiate a write of the data to its attached EBS volume as well as a write of the data to its local storage 330, 334, 338 resources. In some alternative embodiments, data may only be written to the local storage 330, 334, 338 resources within a particular cloud comping instance 340 a, 340 b, 340 n. In an alternative embodiment, rather than using the block- storage 342, 344, 346 that is offered by the cloud computing environment 316 as NVRAM, actual RAM on each of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 may be used as NVRAM, thereby decreasing network utilization costs that would be associated with using an EBS volume as the NVRAM.
  • In the example depicted in FIG. 3C, the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 may be utilized, by cloud computing instances 320, 322 that support the execution of the storage controller application 324, 326 to service I/O operations that are directed to the cloud-based storage system 318. Consider an example in which a first cloud computing instance 320 that is executing the storage controller application 324 is operating as the primary controller. In such an example, the first cloud computing instance 320 that is executing the storage controller application 324 may receive (directly or indirectly via the secondary controller) requests to write data to the cloud-based storage system 318 from users of the cloud-based storage system 318. In such an example, the first cloud computing instance 320 that is executing the storage controller application 324 may perform various tasks such as, for example, deduplicating the data contained in the request, compressing the data contained in the request, determining where to the write the data contained in the request, and so on, before ultimately sending a request to write a deduplicated, encrypted, or otherwise possibly updated version of the data to one or more of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338. Either cloud computing instance 320, 322, in some embodiments, may receive a request to read data from the cloud-based storage system 318 and may ultimately send a request to read data to one or more of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338.
  • Readers will appreciate that when a request to write data is received by a particular cloud computing instance 340 a, 340 b, 340 n with local storage 330, 334, 338, the software daemon 328, 332, 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a, 340 b, 340 n may be configured to not only write the data to its own local storage 330, 334, 338 resources and any appropriate block- storage 342, 344, 346 that are offered by the cloud computing environment 316, but the software daemon 328, 332, 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a, 340 b, 340 n may also be configured to write the data to cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a, 340 b, 340 n. The cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a, 340 b, 340 n may be embodied, for example, as Amazon Simple Storage Service (‘S3’) storage that is accessible by the particular cloud computing instance 340 a, 340 b, 340 n. In other embodiments, the cloud computing instances 320, 322 that each include the storage controller application 324, 326 may initiate the storage of the data in the local storage 330, 334, 338 of the cloud computing instances 340 a, 340 b, 340 n and the cloud-based object storage 348.
  • Readers will appreciate that, as described above, the cloud-based storage system 318 may be used to provide block storage services to users of the cloud-based storage system 318. While the local storage 330, 334, 338 resources and the block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n may support block-level access, the cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a, 340 b, 340 n supports only object-based access. In order to address this, the software daemon 328, 332, 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a, 340 b, 340 n may be configured to take blocks of data, package those blocks into objects, and write the objects to the cloud-based object storage 348 that is attached to the particular cloud computing instance 340 a, 340 b, 340 n.
  • Consider an example in which data is written to the local storage 330, 334, 338 resources and the block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n in 1 MB blocks. In such an example, assume that a user of the cloud-based storage system 318 issues a request to write data that, after being compressed and deduplicated by the storage controller application 324, 326 results in the need to write 5 MB of data. In such an example, writing the data to the local storage 330, 334, 338 resources and the block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n is relatively straightforward as 5 blocks that are 1 MB in size are written to the local storage 330, 334, 338 resources and the block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n. In such an example, the software daemon 328, 332, 336 or some other module of computer program instructions that is executing on the particular cloud computing instance 340 a, 340 b, 340 n may be configured to: 1) create a first object that includes the first 1 MB of data and write the first object to the cloud-based object storage 348, 2) create a second object that includes the second 1 MB of data and write the second object to the cloud-based object storage 348, 3) create a third object that includes the third 1 MB of data and write the third object to the cloud-based object storage 348, and so on. As such, in some embodiments, each object that is written to the cloud-based object storage 348 may be identical (or nearly identical) in size. Readers will appreciate that in such an example, metadata that is associated with the data itself may be included in each object (e.g., the first 1 MB of the object is data and the remaining portion is metadata associated with the data).
  • Readers will appreciate that the cloud-based object storage 348 may be incorporated into the cloud-based storage system 318 to increase the durability of the cloud-based storage system 318. Continuing with the example described above where the cloud computing instances 340 a, 340 b, 340 n are EC2 instances, readers will understand that EC2 instances are only guaranteed to have a monthly uptime of 99.9% and data stored in the local instance store only persists during the lifetime of the EC2 instance. As such, relying on the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 as the only source of persistent data storage in the cloud-based storage system 318 may result in a relatively unreliable storage system. Likewise, EBS volumes are designed for 99.999% availability. As such, even relying on EBS as the persistent data store in the cloud-based storage system 318 may result in a storage system that is not sufficiently durable. Amazon S3, however, is designed to provide 99.999999999% durability, meaning that a cloud-based storage system 318 that can incorporate S3 into its pool of storage is substantially more durable than various other options.
  • Readers will appreciate that while a cloud-based storage system 318 that can incorporate S3 into its pool of storage is substantially more durable than various other options, utilizing S3 as the primary pool of storage may result in storage system that has relatively slow response times and relatively long I/O latencies. As such, the cloud-based storage system 318 depicted in FIG. 3C not only stores data in S3 but the cloud-based storage system 318 also stores data in local storage 330, 334, 338 resources and block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n, such that read operations can be serviced from local storage 330, 334, 338 resources and the block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n, thereby reducing read latency when users of the cloud-based storage system 318 attempt to read data from the cloud-based storage system 318.
  • In some embodiments, all data that is stored by the cloud-based storage system 318 may be stored in both: 1) the cloud-based object storage 348, and 2) at least one of the local storage 330, 334, 338 resources or block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n. In such embodiments, the local storage 330, 334, 338 resources and block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n may effectively operate as cache that generally includes all data that is also stored in S3, such that all reads of data may be serviced by the cloud computing instances 340 a, 340 b, 340 n without requiring the cloud computing instances 340 a, 340 b, 340 n to access the cloud-based object storage 348. Readers will appreciate that in other embodiments, however, all data that is stored by the cloud-based storage system 318 may be stored in the cloud-based object storage 348, but less than all data that is stored by the cloud-based storage system 318 may be stored in at least one of the local storage 330, 334, 338 resources or block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n. In such an example, various policies may be utilized to determine which subset of the data that is stored by the cloud-based storage system 318 should reside in both: 1) the cloud-based object storage 348, and 2) at least one of the local storage 330, 334, 338 resources or block- storage 342, 344, 346 resources that are utilized by the cloud computing instances 340 a, 340 b, 340 n.
  • As described above, when the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 are embodied as EC2 instances, the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 are only guaranteed to have a monthly uptime of 99.9% and data stored in the local instance store only persists during the lifetime of each cloud computing instance 340 a, 340 b, 340 n with local storage 330, 334, 338. As such, one or more modules of computer program instructions that are executing within the cloud-based storage system 318 (e.g., a monitoring module that is executing on its own EC2 instance) may be designed to handle the failure of one or more of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338. In such an example, the monitoring module may handle the failure of one or more of the cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 by creating one or more new cloud computing instances with local storage, retrieving data that was stored on the failed cloud computing instances 340 a, 340 b, 340 n from the cloud-based object storage 348, and storing the data retrieved from the cloud-based object storage 348 in local storage on the newly created cloud computing instances. Readers will appreciate that many variants of this process may be implemented.
  • Consider an example in which all cloud computing instances 340 a, 340 b, 340 n with local storage 330, 334, 338 failed. In such an example, the monitoring module may create new cloud computing instances with local storage, where high-bandwidth instances types are selected that allow for the maximum data transfer rates between the newly created high-bandwidth cloud computing instances with local storage and the cloud-based object storage 348. Readers will appreciate that instances types are selected that allow for the maximum data transfer rates between the new cloud computing instances and the cloud-based object storage 348 such that the new high-bandwidth cloud computing instances can be rehydrated with data from the cloud-based object storage 348 as quickly as possible. Once the new high-bandwidth cloud computing instances are rehydrated with data from the cloud-based object storage 348, less expensive lower-bandwidth cloud computing instances may be created, data may be migrated to the less expensive lower-bandwidth cloud computing instances, and the high-bandwidth cloud computing instances may be terminated.
  • Readers will appreciate that in some embodiments, the number of new cloud computing instances that are created may substantially exceed the number of cloud computing instances that are needed to locally store all of the data stored by the cloud-based storage system 318. The number of new cloud computing instances that are created may substantially exceed the number of cloud computing instances that are needed to locally store all of the data stored by the cloud-based storage system 318 in order to more rapidly pull data from the cloud-based object storage 348 and into the new cloud computing instances, as each new cloud computing instance can (in parallel) retrieve some portion of the data stored by the cloud-based storage system 318. In such embodiments, once the data stored by the cloud-based storage system 318 has been pulled into the newly created cloud computing instances, the data may be consolidated within a subset of the newly created cloud computing instances and those newly created cloud computing instances that are excessive may be terminated.
  • Consider an example in which 1000 cloud computing instances are needed in order to locally store all valid data that users of the cloud-based storage system 318 have written to the cloud-based storage system 318. In such an example, assume that all 1,000 cloud computing instances fail. In such an example, the monitoring module may cause 100,000 cloud computing instances to be created, where each cloud computing instance is responsible for retrieving, from the cloud-based object storage 348, distinct 1/100,000th chunks of the valid data that users of the cloud-based storage system 318 have written to the cloud-based storage system 318 and locally storing the distinct chunk of the dataset that it retrieved. In such an example, because each of the 100,000 cloud computing instances can retrieve data from the cloud-based object storage 348 in parallel, the caching layer may be restored 100 times faster as compared to an embodiment where the monitoring module only create 1000 replacement cloud computing instances. In such an example, over time the data that is stored locally in the 100,000 could be consolidated into 1,000 cloud computing instances and the remaining 99,000 cloud computing instances could be terminated.
  • Readers will appreciate that various performance aspects of the cloud-based storage system 318 may be monitored (e.g., by a monitoring module that is executing in an EC2 instance) such that the cloud-based storage system 318 can be scaled-up or scaled-out as needed. Consider an example in which the monitoring module monitors the performance of the could-based storage system 318 via communications with one or more of the cloud computing instances 320, 322 that each are used to support the execution of a storage controller application 324, 326, via monitoring communications between cloud computing instances 320, 322, 340 a, 340 b, 340 n, via monitoring communications between cloud computing instances 320, 322, 340 a, 340 b, 340 n and the cloud-based object storage 348, or in some other way. In such an example, assume that the monitoring module determines that the cloud computing instances 320, 322 that are used to support the execution of a storage controller application 324, 326 are undersized and not sufficiently servicing the I/O requests that are issued by users of the cloud-based storage system 318. In such an example, the monitoring module may create a new, more powerful cloud computing instance (e.g., a cloud computing instance of a type that includes more processing power, more memory, etc . . . ) that includes the storage controller application such that the new, more powerful cloud computing instance can begin operating as the primary controller. Likewise, if the monitoring module determines that the cloud computing instances 320, 322 that are used to support the execution of a storage controller application 324, 326 are oversized and that cost savings could be gained by switching to a smaller, less powerful cloud computing instance, the monitoring module may create a new, less powerful (and less expensive) cloud computing instance that includes the storage controller application such that the new, less powerful cloud computing instance can begin operating as the primary controller.
  • Consider, as an additional example of dynamically sizing the cloud-based storage system 318, an example in which the monitoring module determines that the utilization of the local storage that is collectively provided by the cloud computing instances 340 a, 340 b, 340 n has reached a predetermined utilization threshold (e.g., 95%). In such an example, the monitoring module may create additional cloud computing instances with local storage to expand the pool of local storage that is offered by the cloud computing instances. Alternatively, the monitoring module may create one or more new cloud computing instances that have larger amounts of local storage than the already existing cloud computing instances 340 a, 340 b, 340 n, such that data stored in an already existing cloud computing instance 340 a, 340 b, 340 n can be migrated to the one or more new cloud computing instances and the already existing cloud computing instance 340 a, 340 b, 340 n can be terminated, thereby expanding the pool of local storage that is offered by the cloud computing instances. Likewise, if the pool of local storage that is offered by the cloud computing instances is unnecessarily large, data can be consolidated and some cloud computing instances can be terminated.
  • Readers will appreciate that the cloud-based storage system 318 may be sized up and down automatically by a monitoring module applying a predetermined set of rules that may be relatively simple of relatively complicated. In fact, the monitoring module may not only take into account the current state of the cloud-based storage system 318, but the monitoring module may also apply predictive policies that are based on, for example, observed behavior (e.g., every night from 10 PM until 6 AM usage of the storage system is relatively light), predetermined fingerprints (e.g., every time a virtual desktop infrastructure adds 100 virtual desktops, the number of IOPS directed to the storage system increase by X), and so on. In such an example, the dynamic scaling of the cloud-based storage system 318 may be based on current performance metrics, predicted workloads, and many other factors, including combinations thereof
  • Readers will further appreciate that because the cloud-based storage system 318 may be dynamically scaled, the cloud-based storage system 318 may even operate in a way that is more dynamic. Consider the example of garbage collection. In a traditional storage system, the amount of storage is fixed. As such, at some point the storage system may be forced to perform garbage collection as the amount of available storage has become so constrained that the storage system is on the verge of running out of storage. In contrast, the cloud-based storage system 318 described here can always ‘add’ additional storage (e.g., by adding more cloud computing instances with local storage). Because the cloud-based storage system 318 described here can always ‘add’ additional storage, the cloud-based storage system 318 can make more intelligent decisions regarding when to perform garbage collection. For example, the cloud-based storage system 318 may implement a policy that garbage collection only be performed when the number of IOPS being serviced by the cloud-based storage system 318 falls below a certain level. In some embodiments, other system-level functions (e.g., deduplication, compression) may also be turned off and on in response to system load, given that the size of the cloud-based storage system 318 is not constrained in the same way that traditional storage systems are constrained.
  • Readers will appreciate that embodiments of the present disclosure resolve an issue with block-storage services offered by some cloud computing environments as some cloud computing environments only allow for one cloud computing instance to connect to a block-storage volume at a single time. For example, in Amazon AWS, only a single EC2 instance may be connected to an EBS volume. Through the use of EC2 instances with local storage, embodiments of the present disclosure can offer multi-connect capabilities where multiple EC2 instances can connect to another EC2 instance with local storage (‘a drive instance’). In such embodiments, the drive instances may include software executing within the drive instance that allows the drive instance to support I/O directed to a particular volume from each connected EC2 instance. As such, some embodiments of the present disclosure may be embodied as multi-connect block storage services that may not include all of the components depicted in FIG. 3C.
  • In some embodiments, especially in embodiments where the cloud-based object storage 348 resources are embodied as Amazon S3, the cloud-based storage system 318 may include one or more modules (e.g., a module of computer program instructions executing on an EC2 instance) that are configured to ensure that when the local storage of a particular cloud computing instance is rehydrated with data from S3, the appropriate data is actually in S3. This issue arises largely because S3 implements an eventual consistency model where, when overwriting an existing object, reads of the object will eventually (but not necessarily immediately) become consistent and will eventually (but not necessarily immediately) return the overwritten version of the object. To address this issue, in some embodiments of the present disclosure, objects in S3 are never overwritten. Instead, a traditional ‘overwrite’ would result in the creation of the new object (that includes the updated version of the data) and the eventual deletion of the old object (that includes the previous version of the data).
  • In some embodiments of the present disclosure, as part of an attempt to never (or almost never) overwrite an object, when data is written to S3 the resultant object may be tagged with a sequence number. In some embodiments, these sequence numbers may be persisted elsewhere (e.g., in a database) such that at any point in time, the sequence number associated with the most up-to-date version of some piece of data can be known. In such a way, a determination can be made as to whether S3 has the most recent version of some piece of data by merely reading the sequence number associated with an object—and without actually reading the data from S3. The ability to make this determination may be particularly important when a cloud computing instance with local storage crashes, as it would be undesirable to rehydrate the local storage of a replacement cloud computing instance with out-of-date data. In fact, because the cloud-based storage system 318 does not need to access the data to verify its validity, the data can stay encrypted and access charges can be avoided.
  • The storage systems described above may carry out intelligent data backup techniques through which data stored in the storage system may be copied and stored in a distinct location to avoid data loss in the event of equipment failure or some other form of catastrophe. For example, the storage systems described above may be configured to examine each backup to avoid restoring the storage system to an undesirable state. Consider an example in which malware infects the storage system. In such an example, the storage system may include software resources 314 that can scan each backup to identify backups that were captured before the malware infected the storage system and those backups that were captured after the malware infected the storage system. In such an example, the storage system may restore itself from a backup that does not include the malware—or at least not restore the portions of a backup that contained the malware. In such an example, the storage system may include software resources 314 that can scan each backup to identify the presences of malware (or a virus, or some other undesirable), for example, by identifying write operations that were serviced by the storage system and originated from a network subnet that is suspected to have delivered the malware, by identifying write operations that were serviced by the storage system and originated from a user that is suspected to have delivered the malware, by identifying write operations that were serviced by the storage system and examining the content of the write operation against fingerprints of the malware, and in many other ways.
  • Readers will further appreciate that the backups (often in the form of one or more snapshots) may also be utilized to perform rapid recovery of the storage system. Consider an example in which the storage system is infected with ransomware that locks users out of the storage system. In such an example, software resources 314 within the storage system may be configured to detect the presence of ransomware and may be further configured to restore the storage system to a point-in-time, using the retained backups, prior to the point-in-time at which the ransomware infected the storage system. In such an example, the presence of ransomware may be explicitly detected through the use of software tools utilized by the system, through the use of a key (e.g., a USB drive) that is inserted into the storage system, or in a similar way. Likewise, the presence of ransomware may be inferred in response to system activity meeting a predetermined fingerprint such as, for example, no reads or writes coming into the system for a predetermined period of time.
  • Readers will appreciate that the various components depicted in FIG. 3B may be grouped into one or more optimized computing packages as converged infrastructures. Such converged infrastructures may include pools of computers, storage and networking resources that can be shared by multiple applications and managed in a collective manner using policy-driven processes. Such converged infrastructures may minimize compatibility issues between various components within the storage system 306 while also reducing various costs associated with the establishment and operation of the storage system 306. Such converged infrastructures may be implemented with a converged infrastructure reference architecture, with standalone appliances, with a software driven hyper-converged approach (e.g., hyper-converged infrastructures), or in other ways.
  • Readers will appreciate that the storage system 306 depicted in FIG. 3B may be useful for supporting various types of software applications. For example, the storage system 306 may be useful in supporting artificial intelligence (‘AI’) applications, database applications, DevOps projects, electronic design automation tools, event-driven software applications, high performance computing applications, simulation applications, high-speed data capture and analysis applications, machine learning applications, media production applications, media serving applications, picture archiving and communication systems (‘PACS’) applications, software development applications, virtual reality applications, augmented reality applications, and many other types of applications by providing storage resources to such applications.
  • The storage systems described above may operate to support a wide variety of applications. In view of the fact that the storage systems include compute resources, storage resources, and a wide variety of other resources, the storage systems may be well suited to support applications that are resource intensive such as, for example, AI applications. Such AI applications may enable devices to perceive their environment and take actions that maximize their chance of success at some goal. Examples of such AI applications can include IBM Watson, Microsoft Oxford, Google DeepMind, Baidu Minwa, and others. The storage systems described above may also be well suited to support other types of applications that are resource intensive such as, for example, machine learning applications. Machine learning applications may perform various types of data analysis to automate analytical model building. Using algorithms that iteratively learn from data, machine learning applications can enable computers to learn without being explicitly programmed. One particular area of machine learning is referred to as reinforcement learning, which involves taking suitable actions to maximize reward in a particular situation. Reinforcement learning may be employed to find the best possible behavior or path that a particular software application or machine should take in a specific situation. Reinforcement learning differs from other areas of machine learning (e.g., supervised learning, unsupervised learning) in that correct input/output pairs need not be presented for reinforcement learning and sub-optimal actions need not be explicitly corrected.
  • In addition to the resources already described, the storage systems described above may also include graphics processing units (‘GPUs’), occasionally referred to as visual processing unit (‘VPUs’). Such GPUs may be embodied as specialized electronic circuits that rapidly manipulate and alter memory to accelerate the creation of images in a frame buffer intended for output to a display device. Such GPUs may be included within any of the computing devices that are part of the storage systems described above, including as one of many individually scalable components of a storage system, where other examples of individually scalable components of such storage system can include storage components, memory components, compute components (e.g., CPUs, FPGAs, ASICs), networking components, software components, and others. In addition to GPUs, the storage systems described above may also include neural network processors (‘NNPs’) for use in various aspects of neural network processing. Such NNPs may be used in place of (or in addition to) GPUs and may be also be independently scalable.
  • As described above, the storage systems described herein may be configured to support artificial intelligence applications, machine learning applications, big data analytics applications, and many other types of applications. The rapid growth in these sort of applications is being driven by three technologies: deep learning (DL), GPU processors, and Big Data. Deep learning is a computing model that makes use of massively parallel neural networks inspired by the human brain. Instead of experts handcrafting software, a deep learning model writes its own software by learning from lots of examples. A GPU is a modern processor with thousands of cores, well-suited to run algorithms that loosely represent the parallel nature of the human brain.
  • Advances in deep neural networks have ignited a new wave of algorithms and tools for data scientists to tap into their data with artificial intelligence (AI). With improved algorithms, larger data sets, and various frameworks (including open-source software libraries for machine learning across a range of tasks), data scientists are tackling new use cases like autonomous driving vehicles, natural language processing and understanding, computer vision, machine reasoning, strong AI, and many others. Applications of such techniques may include: machine and vehicular object detection, identification and avoidance; visual recognition, classification and tagging; algorithmic financial trading strategy performance management; simultaneous localization and mapping; predictive maintenance of high-value machinery; prevention against cyber security threats, expertise automation; image recognition and classification; question answering; robotics; text analytics (extraction, classification) and text generation and translation; and many others. Applications of AI techniques has materialized in a wide array of products include, for example, Amazon Echo's speech recognition technology that allows users to talk to their machines, Google Translate™ which allows for machine-based language translation, Spotify's Discover Weekly that provides recommendations on new songs and artists that a user may like based on the user's usage and traffic analysis, Quill's text generation offering that takes structured data and turns it into narrative stories, Chatbots that provide real-time, contextually specific answers to questions in a dialog format, and many others. Furthermore, AI may impact a wide variety of industries and sectors. For example, AI solutions may be used in healthcare to take clinical notes, patient files, research data, and other inputs to generate potential treatment options for doctors to explore. Likewise, AI solutions may be used by retailers to personalize consumer recommendations based on a person's digital footprint of behaviors, profile data, or other data.
  • Training deep neural networks, however, requires both high quality input data and large amounts of computation. GPUs are massively parallel processors capable of operating on large amounts of data simultaneously. When combined into a multi-GPU cluster, a high throughput pipeline may be required to feed input data from storage to the compute engines. Deep learning is more than just constructing and training models. There also exists an entire data pipeline that must be designed for the scale, iteration, and experimentation necessary for a data science team to succeed.
  • Data is the heart of modern AI and deep learning algorithms. Before training can begin, one problem that must be addressed revolves around collecting the labeled data that is crucial for training an accurate AI model. A full scale AI deployment may be required to continuously collect, clean, transform, label, and store large amounts of data. Adding additional high quality data points directly translates to more accurate models and better insights. Data samples may undergo a series of processing steps including, but not limited to: 1) ingesting the data from an external source into the training system and storing the data in raw form, 2) cleaning and transforming the data in a format convenient for training, including linking data samples to the appropriate label, 3) exploring parameters and models, quickly testing with a smaller dataset, and iterating to converge on the most promising models to push into the production cluster, 4) executing training phases to select random batches of input data, including both new and older samples, and feeding those into production GPU servers for computation to update model parameters, and 5) evaluating including using a holdback portion of the data not used in training in order to evaluate model accuracy on the holdout data. This lifecycle may apply for any type of parallelized machine learning, not just neural networks or deep learning. For example, standard machine learning frameworks may rely on CPUs instead of GPUs but the data ingest and training workflows may be the same. Readers will appreciate that a single shared storage data hub creates a coordination point throughout the lifecycle without the need for extra data copies among the ingest, preprocessing, and training stages. Rarely is the ingested data used for only one purpose, and shared storage gives the flexibility to train multiple different models or apply traditional analytics to the data.
  • Readers will appreciate that each stage in the AI data pipeline may have varying requirements from the data hub (e.g., the storage system or collection of storage systems). Scale-out storage systems must deliver uncompromising performance for all manner of access types and patterns—from small, metadata-heavy to large files, from random to sequential access patterns, and from low to high concurrency. The storage systems described above may serve as an ideal AI data hub as the systems may service unstructured workloads. In the first stage, data is ideally ingested and stored on to the same data hub that following stages will use, in order to avoid excess data copying. The next two steps can be done on a standard compute server that optionally includes a GPU, and then in the fourth and last stage, full training production jobs are run on powerful GPU-accelerated servers. Often, there is a production pipeline alongside an experimental pipeline operating on the same dataset. Further, the GPU-accelerated servers can be used independently for different models or joined together to train on one larger model, even spanning multiple systems for distributed training. If the shared storage tier is slow, then data must be copied to local storage for each phase, resulting in wasted time staging data onto different servers. The ideal data hub for the AI training pipeline delivers performance similar to data stored locally on the server node while also having the simplicity and performance to enable all pipeline stages to operate concurrently.
  • A data scientist works to improve the usefulness of the trained model through a wide variety of approaches: more data, better data, smarter training, and deeper models. In many cases, there will be teams of data scientists sharing the same datasets and working in parallel to produce new and improved training models. Often, there is a team of data scientists working within these phases concurrently on the same shared datasets. Multiple, concurrent workloads of data processing, experimentation, and full-scale training layer the demands of multiple access patterns on the storage tier. In other words, storage cannot just satisfy large file reads, but must contend with a mix of large and small file reads and writes. Finally, with multiple data scientists exploring datasets and models, it may be critical to store data in its native format to provide flexibility for each user to transform, clean, and use the data in a unique way. The storage systems described above may provide a natural shared storage home for the dataset, with data protection redundancy (e.g., by using RAID6) and the performance necessary to be a common access point for multiple developers and multiple experiments. Using the storage systems described above may avoid the need to carefully copy subsets of the data for local work, saving both engineering and GPU-accelerated servers use time. These copies become a constant and growing tax as the raw data set and desired transformations constantly update and change.
  • Readers will appreciate that a fundamental reason why deep learning has seen a surge in success is the continued improvement of models with larger data set sizes. In contrast, classical machine learning algorithms, like logistic regression, stop improving in accuracy at smaller data set sizes. As such, the separation of compute resources and storage resources may also allow independent scaling of each tier, avoiding many of the complexities inherent in managing both together. As the data set size grows or new data sets are considered, a scale out storage system must be able to expand easily. Similarly, if more concurrent training is required, additional GPUs or other compute resources can be added without concern for their internal storage. Furthermore, the storage systems described above may make building, operating, and growing an AI system easier due to the random read bandwidth provided by the storage systems, the ability to of the storage systems to randomly read small files (50 KB) high rates (meaning that no extra effort is required to aggregate individual data points to make larger, storage-friendly files), the ability of the storage systems to scale capacity and performance as either the dataset grows or the throughput requirements grow, the ability of the storage systems to support files or objects, the ability of the storage systems to tune performance for large or small files (i.e., no need for the user to provision filesystems), the ability of the storage systems to support non-disruptive upgrades of hardware and software even during production model training, and for many other reasons.
  • Small file performance of the storage tier may be critical as many types of inputs, including text, audio, or images will be natively stored as small files. If the storage tier does not handle small files well, an extra step will be required to pre-process and group samples into larger files. Storage, built on top of spinning disks, that relies on SSD as a caching tier, may fall short of the performance needed. Because training with random input batches results in more accurate models, the entire data set must be accessible with full performance. SSD caches only provide high performance for a small subset of the data and will be ineffective at hiding the latency of spinning drives.
  • Although the preceding paragraphs discuss deep learning applications, readers will appreciate that the storage systems described herein may also be part of a distributed deep learning (‘DDL’) platform to support the execution of DDL algorithms. Distributed deep learning may can be used to significantly accelerate deep learning with distributed computing on GPUs (or other form of accelerator or computer program instruction executor), such that parallelism can be achieved. In addition, the output of training machine learning and deep learning models, such as a fully trained machine learning model, may be used for a variety of purposes and in conjunction with other tools. For example, trained machine learning models may be used in conjunction with tools like Core ML to integrate a broad variety of machine learning model types into an application. In fact, trained models may be run through Core ML converter tools and inserted into a custom application that can be deployed on compatible devices. The storage systems described above may also be paired with other technologies such as TensorFlow, an open-source software library for dataflow programming across a range of tasks that may be used for machine learning applications such as neural networks, to facilitate the development of such machine learning models, applications, and so on.
  • Readers will further appreciate that the systems described above may be deployed in a variety of ways to support the democratization of AI, as AI becomes more available for mass consumption. The democratization of AI may include, for example, the ability to offer AI as a Platform-as-a-Service, the growth of Artificial general intelligence offerings, the proliferation of Autonomous level 4 and Autonomous level 5 vehicles, the availability of autonomous mobile robots, the development of conversational AI platforms, and many others. For example, the systems described above may be deployed in cloud environments, edge environments, or other environments that are useful in supporting the democratization of AI. As part of the democratization of AI, a movement may occur from narrow AI that consists of highly scoped machine learning solutions that target a particular task to artificial general intelligence where the use of machine learning is expanded to handle a broad range of use cases that could essentially perform any intelligent task that a human could perform and could learn dynamically, much like a human.
  • The storage systems described above may also be used in a neuromorphic computing environment. Neuromorphic computing is a form of computing that mimics brain cells. To support neuromorphic computing, an architecture of interconnected “neurons” replace traditional computing models with low-powered signals that go directly between neurons for more efficient computation. Neuromorphic computing may make use of very-large-scale integration (VLSI) systems containing electronic analog circuits to mimic neuro-biological architectures present in the nervous system, as well as analog, digital, mixed-mode analog/digital VLSI, and software systems that implement models of neural systems for perception, motor control, or multisensory integration.
  • Readers will appreciate that the storage systems described above may be configured to support the storage or use of (among other types of data) blockchains. Such blockchains may be embodied as a continuously growing list of records, called blocks, which are linked and secured using cryptography. Each block in a blockchain may contain a hash pointer as a link to a previous block, a timestamp, transaction data, and so on. Blockchains may be designed to be resistant to modification of the data and can serve as an open, distributed ledger that can record transactions between two parties efficiently and in a verifiable and permanent way. This makes blockchains potentially suitable for the recording of events, medical records, and other records management activities, such as identity management, transaction processing, and others. In addition to supporting the storage and use of blockchain technologies, the storage systems described above may also support the storage and use of derivative items such as, for example, open source blockchains and related tools that are part of the IBM™ Hyperledger project, permissioned blockchains in which a certain number of trusted parties are allowed to access the block chain, blockchain products that enable developers to build their own distributed ledger projects, and others. Readers will appreciate that blockchain technologies may impact a wide variety of industries and sectors. For example, blockchain technologies may be used in real estate transactions as blockchain based contracts whose use can eliminate the need for 3rd parties and enable self-executing actions when conditions are met. Likewise, universal health records can be created by aggregating and placing a person's health history onto a blockchain ledger for any healthcare provider, or permissioned health care providers, to access and update.
  • Readers will appreciate that the usage of blockchains is not limited to financial transactions, contracts, and the like. In fact, blockchains may be leveraged to enable the decentralized aggregation, ordering, timestamping and archiving of any type of information, including structured data, correspondence, documentation, or other data. Through the usage of blockchains, participants can provably and permanently agree on exactly what data was entered, when and by whom, without relying on a trusted intermediary. For example, SAP's recently launched blockchain platform, which supports MultiChain and Hyperledger Fabric, targets a broad range of supply chain and other non-financial applications.
  • One way to use a blockchain for recording data is to embed each piece of data directly inside a transaction. Every blockchain transaction may be digitally signed by one or more parties, replicated to a plurality of nodes, ordered and timestamped by the chain's consensus algorithm, and stored permanently in a tamper-proof way. Any data within the transaction will therefore be stored identically but independently by every node, along with a proof of who wrote it and when. The chain's users are able to retrieve this information at any future time. This type of storage may be referred to as on-chain storage. On-chain storage may not be particularly practical, however, when attempting to store a very large dataset. As such, in accordance with embodiments of the present disclosure, blockchains and the storage systems described herein may be leveraged to support on-chain storage of data as well as off-chain storage of data.
  • Off-chain storage of data can be implemented in a variety of ways and can occur when the data itself is not stored within the blockchain. For example, in one embodiment, a hash function may be utilized and the data itself may be fed into the hash function to generate a hash value. In such an example, the hashes of large pieces of data may be embedded within transactions, instead of the data itself. Each hash may serve as a commitment to its input data, with the data itself being stored outside of the blockchain. Readers will appreciate that any blockchain participant that needs an off-chain piece of data cannot reproduce the data from its hash, but if the data can be retrieved in some other way, then the on-chain hash serves to confirm who created it and when. Just like regular on-chain data, the hash may be embedded inside a digitally signed transaction, which was included in the chain by consensus.
  • Readers will appreciate that, in other embodiments, alternatives to blockchains may be used to facilitate the decentralized storage of information. For example, one alternative to a blockchain that may be used is a blockweave. While conventional blockchains store every transaction to achieve validation, a blockweave permits secure decentralization without the usage of the entire chain, thereby enabling low cost on-chain storage of data. Such blockweaves may utilize a consensus mechanism that is based on proof of access (PoA) and proof of work (PoW). While typical PoW systems only depend on the previous block in order to generate each successive block, the PoA algorithm may incorporate data from a randomly chosen previous block. Combined with the blockweave data structure, miners do not need to store all blocks (forming a blockchain), but rather can store any previous blocks forming a weave of blocks (a blockweave). This enables increased levels of scalability, speed and low-cost and reduces the cost of data storage in part because miners need not store all blocks, thereby resulting in a substantial reduction in the amount of electricity that is consumed during the mining process because, as the network expands, electricity consumption decreases because a blockweave demands less and less hashing power for consensus as data is added to the system. Furthermore, blockweaves may be deployed on a decentralized storage network in which incentives are created to encourage rapid data sharing. Such decentralized storage networks may also make use of blockshadowing techniques, where nodes only send a minimal block “shadow” to other nodes that allows peers to reconstruct a full block, instead of transmitting the full block itself.
  • The storage systems described above may, either alone or in combination with other computing devices, be used to support in-memory computing applications. In memory computing involves the storage of information in RAM that is distributed across a cluster of computers. In-memory computing helps business customers, including retailers, banks and utilities, to quickly detect patterns, analyze massive data volumes on the fly, and perform their operations quickly. Readers will appreciate that the storage systems described above, especially those that are configurable with customizable amounts of processing resources, storage resources, and memory resources (e.g., those systems in which blades that contain configurable amounts of each type of resource), may be configured in a way so as to provide an infrastructure that can support in-memory computing. Likewise, the storage systems described above may include component parts (e.g., NVDIMMs, 3D crosspoint storage that provide fast random access memory that is persistent) that can actually provide for an improved in-memory computing environment as compared to in-memory computing environments that rely on RAM distributed across dedicated servers.
  • In some embodiments, the storage systems described above may be configured to operate as a hybrid in-memory computing environment that includes a universal interface to all storage media (e.g., RAM, flash storage, 3D crosspoint storage). In such embodiments, users may have no knowledge regarding the details of where their data is stored but they can still use the same full, unified API to address data. In such embodiments, the storage system may (in the background) move data to the fastest layer available—including intelligently placing the data in dependence upon various characteristics of the data or in dependence upon some other heuristic. In such an example, the storage systems may even make use of existing products such as Apache Ignite and GridGain to move data between the various storage layers, or the storage systems may make use of custom software to move data between the various storage layers. The storage systems described herein may implement various optimizations to improve the performance of in-memory computing such as, for example, having computations occur as close to the data as possible.
  • Readers will further appreciate that in some embodiments, the storage systems described above may be paired with other resources to support the applications described above. For example, one infrastructure could include primary compute in the form of servers and workstations which specialize in using General-purpose computing on graphics processing units (‘GPGPU’) to accelerate deep learning applications that are interconnected into a computation engine to train parameters for deep neural networks. Each system may have Ethernet external connectivity, InfiniBand external connectivity, some other form of external connectivity, or some combination thereof. In such an example, the GPUs can be grouped for a single large training or used independently to train multiple models. The infrastructure could also include a storage system such as those described above to provide, for example, a scale-out all-flash file or object store through which data can be accessed via high-performance protocols such as NFS, S3, and so on. The infrastructure can also include, for example, redundant top-of-rack Ethernet switches connected to storage and compute via ports in MLAG port channels for redundancy. The infrastructure could also include additional compute in the form of whitebox servers, optionally with GPUs, for data ingestion, pre-processing, and model debugging. Readers will appreciate that additional infrastructures are also be possible.
  • Readers will appreciate that the systems described above may be better suited for the applications described above relative to other systems that may include, for example, a distributed direct-attached storage (DDAS) solution deployed in server nodes. Such DDAS solutions may be built for handling large, less sequential accesses but may be less able to handle small, random accesses. Readers will further appreciate that the storage systems described above may be utilized to provide a platform for the applications described above that is preferable to the utilization of cloud-based resources as the storage systems may be included in an on-site or in-house infrastructure that is more secure, more locally and internally managed, more robust in feature sets and performance, or otherwise preferable to the utilization of cloud-based resources as part of a platform to support the applications described above. For example, services built on platforms such as IBM's Watson may require a business enterprise to distribute individual user information, such as financial transaction information or identifiable patient records, to other institutions. As such, cloud-based offerings of AI as a service may be less desirable than internally managed and offered AI as a service that is supported by storage systems such as the storage systems described above, for a wide array of technical reasons as well as for various business reasons.
  • Readers will appreciate that the storage systems described above, either alone or in coordination with other computing machinery may be configured to support other AI related tools. For example, the storage systems may make use of tools like ONXX or other open neural network exchange formats that make it easier to transfer models written in different AI frameworks. Likewise, the storage systems may be configured to support tools like Amazon's Gluon that allow developers to prototype, build, and train deep learning models. In fact, the storage systems described above may be part of a larger platform, such as IBM™ Cloud Private for Data, that includes integrated data science, data engineering and application building services. Such platforms may seamlessly collect, organize, secure, and analyze data across an enterprise, as well as simplify hybrid data management, unified data governance and integration, data science and business analytics with a single solution.
  • Readers will further appreciate that the storage systems described above may also be deployed as an edge solution. Such an edge solution may be in place to optimize cloud computing systems by performing data processing at the edge of the network, near the source of the data. Edge computing can push applications, data and computing power (i.e., services) away from centralized points to the logical extremes of a network. Through the use of edge solutions such as the storage systems described above, computational tasks may be performed using the compute resources provided by such storage systems, data may be storage using the storage resources of the storage system, and cloud-based services may be accessed through the use of various resources of the storage system (including networking resources). By performing computational tasks on the edge solution, storing data on the edge solution, and generally making use of the edge solution, the consumption of expensive cloud-based resources may be avoided and, in fact, performance improvements may be experienced relative to a heavier reliance on cloud-based resources.
  • While many tasks may benefit from the utilization of an edge solution, some particular uses may be especially suited for deployment in such an environment. For example, devices like drones, autonomous cars, robots, and others may require extremely rapid processing—so fast, in fact, that sending data up to a cloud environment and back to receive data processing support may simply be too slow. Likewise, machines like locomotives and gas turbines that generate large amounts of information through the use of a wide array of data-generating sensors may benefit from the rapid data processing capabilities of an edge solution. As an additional example, some IoT devices such as connected video cameras may not be well-suited for the utilization of cloud-based resources as it may be impractical (not only from a privacy perspective, security perspective, or a financial perspective) to send the data to the cloud simply because of the pure volume of data that is involved. As such, many tasks that really on data processing, storage, or communications may be better suited by platforms that include edge solutions such as the storage systems described above.
  • Consider a specific example of inventory management in a warehouse, distribution center, or similar location. A large inventory, warehousing, shipping, order-fulfillment, manufacturing or other operation has a large amount of inventory on inventory shelves, and high resolution digital cameras that produce a firehose of large data. All of this data may be taken into an image processing system, which may reduce the amount of data to a firehose of small data. All of the small data may be stored on-premises in storage. The on-premises storage, at the edge of the facility, may be coupled to the cloud, for external reports, real-time control and cloud storage. Inventory management may be performed with the results of the image processing, so that inventory can be tracked on the shelves and restocked, moved, shipped, modified with new products, or discontinued/obsolescent products deleted, etc. The above scenario is a prime candidate for an embodiment of the configurable processing and storage systems described above. A combination of compute-only blades and offload blades suited for the image processing, perhaps with deep learning on offload-FPGA or offload-custom blade(s) could take in the firehose of large data from all of the digital cameras, and produce the firehose of small data. All of the small data could then be stored by storage nodes, operating with storage units in whichever combination of types of storage blades best handles the data flow. This is an example of storage and function acceleration and integration. Depending on external communication needs with the cloud, and external processing in the cloud, and depending on reliability of network connections and cloud resources, the system could be sized for storage and compute management with bursty workloads and variable conductivity reliability. Also, depending on other inventory management aspects, the system could be configured for scheduling and resource management in a hybrid edge/cloud environment.
  • The storage systems described above may alone, or in combination with other computing resources, serves as a network edge platform that combines compute resources, storage resources, networking resources, cloud technologies and network virtualization technologies, and so on. As part of the network, the edge may take on characteristics similar to other network facilities, from the customer premise and backhaul aggregation facilities to Points of Presence (PoPs) and regional data centers. Readers will appreciate that network workloads, such as Virtual Network Functions (VNFs) and others, will reside on the network edge platform. Enabled by a combination of containers and virtual machines, the network edge platform may rely on controllers and schedulers that are no longer geographically co-located with the data processing resources. The functions, as microservices, may split into control planes, user and data planes, or even state machines, allowing for independent optimization and scaling techniques to be applied. Such user and data planes may be enabled through increased accelerators, both those residing in server platforms, such as FPGAs and Smart NICs, and through SDN-enabled merchant silicon and programmable ASICs.
  • The storage systems described above may also be optimized for use in big data analytics. Big data analytics may be generally described as the process of examining large and varied data sets to uncover hidden patterns, unknown correlations, market trends, customer preferences and other useful information that can help organizations make more-informed business decisions. Big data analytics applications enable data scientists, predictive modelers, statisticians and other analytics professionals to analyze growing volumes of structured transaction data, plus other forms of data that are often left untapped by conventional business intelligence (BI) and analytics programs. As part of that process, semi-structured and unstructured data such as, for example, internet clickstream data, web server logs, social media content, text from customer emails and survey responses, mobile-phone call-detail records, IoT sensor data, and other data may be converted to a structured form. Big data analytics is a form of advanced analytics, which involves complex applications with elements such as predictive models, statistical algorithms and what-if analyses powered by high-performance analytics systems.
  • The storage systems described above may also support (including implementing as a system interface) applications that perform tasks in response to human speech. For example, the storage systems may support the execution intelligent personal assistant applications such as, for example, Amazon's Alexa, Apple Siri, Google Voice, Samsung Bixby, Microsoft Cortana, and others. While the examples described in the previous sentence make use of voice as input, the storage systems described above may also support chatbots, talkbots, chatterbots, or artificial conversational entities or other applications that are configured to conduct a conversation via auditory or textual methods. Likewise, the storage system may actually execute such an application to enable a user such as a system administrator to interact with the storage system via speech. Such applications are generally capable of voice interaction, music playback, making to-do lists, setting alarms, streaming podcasts, playing audiobooks, and providing weather, traffic, and other real time information, such as news, although in embodiments in accordance with the present disclosure, such applications may be utilized as interfaces to various system management operations.
  • The storage systems described above may also implement AI platforms for delivering on the vision of self-driving storage. Such AI platforms may be configured to deliver global predictive intelligence by collecting and analyzing large amounts of storage system telemetry data points to enable effortless management, analytics and support. In fact, such storage systems may be capable of predicting both capacity and performance, as well as generating intelligent advice on workload deployment, interaction and optimization. Such AI platforms may be configured to scan all incoming storage system telemetry data against a library of issue fingerprints to predict and resolve incidents in real-time, before they impact customer environments, and captures hundreds of variables related to performance that are used to forecast performance load.
  • The storage systems described above may support the serialized or simultaneous execution artificial intelligence applications, machine learning applications, data analytics applications, data transformations, and other tasks that collectively may form an AI ladder. Such an AI ladder may effectively be formed by combining such elements to form a complete data science pipeline, where exist dependencies between elements of the AI ladder. For example, AI may require that some form of machine learning has taken place, machine learning may require that some form of analytics has taken place, analytics may require that some form of data and information architecting has taken place, and so on. As such, each element may be viewed as a rung in an AI ladder that collectively can form a complete and sophisticated AI solution.
  • The storage systems described above may also, either alone or in combination with other computing environments, be used to deliver an AI everywhere experience where AI permeates wide and expansive aspects of business and life. For example, AI may play an important role in the delivery of deep learning solutions, deep reinforcement learning solutions, artificial general intelligence solutions, autonomous vehicles, cognitive computing solutions, commercial UAVs or drones, conversational user interfaces, enterprise taxonomies, ontology management solutions, machine learning solutions, smart dust, smart robots, smart workplaces, and many others. The storage systems described above may also, either alone or in combination with other computing environments, be used to deliver a wide range of transparently immersive experiences where technology can introduce transparency between people, businesses, and things. Such transparently immersive experiences may be delivered as augmented reality technologies, connected homes, virtual reality technologies, brain-computer interfaces, human augmentation technologies, nanotube electronics, volumetric displays, 4D printing technologies, or others. The storage systems described above may also, either alone or in combination with other computing environments, be used to support a wide variety of digital platforms. Such digital platforms can include, for example, 5G wireless systems and platforms, digital twin platforms, edge computing platforms, IoT platforms, quantum computing platforms, serverless PaaS, software-defined security, neuromorphic computing platforms, and so on.
  • Readers will appreciate that some transparently immersive experiences may involve the use of digital twins of various “things” such as people, places, processes, systems, and so on. Such digital twins and other immersive technologies can alter the way that humans interact with technology, as conversational platforms, augmented reality, virtual reality and mixed reality provide a more natural and immersive interaction with the digital world. In fact, digital twins may be linked with the real-world, perhaps even in real-time, to understand the state of a thing or system, respond to changes, and so on. Because digital twins consolidate massive amounts of information on individual assets and groups of assets (even possibly providing control of those assets), digital twins may communicate with each other to digital factory models of multiple linked digital twins.
  • The storage systems described above may also be part of a multi-cloud environment in which multiple cloud computing and storage services are deployed in a single heterogeneous architecture. In order to facilitate the operation of such a multi-cloud environment, DevOps tools may be deployed to enable orchestration across clouds. Likewise, continuous development and continuous integration tools may be deployed to standardize processes around continuous integration and delivery, new feature rollout and provisioning cloud workloads. By standardizing these processes, a multi-cloud strategy may be implemented that enables the utilization of the best provider for each workload. Furthermore, application monitoring and visibility tools may be deployed to move application workloads around different clouds, identify performance issues, and perform other tasks. In addition, security and compliance tools may be deployed for to ensure compliance with security requirements, government regulations, and so on. Such a multi-cloud environment may also include tools for application delivery and smart workload management to ensure efficient application delivery and help direct workloads across the distributed and heterogeneous infrastructure, as well as tools that ease the deployment and maintenance of packaged and custom applications in the cloud and enable portability amongst clouds. The multi-cloud environment may similarly include tools for data portability.
  • The storage systems described above may be used as a part of a platform to enable the use of crypto-anchors that may be used to authenticate a product's origins and contents to ensure that it matches a blockchain record associated with the product. Such crypto-anchors may take many forms including, for example, as edible ink, as a mobile sensor, as a microchip, and others. Similarly, as part of a suite of tools to secure data stored on the storage system, the storage systems described above may implement various encryption technologies and schemes, including lattice cryptography. Lattice cryptography can involve constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof. Unlike public-key schemes such as the RSA, Diffie-Hellman or Elliptic-Curve cryptosystems, which are easily attacked by a quantum computer, some lattice-based constructions appear to be resistant to attack by both classical and quantum computers.
  • A quantum computer is a device that performs quantum computing. Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement. Quantum computers differ from traditional computers that are based on transistors, as such traditional computers require that data be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1). In contrast to traditional computers, quantum computers use quantum bits, which can be in superpositions of states. A quantum computer maintains a sequence of qubits, where a single qubit can represent a one, a zero, or any quantum superposition of those two qubit states. A pair of qubits can be in any quantum superposition of 4 states, and three qubits in any superposition of 8 states. A quantum computer with n qubits can generally be in an arbitrary superposition of up to 2{circumflex over ( )}n different states simultaneously, whereas a traditional computer can only be in one of these states at any one time. A quantum Turing machine is a theoretical model of such a computer.
  • The storage systems described above may also be paired with FPGA-accelerated servers as part of a larger AI or ML infrastructure. Such FPGA-accelerated servers may reside near (e.g., in the same data center) the storage systems described above or even incorporated into an appliance that includes one or more storage systems, one or more FPGA-accelerated servers, networking infrastructure that supports communications between the one or more storage systems and the one or more FPGA-accelerated servers, as well as other hardware and software components. Alternatively, FPGA-accelerated servers may reside within a cloud computing environment that may be used to perform compute-related tasks for AI and ML jobs. Any of the embodiments described above may be used to collectively serve as a FPGA-based AI or ML platform. Readers will appreciate that, in some embodiments of the FPGA-based AI or ML platform, the FPGAs that are contained within the FPGA-accelerated servers may be reconfigured for different types of ML models (e.g., LSTMs, CNNs, GRUs). The ability to reconfigure the FPGAs that are contained within the FPGA-accelerated servers may enable the acceleration of a ML or AI application based on the most optimal numerical precision and memory model being used. Readers will appreciate that by treating the collection of FPGA-accelerated servers as a pool of FPGAs, any CPU in the data center may utilize the pool of FPGAs as a shared hardware microservice, rather than limiting a server to dedicated accelerators plugged into it.
  • The FPGA-accelerated servers and the GPU-accelerated servers described above may implement a model of computing where, rather than keeping a small amount of data in a CPU and running a long stream of instructions over it as occurred in more traditional computing models, the machine learning model and parameters are pinned into the high-bandwidth on-chip memory with lots of data streaming though the high-bandwidth on-chip memory. FPGAs may even be more efficient than GPUs for this computing model, as the FPGAs can be programmed with only the instructions needed to run this kind of computing model.
  • The storage systems described above may be configured to provide parallel storage, for example, through the use of a parallel file system such as BeeGFS. Such parallel files systems may include a distributed metadata architecture. For example, the parallel file system may include a plurality of metadata servers across which metadata is distributed, as well as components that include services for clients and storage servers. Through the use of a parallel file system, file contents may be distributed over a plurality of storage servers using striping and metadata may be distributed over a plurality of metadata servers on a directory level, with each server storing a part of the complete file system tree. Readers will appreciate that in some embodiments, the storage servers and metadata servers may run in userspace on top of an existing local file system. Furthermore, dedicated hardware is not required for client services, the metadata servers, or the hardware servers as metadata servers, storage servers, and even the client services may be run on the same machines.
  • Readers will appreciate that, in part due to the emergence of many of the technologies discussed above including mobile devices, cloud services, social networks, big data analytics, and so on, an information technology platform may be needed to integrate all of these technologies and drive new business opportunities by quickly delivering revenue-generating products, services, and experiences—rather than merely providing the technology to automate internal business processes. Information technology organizations may need to balance resources and investments needed to keep core legacy systems up and running while also integrating technologies to build an information technology platform that can provide the speed and flexibility in areas such as, for example, exploiting big data, managing unstructured data, and working with cloud applications and services. One possible embodiment of such an information technology platform is a composable infrastructure that includes fluid resource pools, such as many of the systems described above that, can meet the changing needs of applications by allowing for the composition and recomposition of blocks of disaggregated compute, storage, and fabric infrastructure. Such a composable infrastructure can also include a single management interface to eliminate complexity and a unified API to discover, search, inventory, configure, provision, update, and diagnose the composable infrastructure.
  • The systems described above can support the execution of a wide array of software applications. Such software applications can be deployed in a variety of ways, including container-based deployment models. Containerized applications may be managed using a variety of tools. For example, containerized applications may be managed using Docker Swarm, a clustering and scheduling tool for Docker containers that enables IT administrators and developers to establish and manage a cluster of Docker nodes as a single virtual system. Likewise, containerized applications may be managed through the use of Kubernetes, a container-orchestration system for automating deployment, scaling and management of containerized applications. Kubernetes may execute on top of operating systems such as, for example, Red Hat Enterprise Linux, Ubuntu Server, SUSE Linux Enterprise Servers, and others. In such examples, a master node may assign tasks to worker/minion nodes. Kubernetes can include a set of components (e.g., kubelet, kube-proxy, cAdvisor) that manage individual nodes as a well as a set of components (e.g., etcd, API server, Scheduler, Control Manager) that form a control plane. Various controllers (e.g., Replication Controller, DaemonSet Controller) can drive the state of a Kubernetes cluster by managing a set of pods that includes one or more containers that are deployed on a single node. Containerized applications may be used to facilitate a serverless, cloud native computing deployment and management model for software applications. In support of a serverless, cloud native computing deployment and management model for software applications, containers may be used as part of an event handling mechanisms (e.g., AWS Lambdas) such that various events cause a containerized application to be spun up to operate as an event handler.
  • The systems described above may be deployed in a variety of ways, including being deployed in ways that support fifth generation (‘5G’) networks. 5G networks may support substantially faster data communications than previous generations of mobile communications networks and, as a consequence may lead to the disaggregation of data and computing resources as modern massive data centers may become less prominent and may be replaced, for example, by more-local, micro data centers that are close to the mobile-network towers. The systems described above may be included in such local, micro data centers and may be part of or paired to multi-access edge computing (‘MEC’) systems. Such MEC systems may enable cloud computing capabilities and an IT service environment at the edge of the cellular network. By running applications and performing related processing tasks closer to the cellular customer, network congestion may be reduced and applications may perform better. MEC technology is designed to be implemented at the cellular base stations or other edge nodes, and enables flexible and rapid deployment of new applications and services for customers. MEC may also allow cellular operators to open their radio access network (‘RAN’) to authorized third-parties, such as application developers and content provider. Furthermore, edge computing and micro data centers may substantially reduce the cost of smartphones that work with the 5G network because customer may not need devices with such intensive processing power and the expensive requisite components.
  • Readers will appreciate that 5G networks may generate more data than previous network generations, especially in view of the fact that the high network bandwidth offered by 5G networks may cause the 5G networks to handle amounts and types of data (e.g., sensor data from self-driving cars, data generated by AR/VR technologies) that weren't as feasible for previous generation networks. In such examples, the scalability offered by the systems described above may be very valuable as the amount of data increases, adoption of emerging technologies increase, and so on.
  • For further explanation, FIG. 3D illustrates an exemplary computing device 350 that may be specifically configured to perform one or more of the processes described herein. As shown in FIG. 3D, computing device 350 may include a communication interface 352, a processor 354, a storage device 356, and an input/output (“I/O”) module 358 communicatively connected one to another via a communication infrastructure 360. While an exemplary computing device 350 is shown in FIG. 3D, the components illustrated in FIG. 3D are not intended to be limiting. Additional or alternative components may be used in other embodiments. Components of computing device 350 shown in FIG. 3D will now be described in additional detail.
  • Communication interface 352 may be configured to communicate with one or more computing devices. Examples of communication interface 352 include, without limitation, a wired network interface (such as a network interface card), a wireless network interface (such as a wireless network interface card), a modem, an audio/video connection, and any other suitable interface.
  • Processor 354 generally represents any type or form of processing unit capable of processing data and/or interpreting, executing, and/or directing execution of one or more of the instructions, processes, and/or operations described herein. Processor 354 may perform operations by executing computer-executable instructions 362 (e.g., an application, software, code, and/or other executable data instance) stored in storage device 356.
  • Storage device 356 may include one or more data storage media, devices, or configurations and may employ any type, form, and combination of data storage media and/or device. For example, storage device 356 may include, but is not limited to, any combination of the non-volatile media and/or volatile media described herein. Electronic data, including data described herein, may be temporarily and/or permanently stored in storage device 356. For example, data representative of computer-executable instructions 362 configured to direct processor 354 to perform any of the operations described herein may be stored within storage device 356. In some examples, data may be arranged in one or more databases residing within storage device 356.
  • I/O module 358 may include one or more I/O modules configured to receive user input and provide user output. I/O module 358 may include any hardware, firmware, software, or combination thereof supportive of input and output capabilities. For example, I/O module 358 may include hardware and/or software for capturing user input, including, but not limited to, a keyboard or keypad, a touchscreen component (e.g., touchscreen display), a receiver (e.g., an RF or infrared receiver), motion sensors, and/or one or more input buttons.
  • I/O module 358 may include one or more devices for presenting output to a user, including, but not limited to, a graphics engine, a display (e.g., a display screen), one or more output drivers (e.g., display drivers), one or more audio speakers, and one or more audio drivers. In certain embodiments, I/O module 358 is configured to provide graphical data to a display for presentation to a user. The graphical data may be representative of one or more graphical user interfaces and/or any other graphical content as may serve a particular implementation. In some examples, any of the systems, computing devices, and/or other components described herein may be implemented by computing device 350.
  • Advantages and features of the present disclosure can be further described by the following statements:
    • 1. A method of receiving a request to trim a first allocation unit of a storage device of a storage array; determining, by a processing device, whether the first allocation unit shares a portion of an erase block with a second allocation unit; in response to determining that the first allocation unit shares the portion of the erase block with the second allocation unit, relocating data of the portion of the second allocation unit sharing the erase block with the first allocation unit; and trimming a plurality of erase blocks associated with the first allocation unit, the plurality of erase blocks comprising the erase block shared with the second allocation unit.
    • 2. The method of statement 1, further comprising determining whether the first allocation unit has a second portion sharing a second erase block with a portion of a third allocation unit; in response to determining that the first allocation unit has the second portion sharing the second erase block with the portion of the third allocation unit, relocating data of the portion of the third allocation unit sharing the second erase block with the second portion of the first allocation unit; and in response to relocating the data of the portion of the third allocation unit, trimming the second erase block.
    • 3. The method of statement 1 or statement 2, wherein the data of the portion of the second allocation unit and the data of the portion of the third allocation unit are relocated to a same erase block.
    • 4. The method of statement 1, statement 2 or statement 3, wherein the data of the portion of the second allocation unit and the data of the portion of the third allocation unit are relocated to different erase blocks.
    • 5. The method of statement 1, statement 2, statement 3 or statement 4, wherein trimming a plurality of erase blocks associated with the first allocation unit comprises programming metadata to obsolete data stored at the plurality of erase blocks; and erase the obsoleted data stored at the plurality of erase blocks based on the metadata.
    • 6. The method of statement 1, statement 2, statement 3, statement 4 or statement 5, further comprising assigning the first allocation unit to a free block holder comprising a plurality of available allocation units.
    • 7. The method of statement 1, statement 2, statement 3, statement 4, statement 5 or statement 6, wherein the storage array comprises a plurality of heterogeneous storage devices.
  • FIG. 4 illustrates an example of a storage system 400 with a storage controller to perform erase block trimming for heterogeneous flash memory storage devices. In general, the storage system 400 may include an erase block trimming component 406 that may perform an erase block trimming process for a storage array.
  • As shown in FIG. 4 , the storage system 400 may include a storage controller 401 and storage devices 402 and 403 of a storage array. Although a single storage controller and two storage devices are illustrated, any number of storage controllers and storage devices may be included in the storage system 400. The storage devices 402 and 403 may be direct-mapped storage devices that do not include an internal storage controller. The storage devices 402 and 403 may be heterogeneous solid-state storage devices, where storage device 402 has a different erase block size than storage device 403. The storage controller 401 may include an erase block trimming component 406 that initiates and/or performs erase block trimming (also referred to as “reclaiming” hereafter) for heterogeneous storage devices 402 and 403. The erase block trimming component 406 may determine whether an allocation unit shares an erase block with another allocation unit (e.g., the allocation unit is a misaligned allocation unit). The erase block trimming component 406 may further relocate the data of the other allocation unit that shares the erase block with the misaligned allocation unit. Upon relocating the data, the erase block trimming component 406 may reclaim the erase blocks associated with the misaligned allocation unit. Further details with regards to the read frequency determination process are described in conjunction with FIGS. 5-11 below.
  • FIG. 5 is an example method 500 to perform operations of an erase block trimming process in accordance with embodiments of the disclosure. In general, the method 500 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof. In some embodiments, the erase block trimming component 406 of FIG. 4 that is external to a storage device may perform the method 500.
  • Method 500 may begin at block 502, where the processing logic determines that a first allocation unit has a first portion occupying a first group of erase blocks and a second portion sharing a second erase block with a portion of a second allocation unit. For example, the first allocation unit may be a misaligned allocation unit. The first allocation unit may have data stored at an erase block that is shared with other data for the second allocation unit.
  • At block 504, the processing logic relocates data of the portion of the second allocation unit to another erase block. For example, the processing logic may relocate the other data stored at the erase block that is shared with the first allocation unit to another erase block to prevent the data from being lost when the erase blocks associated with the first allocation unit are reclaimed.
  • At block 506, the processing logic may reclaim the first group of erase blocks and the second erase block that are associated with the first allocation unit. For example, a garbage collection process may be performed on the erase blocks of the first allocation unit to erase the data stored at the erase blocks and make the blocks available for subsequent programming operations.
  • FIG. 6 is an example method 600 to perform operations of an erase block trimming process for heterogeneous flash memory storage devices in accordance with embodiments of the disclosure. In general, the method 600 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof. In some embodiments, the erase block trimming component 406 of FIG. 4 that is external to a storage device may perform the method 600.
  • Method 600 may begin at block 602, where the processing logic receives a request to trim a first allocation unit of a storage device of a storage array. In some embodiments, the request to trim the allocation unit may be received from an authority, as previously described. For example, the processing logic may receive a request from an authority to trim the data stored at erase blocks of the first allocation unit.
  • At block 602, the processing logic determines whether the first allocation unit shares a portion of an erase block with a second allocation unit. If the processing logic determines that the first allocation unit does not share a portion of an erase block with a second allocation unit, then the first allocation unit is not a misaligned allocation unit. Accordingly, the erase blocks of the first allocation unit may be trimmed without the need to relocate any data. If the processing logic determines that the first allocation unit shares a portion of an erase block with a second allocation unit, then the first allocation unit is a misaligned allocation unit. Accordingly, data of the second allocation unit that shares the erase block with the first allocation unit may need to be relocated prior to trimming the erase blocks of the first allocation unit to prevent loss of the data.
  • In response to determining that the first allocation unit shares the portion of the erase block with the second allocation unit, at block 606 the processing logic relocates data of the portion of the second allocation unit. For example, the processing logic may relocate the data by reading the data from the storage device and subsequently programming the data to a new erase block. In embodiments, the processing logic may update a mapping data structure and/or program metadata to associate the data with the location of the new erase block the data was relocated to.
  • Upon relocating the data to the new erase block, at block 608 the processing logic trims erase blocks associated with the first allocation unit. For example, the processing logic may trim the erase blocks of the first allocation unit, including the erase block that was shared with the second allocation unit.
  • FIG. 7A is an illustration 700 of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to another erase block in accordance with embodiments of the disclosure. In illustration 700, the storage system is directed to trim an allocation unit A, for example from a file system or authority direction to delete a file or other direction to delete data. Allocation unit A occupies erase blocks 702 numbered 1, 2, 3 and 4, and part of erase blocks 702 numbered 0 and 5. Also, part of erase block 702 numbered 0 is occupied by part of allocation unit B, and part of erase block 702 numbered 5 is occupied by part of allocation unit C. In some embodiments, allocation units B and C do not belong to a same RAID 6 stripe.
  • The storage system, for example a storage array controller, a storage unit controller, a storage node processor, or a high-availability storage controller, etc., writes metadata to declare allocation unit A is obsoleted (e.g., declares obsoleted or dead data) in erase blocks 702 numbered 0, 1, 2, 3, 4 and 5. The storage system relocates data of allocation units B and C from erase blocks 702 numbered 0 and 5, respectively, to erase block 704. In some embodiments, prior to relocating data of allocation units B and C, the storage system may determine the amount of data of allocation unit B and allocation unit C. If the amount of data of allocation unit B, when combined with the amount of data of allocation unit C, is less than the size of erase block 704, then the data of allocation units B and C may both be relocated to erase block 704. If the amount of data of allocation unit B, when combined with the amount of data of allocation unit C, is greater than the size of erase block 704, then the data of allocation units B and C may be relocated to different erase blocks, as will be described below at FIG. 7B.
  • Following the relocation, garbage collection can then proceed to erase and reclaim erase blocks 702 numbered 0, 1, 2, 3, 4 and 5. In some embodiments, the six erase blocks 702 are reserved for another allocation unit. In embodiments, the allocation unit may be assigned to a free block holder that includes other available allocation units of the storage device, as will be described in further detail below. The numbers of erase blocks, and the various allocation units and alignments can be varied in further examples as readily understood and devised. By grouping together the data from allocation units B and C into erase block 704 for the relocation, and reserving the six erase blocks 702 for another allocation unit, the storage system reduces need for future data movement and thereby decreases write amplification.
  • FIG. 7B is an illustration 750 of an example of relocating data stored at erase blocks that are shared with a misaligned allocation unit to other erase blocks in accordance with embodiments of the disclosure. Illustration 750 includes similar components as illustration 700 of FIG. 7A. However, in illustration 750 the amount of the amount of data of allocation unit B, when combined with the amount of data of allocation unit C, is greater than the size of erase block 704. Because the amount of data of allocation unit B and allocation unit C exceeds the size of erase block 704, the data of allocation units B and C may be relocated to different erase blocks. Accordingly, data of allocation unit B may be relocated to erase block 704 and data of allocation unit C may be relocated to erase block 706.
  • FIG. 8 is an illustration 800 of an example of forming a wide RAID stripe including multiple erase blocks in accordance with embodiments of the disclosure. In illustration 800, one or more of the erase blocks 802 are in RAID 6 stripes 806a and 806b. As the total amount of storage memory, and the number of RAID 6 stripes 806, grows in a storage system, the probability of failure of one of the RAID 6 stripes 806 in the storage system increases due to the larger number of RAID 6 stripes 806 in the storage system, even though the failure rate of a specific RAID 6 stripe 806 is unchanged. The use of a wide RAID stripe 804, with a number of erase blocks 802 that is greater than any of the RAID 6 stripes 806, improves reliability as the total amount of storage memory increases.
  • In illustration 800, the wide RAID stripe 804 is formed of one hundred erase blocks 802 wide plus a parity shard (e.g., parity shard P) in erase block 802 numbered 100. The parity shard, in one embodiment, is calculated by performing XOR operations from erase blocks 802, on a bitwise, page-wise or erase block basis. If an erase block fails, the storage system performs a RAID 6 rebuild. For example, the RAID 6 stripe affected by the failed erase block may be rebuilt, or a portion of the RAID 6 stripe could be rebuilt. Occasionally, however, a RAID rebuild fails. If the RAID 6 rebuild fails, the storage system reads the erase blocks 802, including the parity shard, of the wide RAID stripe 804, and performs a rebuild based on those erase blocks 802. For example, the storage system could rebuild a page of the failed erase block 802, or more pages, or the entire erase block 802. After recovering the failed erase block 802, the system verifies the recovery of the failed erase block 802 and verifies the recovery of the RAID 6 stripe 806. Alternatively, the system could perform a RAID 6 rebuild for the RAID 6 stripe 806, using the rebuilt page(s) or rebuilt erase block 802. With this double-level redundancy to correct failed erase blocks in the storage system, first in the RAID 6 stripe 806, and then in the wide RAID stripe 804, the storage system has improved reliability for data stored at the storage system.
  • Referring to FIG. 8 , the trimming of the allocation unit A and relocation of data from portions of allocation units B and C from wide RAID stripe 804, as previously described at FIGS. 7A and 7B, affects the parity of the wide RAID stripe 804. In some embodiments, in response to the relocation of the data from portions of allocation units B and C, the storage system may obsolete the data of the parity shard P in erase block 802 numbered 100, then calculate and write a new parity shard into the erase block 802 numbered 100. In other embodiments, the data of the parity shard P erase block 802 numbered 100 is left intact and a new parity shard (e.g., P′ at erase block 802 numbered 101) is calculated. The new parity shard may be calculated by performing XOR operations across the remaining data and the earlier parity shard P, and write parity shard P′ to erase block 802 numbered 101. This process can be repeated until there are too many parity shards, for example the number of erase blocks 802 for parity shards exceeds a threshold, as will be described in further detail below. Then, the erase blocks 802 for parity shards can be trimmed, and a new parity shard calculated for the remaining data in the wide RAID stripe 804.
  • FIG. 9 is an example method 900 to perform rebuild operations on failed erase blocks of a storage system using a wide RAID stripe in accordance with embodiments of the disclosure. In general, the method 900 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof. In some embodiments, the storage controller 401 of FIG. 4 that is external to a storage device may perform the method 900.
  • Method 900 may begin at block 902, where the processing logic forms multiple RAID 6 stripes across erase blocks of a solid-state storage device. At block 904, the processing logic forms a wide RAID stripe, including at least one parity shard, across a number of erase blocks of the solid-state storage memory. The number of erase blocks of the solid-state storage memory may be greater than the number of erase blocks for a single RAID 6 stripe formed at block 902.
  • At block 906, the processing logic determines if an erase block failure has occurred. If the processing logic determines that an erase block failure has not occurred, then the storage system may proceed with normal operations. If the processing logic determines that an erase block failure has occurred, then at block 908 the processing logic performs a RAID 6 rebuild for the RAID 6 stripe that is affected by the failed erase block.
  • At block 910, the processing logic determines if a RAID 6 rebuild failure occurred. If the processing logic determines that a RAID 6 rebuild failure has not occurred, then the storage system may proceed with normal operations. If the processing logic determines that a RAID 6 rebuild failure has occurred, then at block 912, the processing logic reads all erase blocks of the wide RAID stripe, including the at least one parity shard.
  • At block 914, the processing logic rebuilds one or more pages of the failed erase block in accordance with all the erase blocks of the wide RAID stripe, including the at least one parity shard. At block 916, the processing logic verifies that the rebuilding of the failed erase block and the rebuilding of the RAID 6 stripe were successful. In some embodiments, if the RAID 6 stripe has not been successfully rebuilt, the processing logic may perform a RAID 6 rebuild for the RAID 6 stripe affected by the failed erase block using the rebuilt pages of the failed erase block.
  • FIG. 10 is an example method 1000 to generate parity for a wide RAID stripe in accordance with embodiments of the disclosure. In general, the method 1000 may be performed by processing logic that may include hardware (e.g., processing device, circuitry, dedicated logic, programmable logic, microcode, hardware of a device, integrated circuit, etc.), software (e.g., instructions run or executed on a processing device), or a combination thereof. In some embodiments, the storage controller 401 of FIG. 4 that is external to a storage device may perform the method 1000.
  • Method 1000 may begin at block 1002, where the processing logic trims an allocation unit from a wide RAID stripe. At block 1004, the processing logic determines a new parity shard based on the previous parity shard of the wide RAID stripe and remaining data of the wide RAID stripe. The new parity shard is then stored at a new erase block of the wide RAID stripe.
  • At block 1006, the processing logic determines if the number of erase blocks used for parity shards in the wide RAID stripe exceeds a threshold. If the number of erase blocks used for parity shards in the wide RAID stripe exceeds a threshold, at block 1008 the processing logic trims erase blocks used for parity shards in the wide RAID stipe. Upon trimming the erase blocks used for parity shards, at block 1010 the processing logic determines another parity shard from the remaining data in the wide RAID stripe. The other parity shard is then stored at an erase block of the wide RAID stripe. If the processing logic determines that the number of erase blocks used for parity shards does not exceed the threshold, then at block 1012 the processing logic determines to not trim erase blocks used for parity shards.
  • FIG. 11A is an illustration 1100 of an example of assigning data blocks of a reclaimed allocation unit to a free block holder in accordance with embodiments of the disclosure. In illustration 1100, authority 1102 may direct storage device 1104 of a storage system to reclaim an allocation unit (AU). The AU may be reclaimed/trimmed, as previously described, resulting in reclaimed AU 1106. Upon reclaiming the AU, the data blocks of the reclaimed AU 1106 may be assigned to a free block holder 1108 that includes other available data blocks on storage device 1104. It should be noted that free block holder 1108 is shown for illustrative purposes and is not a physical component of storage device 1104. It should also be noted that although illustration 1100 shows a single authority and a single storage device, embodiments of the disclosure may utilize any number of authorities and any number of storage devices in any combination.
  • FIG. 11B is an illustration 1125 of an example of a storage device receiving a request for additional allocation units from an authority in accordance with some embodiments of the disclosure. In illustration 1125, authority 1102 determines that additional AUs are required for programming operations to store data at storage device 1104. Accordingly, authority 1102 may transmit a request for additional AUs to storage device 1104. The request may include a particular number of AUs required by the authority 1102.
  • Upon receiving the request, the storage device 1104 may generate new AUs from available data blocks, including the data blocks of reclaimed AU 1106, assigned to the free block holder 1108 to provide to the authority 1102. In embodiments, when generating the new AUs to be provided to the authority 1102, the storage device 1104 may select data blocks from the free block holder 1108 that correspond to physical locations on the storage device 1104 that allow for the performance of parallel programming operations. For example, the new AUs may have data blocks that are located on certain word lines of the storage device 1104 that allow for programming operations to be performed on the blocks in parallel. By selecting data blocks and providing AUs in such a manner, the performance of the storage system may be improved by allowing multiple programming operations to be performed in parallel with one another.
  • FIG. 11C is an illustration 1150 of an example of a storage device providing the additional allocation units to an authority in accordance with embodiments of the disclosure. In illustration 1150, upon generating the new AUs as previously described at FIG. 11B, storage device 1104 may provide authority 1102 with the new AUs including data blocks from the free block holder 1108. For example, the storage device 1104 may provide the authority 1102 with AU identifiers for the identified AUs from the free block holder 1108. The authority 1102 may then use the AU identifiers provided by the storage device 1104 for subsequent programming operations by providing data to be stored at the AUs along with the AU identifiers. Once the authority 1102 determines that the data no longer needs to be stored at the AUs, the authority 1102 may send a subsequent direction to reclaim the AUs, and the process as previously described at FIGS. 11A-C may be repeated.
  • In some embodiments, the AU identifiers provided by the storage device 1104 to the authority 1102 may correspond to sequence numbers that are incrementally increased as each AU is identified by the storage device 1104. By incrementally increasing the AU identifiers, storage device 1104 may be able to determine if the authority 1102 received previously identified AUs of the storage device 1104 before sending additional AUs to the authority 1102.
  • For example, in one scenario, authority 1102 may request AUs from storage device 1104. The request for AUs from the authority 1102 may include an indication of the highest sequence number of an AU identifier that was most recently provided to the authority 1102 prior to the request. For example, if the highest sequence number of an AU identifier that was most recently provided to the authority prior to the request was 2000, then the request for AUs sent to storage device 1104 may indicate that the highest sequence number of an AU previously provided to the authority 1102 is 2000.
  • Upon receiving the request, the storage device 1104 may generate AUs and assign sequence numbers that incrementally increase to the generated AUs. For example, if the storage device 1104 generates 50 AUs that are to be provided to the authority 1102, the storage device 1104 may incrementally assign sequence numbers 2001-2050 to the 50 new AUs.
  • However, prior to providing the identified AUs to the authority 1102, some sort of system failure may occur. For example, the storage system may experience an unexpected loss of power or storage device 1104 may crash. In a conventional storage system, if the authority 1102 does not receive AUs in response to the request, the authority 1102 sends an additional request for AUs to storage device 1104. Upon receiving the request the storage device 1104, unaware that the authority 1102 never received the previously generated AUs (e.g., AUs 2001-2050), generates 50 new AUs and provides these 50 new AUs to the authority 1102. However, because the authority 1102 never received the previously generated AUs, the authority 1102 may never direct the storage device 1104 to trim the previously generated AUs so that the previously generated AUs can be used for subsequent programming operations. This results in the previously generated AUs being in an idle state where the previously generated AUs are never used for the storage of data, decreasing the storage capacity and performance of the storage system.
  • However, by including the highest sequence number of an AU identifier for the most recently provided AU, the storage device 1104 can determine that the authority 1102 has not received the previously generated AUs by comparing the highest sequence number of an AU generated by the storage device 1104 to the sequence number included in the request from the authority 1102. For example, the storage device 1104 may receive a request from the authority 1102 that indicates the highest sequence number for the most recently provided AU is 2000. The storage device 1104 may then compare this value with the highest sequence number (e.g., 2050) of an AU generated by the storage device 1104. Because the highest sequence number indicated by the request from the authority 1102 does not match the highest sequence number of an AU generated by the storage device 1104, the storage device 1104 determines that the authority 1102 never received the 50 previously generated AUs. Accordingly, rather than generating 50 new AUs, the storage device 1104 provides the 50 previously identified AUs to the authority 1102. By providing the previously generated AUs to the authority 1102 rather than generating and providing new AUs, the storage capacity and performance of the storage system is increased.
  • While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
  • Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
  • Thus, particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous.

Claims (20)

What is claimed is:
1. A system comprising:
a plurality of heterogeneous solid-state storage devices; and
a storage controller operatively coupled to the solid-state storage plurality of heterogeneous solid-state storage devices, the storage controller comprising a processing device, the processing device to:
determine that a first set of data blocks has a first portion occupying a first plurality of erase blocks and a second portion sharing a second erase block with a portion of a second set of data blocks; and
in response to the request to perform garbage collection, relocate data of the portion of the second set of data blocks sharing the second erase block with the second portion of the first set of data blocks to another erase block.
2. The system of claim 1, wherein the plurality of heterogeneous solid-state storage devices uses different erase block sizes.
3. The system of claim 1, wherein the first set of data blocks comprises a first allocation of blocks and the second set of data blocks comprises a second allocation of blocks.
4. The system of claim 1, wherein the processing devices is further to:
in response to relocating the data of the portion of the second set of data blocks, perform garbage collection of the first plurality of erase blocks and the second erase block.
5. The system of claim 1, wherein the processing device is further to:
relocate data of a portion of a third set of data blocks sharing a third erase block with a third portion of the first set of data blocks to the other erase block.
6. The system of claim 1, wherein the processing device is further to:
identify the first plurality of erase blocks and the second erase block associated with the first set of data blocks, wherein the processing device determines that the first set of data blocks has a first portion occupying the first plurality of erase blocks and the second portion sharing a second erase block with the portion of the second set of data blocks is in response to identifying the first plurality of erase blocks and the second erase block associated with the first set of data blocks.
7. The system of claim 4, wherein to perform garbage collection of the first plurality of erase blocks and the second erase block, the processing device is further to:
program metadata to obsolete the data stored at the first plurality of erase blocks and the second erase block.
8. The system of claim 1, wherein the first set of data blocks is assigned to one of a plurality of available sets of data blocks.
9. The system of claim 8, wherein the processing device is further to:
in response to receiving a request for sets of data blocks, identify one or more sets of data blocks of the plurality of available sets of data blocks, wherein the one or more sets of data blocks correspond to physical locations on a solid-state storage device of the plurality of solid-state storage devices that allow for performance of parallel programming operations.
10. A method, comprising:
determining that a first set of data blocks has a first portion occupying a first plurality of erase blocks and a second portion sharing a second erase block with a portion of a second set of data blocks, wherein the first plurality of erase blocks and the second erase block are located on a plurality of heterogenous solid-state storage devices; and
in response to the request to perform garbage collection, relocating data of the portion of the second set of data blocks sharing the second erase block with the second portion of the first set of data blocks to another erase block.
11. The method of claim 10, wherein the plurality of heterogeneous solid-state storage devices uses different erase block sizes.
12. The method of claim 10, wherein the first set of data blocks comprises a first allocation of blocks and the second set of data blocks comprises a second allocation of blocks.
13. The method of claim 10, further comprising:
in response to relocating the data of the portion of the second set of data blocks, performing garbage collection of the first plurality of erase blocks and the second erase block.
14. The method of claim 10, further comprising:
relocating data of a portion of a third set of data blocks sharing a third erase block with a third portion of the first set of data blocks to the other erase block.
15. The method of claim 10, further comprising:
identifying the first plurality of erase blocks and the second erase block associated with the first set of data blocks, wherein the processing device determines that the first set of data blocks has a first portion occupying the first plurality of erase blocks and the second portion sharing a second erase block with the portion of the second set of data blocks is in response to identifying the first plurality of erase blocks and the second erase block associated with the first set of data blocks.
16. The method of claim 13, wherein performing garbage collection of the first plurality of erase blocks and the second erase block comprises:
programing metadata to obsolete the data stored at the first plurality of erase blocks and the second erase block.
17. The method of claim 10, wherein the first set of data blocks is assigned to one of a plurality of available sets of data blocks.
18. The method of claim 17, further comprising:
in response to receiving a request for sets of data blocks, identifying one or more sets of data blocks of the plurality of available sets of data blocks, wherein the one or more sets of data blocks correspond to physical locations on a solid-state storage device of the plurality of solid-state storage devices that allow for performance of parallel programming operations.
19. A non-transitory computer readable storage medium storing instructions, which when executed, cause a processing device to:
determine that a first set of data blocks has a first portion occupying a first plurality of erase blocks and a second portion sharing a second erase block with a portion of a second set of data blocks, wherein the first plurality of erase blocks and the second erase block are located on a plurality of heterogenous solid-state storage devices; and
in response to the request to perform garbage collection, relocate data of the portion of the second set of data blocks sharing the second erase block with the second portion of the first set of data blocks to another erase block.
20. The non-transitory computer readable storage medium, wherein the processing device is further to:
in response to relocating the data of the portion of the second set of data blocks, perform garbage collection of the first plurality of erase blocks and the second erase block.
US17/955,491 2018-02-22 2022-09-28 Garbage collection for heterogenous flash memory storage devices Pending US20230022758A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US17/955,491 US20230022758A1 (en) 2018-02-22 2022-09-28 Garbage collection for heterogenous flash memory storage devices

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201862633972P 2018-02-22 2018-02-22
US201862663169P 2018-04-26 2018-04-26
US16/282,181 US11494109B1 (en) 2018-02-22 2019-02-21 Erase block trimming for heterogenous flash memory storage devices
US17/955,491 US20230022758A1 (en) 2018-02-22 2022-09-28 Garbage collection for heterogenous flash memory storage devices

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US16/282,181 Continuation US11494109B1 (en) 2018-02-22 2019-02-21 Erase block trimming for heterogenous flash memory storage devices

Publications (1)

Publication Number Publication Date
US20230022758A1 true US20230022758A1 (en) 2023-01-26

Family

ID=83902457

Family Applications (2)

Application Number Title Priority Date Filing Date
US16/282,181 Active US11494109B1 (en) 2018-02-22 2019-02-21 Erase block trimming for heterogenous flash memory storage devices
US17/955,491 Pending US20230022758A1 (en) 2018-02-22 2022-09-28 Garbage collection for heterogenous flash memory storage devices

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US16/282,181 Active US11494109B1 (en) 2018-02-22 2019-02-21 Erase block trimming for heterogenous flash memory storage devices

Country Status (1)

Country Link
US (2) US11494109B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220278927A1 (en) * 2021-03-01 2022-09-01 Juniper Networks, Inc. Data interfaces with isolation for containers deployed to compute nodes

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10976947B2 (en) * 2018-10-26 2021-04-13 Pure Storage, Inc. Dynamically selecting segment heights in a heterogeneous RAID group
CN112307113A (en) * 2019-07-29 2021-02-02 中兴通讯股份有限公司 Service request message sending method and distributed database architecture
CN111104145B (en) * 2019-11-29 2021-08-31 浪潮电子信息产业股份有限公司 Out-of-band updating method and system for Expander
CN117234962B (en) * 2023-11-10 2024-03-26 成都佰维存储科技有限公司 Space recycling method and device, readable storage medium and electronic equipment

Family Cites Families (375)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5208813A (en) 1990-10-23 1993-05-04 Array Technology Corporation On-line reconstruction of a failed redundant array system
US5403639A (en) 1992-09-02 1995-04-04 Storage Technology Corporation File server having snapshot application data groups
US5390327A (en) 1993-06-29 1995-02-14 Digital Equipment Corporation Method for on-line reorganization of the data on a RAID-4 or RAID-5 array in the absence of one disk and the on-line restoration of a replacement disk
DE9310582U1 (en) 1993-07-15 1993-09-23 Hettich Paul Gmbh & Co LOCKING DEVICE FOR DRAWERS OR THE LIKE
US5479653A (en) 1994-07-14 1995-12-26 Dellusa, L.P. Disk array apparatus and method which supports compound raid configurations and spareless hot sparing
US5649093A (en) 1995-05-22 1997-07-15 Sun Microsystems, Inc. Server disk error recovery system
US6412045B1 (en) 1995-05-23 2002-06-25 Lsi Logic Corporation Method for transferring data from a host computer to a storage media using selectable caching strategies
JP3641872B2 (en) 1996-04-08 2005-04-27 株式会社日立製作所 Storage system
US5764767A (en) 1996-08-21 1998-06-09 Technion Research And Development Foundation Ltd. System for reconstruction of a secret shared by a plurality of participants
US5832529A (en) 1996-10-11 1998-11-03 Sun Microsystems, Inc. Methods, apparatus, and product for distributed garbage collection
US5940838A (en) 1997-07-11 1999-08-17 International Business Machines Corporation Parallel file system and method anticipating cache usage patterns
US6038639A (en) 1997-09-09 2000-03-14 Storage Technology Corporation Data file storage management system for snapshot copy operations
US6799283B1 (en) 1998-12-04 2004-09-28 Matsushita Electric Industrial Co., Ltd. Disk array device
US7133511B2 (en) 1998-12-11 2006-11-07 Securelogix Corporation Telephony security system
JP2000181803A (en) 1998-12-18 2000-06-30 Fujitsu Ltd Electronic data keeping device with key management function and method therefor
US6182214B1 (en) 1999-01-08 2001-01-30 Bay Networks, Inc. Exchanging a secret over an unreliable network
US6725392B1 (en) 1999-03-03 2004-04-20 Adaptec, Inc. Controller fault recovery system for a distributed file system
JP2002543460A (en) 1999-04-27 2002-12-17 ミスチェンコ、ヴァレンティン・アレクサンドロヴィッチ Method for encrypting information and apparatus for implementing the method
US6275898B1 (en) 1999-05-13 2001-08-14 Lsi Logic Corporation Methods and structure for RAID level migration within a logical unit
US6834298B1 (en) 1999-09-21 2004-12-21 Siemens Information And Communication Networks, Inc. System and method for network auto-discovery and configuration
US6643748B1 (en) 2000-04-20 2003-11-04 Microsoft Corporation Programmatic masking of storage units
US6804755B2 (en) 2000-06-19 2004-10-12 Storage Technology Corporation Apparatus and method for performing an instant copy of data based on a dynamically changeable virtual mapping scheme
US6912537B2 (en) 2000-06-20 2005-06-28 Storage Technology Corporation Dynamically changeable virtual mapping scheme
JP2002050183A (en) 2000-07-31 2002-02-15 Mitsubishi Electric Corp Semiconductor memory
US6738875B1 (en) 2000-07-31 2004-05-18 Microsoft Corporation Efficient write-watch mechanism useful for garbage collection in a computer system
US6658478B1 (en) 2000-08-04 2003-12-02 3Pardata, Inc. Data storage system
JP2002108573A (en) 2000-09-28 2002-04-12 Nec Corp Disk array device and method for controlling its error and recording medium with its control program recorded thereon
US6757769B1 (en) 2000-11-28 2004-06-29 Emc Corporation Cooperative lock override procedure
US6718448B1 (en) 2000-11-28 2004-04-06 Emc Corporation Queued locking of a shared resource using multimodal lock types
US7107480B1 (en) 2000-12-22 2006-09-12 Simpletech, Inc. System and method for preventing data corruption in solid-state memory devices after a power failure
WO2002065275A1 (en) 2001-01-11 2002-08-22 Yottayotta, Inc. Storage virtualization system and methods
US6850938B1 (en) 2001-02-08 2005-02-01 Cisco Technology, Inc. Method and apparatus providing optimistic locking of shared computer resources
EP1368742A4 (en) 2001-02-13 2010-09-01 Candera Inc Storage virtualization and storage management to provide higher level storage services
US6836816B2 (en) 2001-03-28 2004-12-28 Intel Corporation Flash memory low-latency cache
US6968350B2 (en) 2001-04-07 2005-11-22 Microsoft Corporation Method for establishing a virtual hard drive for an emulated computer system running on a host computer system
US7444532B2 (en) 2001-12-03 2008-10-28 Dell Products L.P. System and method for autonomous power sequencing
US20030110205A1 (en) 2001-12-07 2003-06-12 Leith Johnson Virtualized resources in a partitionable server
US6973549B1 (en) 2001-12-10 2005-12-06 Incipient, Inc. Locking technique for control and synchronization
US6986015B2 (en) 2001-12-10 2006-01-10 Incipient, Inc. Fast path caching
US6985995B2 (en) 2002-03-29 2006-01-10 Panasas, Inc. Data file migration from a mirrored RAID to a non-mirrored XOR-based RAID without rewriting the data
US7032125B2 (en) 2002-04-25 2006-04-18 Lsi Logic Corporation Method for loosely coupling metadata and data in a storage array
US7051155B2 (en) 2002-08-05 2006-05-23 Sun Microsystems, Inc. Method and system for striping data to accommodate integrity metadata
US7260628B2 (en) 2002-09-06 2007-08-21 Hitachi, Ltd. Event notification in storage networks
US7076606B2 (en) 2002-09-20 2006-07-11 Quantum Corporation Accelerated RAID with rewind capability
US7216164B1 (en) 2002-10-09 2007-05-08 Cisco Technology, Inc. Methods and apparatus for determining the performance of a server
US7028218B2 (en) 2002-12-02 2006-04-11 Emc Corporation Redundant multi-processor and logical processor configuration for a file server
US7162575B2 (en) 2002-12-20 2007-01-09 Veritas Operating Corporation Adaptive implementation of requested capabilities for a logical volume
US7159150B2 (en) 2002-12-31 2007-01-02 International Business Machines Corporation Distributed storage system capable of restoring data in case of a storage failure
WO2004092961A1 (en) 2003-04-07 2004-10-28 Itracs Corporation Network security system based on physical location
US7424498B1 (en) 2003-06-30 2008-09-09 Data Domain, Inc. Probabilistic summary data structure based encoding for garbage collection
US8145736B1 (en) 2003-06-30 2012-03-27 Symantec Operating Corporation Fast distributed object lookup for a computer network
US7119572B2 (en) 2003-07-02 2006-10-10 Daniel Industries, Inc. Programmable logic device configuration via device communication lines
EP1649387B1 (en) 2003-07-16 2010-11-10 Joltid Ltd. Distributed database system
US7865485B2 (en) 2003-09-23 2011-01-04 Emc Corporation Multi-threaded write interface and methods for increasing the single file read and write throughput of a file server
US7188228B1 (en) * 2003-10-01 2007-03-06 Sandisk Corporation Hybrid mapping implementation within a non-volatile memory system
US7685436B2 (en) 2003-10-02 2010-03-23 Itt Manufacturing Enterprises, Inc. System and method for a secure I/O interface
JP4426262B2 (en) 2003-11-26 2010-03-03 株式会社日立製作所 Disk array device and failure avoiding method for disk array device
US20050114595A1 (en) 2003-11-26 2005-05-26 Veritas Operating Corporation System and method for emulating operating system metadata to provide cross-platform access to storage volumes
US7370220B1 (en) 2003-12-26 2008-05-06 Storage Technology Corporation Method and apparatus for controlling power sequencing of a plurality of electrical/electronic devices
US7383375B2 (en) 2003-12-30 2008-06-03 Sandisk Corporation Data run programming
US8560747B1 (en) 2007-02-16 2013-10-15 Vmware, Inc. Associating heartbeat data with access to shared resources of a computer system
US7334156B2 (en) 2004-02-13 2008-02-19 Tandberg Data Corp. Method and apparatus for RAID conversion
JP4456909B2 (en) 2004-03-29 2010-04-28 株式会社日立製作所 Backup method, storage system and program thereof
JP2005293774A (en) 2004-04-02 2005-10-20 Hitachi Global Storage Technologies Netherlands Bv Control method of disk unit
US7424482B2 (en) 2004-04-26 2008-09-09 Storwize Inc. Method and system for compression of data for block mode access storage
US8090837B2 (en) 2004-05-27 2012-01-03 Hewlett-Packard Development Company, L.P. Communication in multiprocessor using proxy sockets
US7634566B2 (en) 2004-06-03 2009-12-15 Cisco Technology, Inc. Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
US7536506B2 (en) 2004-06-21 2009-05-19 Dot Hill Systems Corporation RAID controller using capacitor energy source to flush volatile cache data to non-volatile memory during main power outage
US7164608B2 (en) 2004-07-28 2007-01-16 Aplus Flash Technology, Inc. NVRAM memory cell architecture that integrates conventional SRAM and flash cells
US7424592B1 (en) 2004-07-30 2008-09-09 Symantec Operating Corporation System and method for implementing volume sets in a storage system
US8375146B2 (en) 2004-08-09 2013-02-12 SanDisk Technologies, Inc. Ring bus structure and its use in flash memory systems
US7681105B1 (en) 2004-08-09 2010-03-16 Bakbone Software, Inc. Method for lock-free clustered erasure coding and recovery of data across a plurality of data stores in a network
US7681104B1 (en) 2004-08-09 2010-03-16 Bakbone Software, Inc. Method for erasure coding data across a plurality of data stores in a network
US20060074940A1 (en) 2004-10-05 2006-04-06 International Business Machines Corporation Dynamic management of node clusters to enable data sharing
US7814273B2 (en) 2004-11-05 2010-10-12 Data Robotics, Inc. Dynamically expandable and contractible fault-tolerant storage system permitting variously sized storage devices and method
US20060114930A1 (en) 2004-11-17 2006-06-01 International Business Machines (Ibm) Corporation In-band control of indicators to identify devices distributed on the same domain
US7437653B2 (en) 2004-12-22 2008-10-14 Sandisk Corporation Erased sector detection mechanisms
US7363444B2 (en) 2005-01-10 2008-04-22 Hewlett-Packard Development Company, L.P. Method for taking snapshots of data
US8180855B2 (en) 2005-01-27 2012-05-15 Netapp, Inc. Coordinated shared storage architecture
US20060174074A1 (en) 2005-02-03 2006-08-03 International Business Machines Corporation Point-in-time copy operation
US7913300B1 (en) 2005-04-08 2011-03-22 Netapp, Inc. Centralized role-based access control for storage servers
US8200887B2 (en) 2007-03-29 2012-06-12 Violin Memory, Inc. Memory management system and method
US8886778B2 (en) 2005-04-29 2014-11-11 Netapp, Inc. System and method for proxying network management protocol commands to enable cluster wide management of data backups
US8364845B2 (en) 2005-05-19 2013-01-29 Wyse Technology Inc. Method and system for thin client configuration
WO2006123416A1 (en) 2005-05-19 2006-11-23 Fujitsu Limited Disk failure recovery method and disk array device
JP2008542946A (en) 2005-06-09 2008-11-27 エヌエックスピー ビー ヴィ COMMUNICATION SYSTEM NODE STORAGE DEVICE, DATA STORAGE METHOD, AND COMMUNICATION SYSTEM NODE
US7933936B2 (en) 2005-06-10 2011-04-26 Network Appliance, Inc. Method and system for automatic management of storage space
US7979613B2 (en) 2005-07-15 2011-07-12 International Business Machines Corporation Performance of a storage system
JP2007087036A (en) 2005-09-21 2007-04-05 Hitachi Ltd Snapshot maintenance device and method
JP4662548B2 (en) 2005-09-27 2011-03-30 株式会社日立製作所 Snapshot management apparatus and method, and storage system
US20070079068A1 (en) 2005-09-30 2007-04-05 Intel Corporation Storing data with different specified levels of data redundancy
US7558859B2 (en) 2005-10-17 2009-07-07 Microsoft Corporation Peer-to-peer auction based data distribution
US7778960B1 (en) 2005-10-20 2010-08-17 American Megatrends, Inc. Background movement of data between nodes in a storage cluster
US8010485B1 (en) 2005-10-20 2011-08-30 American Megatrends, Inc. Background movement of data between nodes in a storage cluster
US8010829B1 (en) 2005-10-20 2011-08-30 American Megatrends, Inc. Distributed hot-spare storage in a storage cluster
US7730258B1 (en) 2005-11-01 2010-06-01 Netapp, Inc. System and method for managing hard and soft lock state information in a distributed storage system environment
ITVA20050061A1 (en) 2005-11-08 2007-05-09 St Microelectronics Srl METHOD OF MANAGEMENT OF A NON-VOLATILE MEMORY AND RELATIVE MEMORY DEVICE
US8020047B2 (en) 2006-01-17 2011-09-13 Xyratex Technology Limited Method and apparatus for managing storage of data
JP2007199953A (en) 2006-01-25 2007-08-09 Fujitsu Ltd Disk array device and disk array control method
JP4927408B2 (en) 2006-01-25 2012-05-09 株式会社日立製作所 Storage system and data restoration method thereof
US7743197B2 (en) 2006-05-11 2010-06-22 Emulex Design & Manufacturing Corporation System and method for virtualizing PCIe devices
US9390019B2 (en) 2006-02-28 2016-07-12 Violin Memory Inc. Method and apparatus for providing high-performance and highly-scalable storage acceleration
JP2007233903A (en) 2006-03-03 2007-09-13 Hitachi Ltd Storage controller and data recovery method for storage controller
US20070214314A1 (en) 2006-03-07 2007-09-13 Reuter James M Methods and systems for hierarchical management of distributed data
US20070214194A1 (en) 2006-03-07 2007-09-13 James Reuter Consistency methods and systems
US8832247B2 (en) 2006-03-24 2014-09-09 Blue Coat Systems, Inc. Methods and systems for caching content at multiple levels
US7444499B2 (en) 2006-03-28 2008-10-28 Sun Microsystems, Inc. Method and system for trace generation using memory index hashing
US8615599B1 (en) 2006-03-31 2013-12-24 Cisco Technology, Inc. Method and apparatus for preventing loops in a network by controlling broadcasts
WO2007134196A2 (en) 2006-05-10 2007-11-22 Digital Fountain, Inc. Code generator and decoder using hybrid codes
US20070268905A1 (en) 2006-05-18 2007-11-22 Sigmatel, Inc. Non-volatile memory error correction system and method
US7886111B2 (en) 2006-05-24 2011-02-08 Compellent Technologies System and method for raid management, reallocation, and restriping
WO2007149977A2 (en) 2006-06-21 2007-12-27 Rf Code, Inc. Location-based security, privacy, access control and monitoring system
US7987438B2 (en) 2006-08-10 2011-07-26 International Business Machines Corporation Structure for initializing expansion adapters installed in a computer system having similar expansion adapters
US7555599B2 (en) 2006-09-06 2009-06-30 International Business Machines Corporation System and method of mirrored RAID array write management
US7475215B2 (en) 2006-09-08 2009-01-06 Lsi Corporation Identification of uncommitted memory blocks during an initialization procedure
US7743276B2 (en) 2006-09-27 2010-06-22 Hewlett-Packard Development Company, L.P. Sufficient free space for redundancy recovery within a distributed data-storage system
JP2008103936A (en) 2006-10-18 2008-05-01 Toshiba Corp Secret information management device, and secret information management system
JP4932427B2 (en) 2006-10-20 2012-05-16 株式会社日立製作所 Storage device and storage method
US7970873B2 (en) 2006-10-30 2011-06-28 Dell Products L.P. System and method for assigning addresses to information handling systems
WO2008065695A1 (en) 2006-11-27 2008-06-05 Fujitsu Limited Server management program, mail server management program, server management system, and server management method
US7613947B1 (en) 2006-11-30 2009-11-03 Netapp, Inc. System and method for storage takeover
US8694712B2 (en) 2006-12-05 2014-04-08 Microsoft Corporation Reduction of operational costs of virtual TLBs
US9153337B2 (en) 2006-12-11 2015-10-06 Marvell World Trade Ltd. Fatigue management system and method for hybrid nonvolatile solid state memory system
US20080155191A1 (en) 2006-12-21 2008-06-26 Anderson Robert J Systems and methods for providing heterogeneous storage systems
US8046548B1 (en) 2007-01-30 2011-10-25 American Megatrends, Inc. Maintaining data consistency in mirrored cluster storage systems using bitmap write-intent logging
US8498967B1 (en) 2007-01-30 2013-07-30 American Megatrends, Inc. Two-node high availability cluster storage solution using an intelligent initiator to avoid split brain syndrome
US7791952B2 (en) * 2007-01-30 2010-09-07 Micron Technology, Inc. Memory device architectures and operation
US7908448B1 (en) 2007-01-30 2011-03-15 American Megatrends, Inc. Maintaining data consistency in mirrored cluster storage systems with write-back cache
US8140625B2 (en) 2007-02-20 2012-03-20 Nec Laboratories America, Inc. Method for operating a fixed prefix peer to peer network
US8370562B2 (en) 2007-02-25 2013-02-05 Sandisk Il Ltd. Interruptible cache flushing in flash memory systems
US9632870B2 (en) 2007-03-29 2017-04-25 Violin Memory, Inc. Memory system with multiple striping of raid groups and method for performing the same
JP4900811B2 (en) 2007-03-30 2012-03-21 株式会社日立製作所 Storage system and storage control method
JP4529990B2 (en) 2007-03-30 2010-08-25 ブラザー工業株式会社 Image processing program and image processing apparatus
US7975115B2 (en) 2007-04-11 2011-07-05 Dot Hill Systems Corporation Method and apparatus for separating snapshot preserved and write data
US9207876B2 (en) 2007-04-19 2015-12-08 Microsoft Technology Licensing, Llc Remove-on-delete technologies for solid state drive optimization
US8706914B2 (en) 2007-04-23 2014-04-22 David D. Duchesneau Computing infrastructure
US8086652B1 (en) 2007-04-27 2011-12-27 Netapp, Inc. Storage system-based hole punching for reclaiming unused space from a data container
US7958303B2 (en) 2007-04-27 2011-06-07 Gary Stephen Shuster Flexible data storage system
US7991942B2 (en) 2007-05-09 2011-08-02 Stmicroelectronics S.R.L. Memory block compaction method, circuit, and system in storage devices based on flash memories
US8819311B2 (en) 2007-05-23 2014-08-26 Rpx Corporation Universal user input/output application layers
JP5018880B2 (en) 2007-05-30 2012-09-05 富士通株式会社 Image encryption apparatus, image decryption apparatus, method, and program
US7765426B2 (en) 2007-06-07 2010-07-27 Micron Technology, Inc. Emerging bad block detection
WO2008152708A1 (en) 2007-06-13 2008-12-18 Fujitsu Limited Raid group converter, raid group conversion method, and raid group conversion program
US8051362B2 (en) 2007-06-15 2011-11-01 Microsoft Corporation Distributed data storage using erasure resilient coding
US8140719B2 (en) 2007-06-21 2012-03-20 Sea Micro, Inc. Dis-aggregated and distributed data-center architecture using a direct interconnect fabric
US20080320097A1 (en) 2007-06-22 2008-12-25 Tenoware R&D Limited Network distributed file system
US8874854B2 (en) 2007-07-30 2014-10-28 International Business Machines Corporation Method for selectively enabling and disabling read caching in a storage subsystem
JP2009037304A (en) 2007-07-31 2009-02-19 Hitachi Ltd Storage system with function of changing raid level
US7970919B1 (en) 2007-08-13 2011-06-28 Duran Paul A Apparatus and system for object-based storage solid-state drive and method for configuring same
US7565446B2 (en) 2007-08-27 2009-07-21 Gear Six, Inc. Method for efficient delivery of clustered data via adaptive TCP connection migration
US7991822B2 (en) 2007-08-29 2011-08-02 International Business Machines Corporation Propagation of updates for attributes of a storage object from an owner node of the storage object to other nodes
WO2009032712A2 (en) 2007-08-29 2009-03-12 Nirvanix, Inc. Method and system for moving requested files from one storage location to another
US8225006B1 (en) 2007-08-30 2012-07-17 Virident Systems, Inc. Methods for data redundancy across three or more storage devices
US7827439B2 (en) 2007-09-28 2010-11-02 Symantec Corporation System and method of redundantly storing and retrieving data with cooperating storage devices
US8661218B1 (en) 2007-10-18 2014-02-25 Datadirect Networks, Inc. Method for reducing latency in a solid-state memory system while maintaining data integrity
US7870105B2 (en) 2007-11-20 2011-01-11 Hitachi, Ltd. Methods and apparatus for deduplication in storage system
US20100268908A1 (en) 2007-11-22 2010-10-21 China Mobile Communications Corporation Data storage method, device and system and management server
KR20090082784A (en) 2008-01-28 2009-07-31 삼성전자주식회사 Flash memory device employing NVRAM cells
US8423739B2 (en) 2008-02-06 2013-04-16 International Business Machines Corporation Apparatus, system, and method for relocating logical array hot spots
US8161309B2 (en) 2008-02-19 2012-04-17 International Business Machines Corporation Apparatus, system, and method for controlling power sequence in a blade center environment
US7885938B1 (en) 2008-02-27 2011-02-08 Symantec Corporation Techniques for granular recovery of data from local and remote storage
US7970994B2 (en) 2008-03-04 2011-06-28 International Business Machines Corporation High performance disk array rebuild
US8352540B2 (en) 2008-03-06 2013-01-08 International Business Machines Corporation Distinguishing data streams to enhance data storage efficiency
JP4729062B2 (en) 2008-03-07 2011-07-20 株式会社東芝 Memory system
US7873619B1 (en) 2008-03-31 2011-01-18 Emc Corporation Managing metadata
US8621241B1 (en) 2008-04-25 2013-12-31 Netapp, Inc. Storage and recovery of cryptographic key identifiers
US8117464B1 (en) 2008-04-30 2012-02-14 Netapp, Inc. Sub-volume level security for deduplicated data
US8595248B2 (en) 2008-05-21 2013-11-26 Oracle International Corporation Querying a cascading index that avoids disk accesses
FR2931970B1 (en) 2008-05-27 2010-06-11 Bull Sas METHOD FOR GENERATING HANDLING REQUIREMENTS OF SERVER CLUSTER INITIALIZATION AND ADMINISTRATION DATABASE, DATA CARRIER AND CLUSTER OF CORRESPONDING SERVERS
US9678879B2 (en) 2008-05-29 2017-06-13 Red Hat, Inc. Set partitioning for encoding file system allocation metadata
EP2304568B1 (en) 2008-06-06 2013-08-14 Pivot3 Method and system for distributed raid implementation
US9323681B2 (en) 2008-09-18 2016-04-26 Avere Systems, Inc. File storage system, cache appliance, and method
US8706694B2 (en) 2008-07-15 2014-04-22 American Megatrends, Inc. Continuous data protection of files stored on a remote storage device
US20100125695A1 (en) 2008-11-15 2010-05-20 Nanostar Corporation Non-volatile memory storage system
US8108502B2 (en) 2008-07-24 2012-01-31 Symform, Inc. Storage device for use in a shared community storage network
TW201007574A (en) 2008-08-13 2010-02-16 Inventec Corp Internet server system and method of constructing and starting a virtual machine
US8296547B2 (en) 2008-08-27 2012-10-23 International Business Machines Corporation Loading entries into a TLB in hardware via indirect TLB entries
US20100057673A1 (en) 2008-09-04 2010-03-04 Boris Savov Reusable mapping rules for data to data transformation
US7992037B2 (en) 2008-09-11 2011-08-02 Nec Laboratories America, Inc. Scalable secondary storage systems and methods
US8351290B1 (en) 2008-09-12 2013-01-08 Marvell International Ltd. Erased page detection
US20100077205A1 (en) 2008-09-19 2010-03-25 Ekstrom Joseph J System and Method for Cipher E-Mail Protection
US8756369B2 (en) 2008-09-26 2014-06-17 Netapp, Inc. Priority command queues for low latency solid state drives
US8224782B2 (en) 2008-09-29 2012-07-17 Hitachi, Ltd. System and method for chunk based tiered storage volume migration
US8086634B2 (en) 2008-10-07 2011-12-27 Hitachi, Ltd. Method and apparatus for improving file access performance of distributed storage system
US7910688B2 (en) 2008-10-22 2011-03-22 Evonik Stockhausen Inc. Recycling superabsorbent polymer fines
US8086911B1 (en) 2008-10-29 2011-12-27 Netapp, Inc. Method and apparatus for distributed reconstruct in a raid system
JP4399021B1 (en) 2008-10-29 2010-01-13 株式会社東芝 Disk array control device and storage device
WO2010064328A1 (en) 2008-12-03 2010-06-10 Hitachi, Ltd. Information processing system and method of acquiring backup in an information processing system
US7945733B2 (en) 2008-12-12 2011-05-17 Lsi Corporation Hierarchical storage management (HSM) for redundant array of independent disks (RAID)
US8200922B2 (en) 2008-12-17 2012-06-12 Netapp, Inc. Storage system snapshot assisted by SSD technology
US20110258362A1 (en) 2008-12-19 2011-10-20 Mclaren Moray Redundant data storage for uniform read latency
US7941697B2 (en) 2008-12-30 2011-05-10 Symantec Operating Corporation Failure handling using overlay objects on a file system using object based storage devices
US8397016B2 (en) 2008-12-31 2013-03-12 Violin Memory, Inc. Efficient use of hybrid media in cache architectures
CA2689744C (en) 2009-01-08 2015-05-05 New Flyer Industries Canada Ulc System and method for monitoring operation of vehicles
US8412880B2 (en) 2009-01-08 2013-04-02 Micron Technology, Inc. Memory system controller to manage wear leveling across a plurality of storage nodes
US8312204B2 (en) 2009-01-23 2012-11-13 Seagate Technology Llc System and method for wear leveling in a data storage device
KR20110122169A (en) 2009-02-03 2011-11-09 비트토렌트, 인크. Distributed storage of recoverable data
US8145838B1 (en) 2009-03-10 2012-03-27 Netapp, Inc. Processing and distributing write logs of nodes of a cluster storage system
JP4869368B2 (en) 2009-03-12 2012-02-08 株式会社東芝 Storage device and virtualization device
US9271879B2 (en) 2009-03-13 2016-03-01 The Procter & Gamble Company Article having a seal and process for forming the same
US7941584B2 (en) 2009-03-26 2011-05-10 Arm Limited Data processing apparatus and method for performing hazard detection
US8205065B2 (en) 2009-03-30 2012-06-19 Exar Corporation System and method for data deduplication
US8560787B2 (en) 2009-03-30 2013-10-15 International Business Machines Corporation Incremental backup of source to target storage volume
US8117388B2 (en) 2009-04-30 2012-02-14 Netapp, Inc. Data distribution through capacity leveling in a striped file system
TWI397009B (en) 2009-04-30 2013-05-21 Inventec Corp Data processing apparatus of basic input/output system
US8180955B2 (en) 2009-05-06 2012-05-15 Via Telecom, Inc. Computing systems and methods for managing flash memory device
US20120158923A1 (en) 2009-05-29 2012-06-21 Ansari Mohamed System and method for allocating resources of a server to a virtual machine
US8903917B2 (en) 2009-06-03 2014-12-02 Novell, Inc. System and method for implementing a cluster token registry for business continuity
US8145840B2 (en) 2009-06-05 2012-03-27 Lsi Corporation Method and system for storing excess data in a redundant array of independent disk level 6
KR101626528B1 (en) 2009-06-19 2016-06-01 삼성전자주식회사 Flash memory device and data read method thereof
CN102782606B (en) 2009-06-19 2015-11-25 惠普开发有限公司 Enclosure power controller
TWI460588B (en) 2009-07-17 2014-11-11 Toshiba Kk Memory management device and memory information processing device
US8458287B2 (en) 2009-07-31 2013-06-04 Microsoft Corporation Erasure coded storage aggregation in data centers
US20110035540A1 (en) 2009-08-10 2011-02-10 Adtron, Inc. Flash blade system architecture and method
US7856528B1 (en) 2009-08-11 2010-12-21 Texas Memory Systems, Inc. Method and apparatus for protecting data using variable size page stripes in a FLASH-based storage system
KR101689420B1 (en) 2009-09-09 2016-12-23 샌디스크 테크놀로지스 엘엘씨 Apparatus, system, and method for power reduction management in a storage device
EP2302638B1 (en) 2009-09-21 2013-04-17 STMicroelectronics (Rousset) SAS Method for writing and reading data in a non-volatile memory, by means of metadata
US8706715B2 (en) 2009-10-05 2014-04-22 Salesforce.Com, Inc. Methods and systems for joining indexes for query optimization in a multi-tenant database
US20110119462A1 (en) 2009-11-19 2011-05-19 Ocz Technology Group, Inc. Method for restoring and maintaining solid-state drive performance
US8484259B1 (en) 2009-12-08 2013-07-09 Netapp, Inc. Metadata subsystem for a distributed object store in a network storage system
US8510569B2 (en) 2009-12-16 2013-08-13 Intel Corporation Providing integrity verification and attestation in a hidden execution environment
US8140821B1 (en) 2009-12-18 2012-03-20 Emc Corporation Efficient read/write algorithms and associated mapping for block-level data reduction processes
US9134918B2 (en) 2009-12-31 2015-09-15 Sandisk Technologies Inc. Physical compression of data with flat or systematic pattern
US8452932B2 (en) 2010-01-06 2013-05-28 Storsimple, Inc. System and method for efficiently creating off-site data volume back-ups
WO2011104663A1 (en) 2010-02-23 2011-09-01 Confidato Security Solutions Ltd Method and computer program product for order preserving symbol based encryption
US8756387B2 (en) 2010-03-05 2014-06-17 International Business Machines Corporation Method and apparatus for optimizing the performance of a storage system
JP4892072B2 (en) 2010-03-24 2012-03-07 株式会社東芝 Storage device that eliminates duplicate data in cooperation with host device, storage system including the storage device, and deduplication method in the system
US8627138B1 (en) 2010-03-26 2014-01-07 Emc Corporation Data protection system and method
US8856593B2 (en) 2010-04-12 2014-10-07 Sandisk Enterprise Ip Llc Failure recovery using consensus replication in a distributed flash memory system
US9183134B2 (en) 2010-04-22 2015-11-10 Seagate Technology Llc Data segregation in a storage device
US8239618B2 (en) 2010-05-27 2012-08-07 Dell Products L.P. System and method for emulating preconditioning of solid-state device
JP5521794B2 (en) 2010-06-03 2014-06-18 株式会社バッファロー Storage device and control program thereof
US9552299B2 (en) 2010-06-11 2017-01-24 California Institute Of Technology Systems and methods for rapid processing and storage of data
US8738970B2 (en) 2010-07-23 2014-05-27 Salesforce.Com, Inc. Generating performance alerts
US8713268B2 (en) 2010-08-05 2014-04-29 Ut-Battelle, Llc Coordinated garbage collection for raid array of solid state disks
US9818478B2 (en) 2012-12-07 2017-11-14 Attopsemi Technology Co., Ltd Programmable resistive device and memory using diode as selector
US8904226B2 (en) 2010-08-26 2014-12-02 Cleversafe, Inc. Migrating stored copies of a file to stored encoded data slices
US8473778B2 (en) 2010-09-08 2013-06-25 Microsoft Corporation Erasure coding immutable data
US8589625B2 (en) 2010-09-15 2013-11-19 Pure Storage, Inc. Scheduling of reconstructive I/O read operations in a storage environment
US8468318B2 (en) 2010-09-15 2013-06-18 Pure Storage Inc. Scheduling of I/O writes in a storage environment
US9009724B2 (en) 2010-09-24 2015-04-14 Hewlett-Packard Development Company, L.P. Load balancing data access in virtualized storage nodes
US8775868B2 (en) 2010-09-28 2014-07-08 Pure Storage, Inc. Adaptive RAID for an SSD environment
US8327080B1 (en) 2010-09-28 2012-12-04 Emc Corporation Write-back cache protection
US11232022B2 (en) 2010-10-29 2022-01-25 Samsung Electronics Co., Ltd. Memory system, data storage device, user device and data management method thereof having a data management information matching determination
US20120117029A1 (en) 2010-11-08 2012-05-10 Stephen Gold Backup policies for using different storage tiers
US8949502B2 (en) 2010-11-18 2015-02-03 Nimble Storage, Inc. PCIe NVRAM card based on NVDIMM
US9020900B2 (en) 2010-12-14 2015-04-28 Commvault Systems, Inc. Distributed deduplicated storage system
US8484163B1 (en) 2010-12-16 2013-07-09 Netapp, Inc. Cluster configuration backup and recovery
US8627136B2 (en) 2010-12-27 2014-01-07 Netapp Inc. Non-disruptive failover of RDMA connection
WO2012106362A2 (en) 2011-01-31 2012-08-09 Fusion-Io, Inc. Apparatus, system, and method for managing eviction of data
US20120198152A1 (en) 2011-02-01 2012-08-02 Drobo, Inc. System, apparatus, and method supporting asymmetrical block-level redundant storage
KR101502896B1 (en) 2011-02-14 2015-03-24 주식회사 케이티 Distributed memory cluster control apparatus and method using map reduce
US20120226934A1 (en) 2011-03-01 2012-09-06 Rao G R Mohan Mission critical nand flash
US20120233416A1 (en) 2011-03-08 2012-09-13 International Business Machines Corporation Multi-target, point-in-time-copy architecture with data deduplication
US9563555B2 (en) 2011-03-18 2017-02-07 Sandisk Technologies Llc Systems and methods for storage allocation
US9021215B2 (en) 2011-03-21 2015-04-28 Apple Inc. Storage system exporting internal storage rules
US8725730B2 (en) 2011-05-23 2014-05-13 Hewlett-Packard Development Company, L.P. Responding to a query in a data processing system
US8544029B2 (en) 2011-05-24 2013-09-24 International Business Machines Corporation Implementing storage adapter performance optimization with chained hardware operations minimizing hardware/firmware interactions
US8656253B2 (en) 2011-06-06 2014-02-18 Cleversafe, Inc. Storing portions of data in a dispersed storage network
WO2012174427A2 (en) 2011-06-16 2012-12-20 OneID Inc. Method and system for determining authentication levels in transactions
US8595267B2 (en) 2011-06-27 2013-11-26 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US8751463B1 (en) 2011-06-30 2014-06-10 Emc Corporation Capacity forecasting for a deduplicating storage system
US8930714B2 (en) 2011-07-19 2015-01-06 Elwha Llc Encrypted memory
US9575903B2 (en) 2011-08-04 2017-02-21 Elwha Llc Security perimeter
US8788788B2 (en) 2011-08-11 2014-07-22 Pure Storage, Inc. Logical sector mapping in a flash storage array
US8930307B2 (en) 2011-09-30 2015-01-06 Pure Storage, Inc. Method for removing duplicate data from a storage array
US8527544B1 (en) 2011-08-11 2013-09-03 Pure Storage Inc. Garbage collection in a storage system
US8806160B2 (en) 2011-08-16 2014-08-12 Pure Storage, Inc. Mapping in a storage system
US8793467B2 (en) 2011-09-30 2014-07-29 Pure Storage, Inc. Variable length encoding in a storage system
WO2013025540A1 (en) 2011-08-12 2013-02-21 Sandisk Enterprise Ip Llc Cache management including solid state device virtualization
JP5768587B2 (en) 2011-08-17 2015-08-26 富士通株式会社 Storage system, storage control device, and storage control method
US8832035B2 (en) 2011-08-30 2014-09-09 Netapp, Inc. System and method for retaining deduplication in a storage object after a clone split operation
US8990171B2 (en) 2011-09-01 2015-03-24 Microsoft Corporation Optimization of a partially deduplicated file
US8769138B2 (en) 2011-09-02 2014-07-01 Compuverde Ab Method for data retrieval from a distributed data storage system
US9021053B2 (en) 2011-09-02 2015-04-28 Compuverde Ab Method and device for writing data to a data storage system comprising a plurality of data storage nodes
US8886910B2 (en) 2011-09-12 2014-11-11 Microsoft Corporation Storage device drivers and cluster participation
US8959110B2 (en) 2011-09-18 2015-02-17 Microsoft Technology Licensing, Llc Dynamic query for external data connections
US8862928B2 (en) 2011-09-20 2014-10-14 Cloudbyte, Inc. Techniques for achieving high availability with multi-tenant storage when a partial fault occurs or when more than two complete faults occur
US8700875B1 (en) 2011-09-20 2014-04-15 Netapp, Inc. Cluster view for storage devices
US20130173853A1 (en) 2011-09-26 2013-07-04 Nec Laboratories America, Inc. Memory-efficient caching methods and systems
US9578014B2 (en) 2011-09-29 2017-02-21 Oracle International Corporation Service profile-specific token attributes and resource server token attribute overriding
JP5735654B2 (en) 2011-10-06 2015-06-17 株式会社日立製作所 Deduplication method for stored data, deduplication apparatus for stored data, and deduplication program
US8825605B2 (en) 2011-10-11 2014-09-02 Netapp, Inc. Deduplication aware scheduling of requests to access data blocks
US8990495B2 (en) 2011-11-15 2015-03-24 Emc Corporation Method and system for storing data in raid memory devices
US8713405B2 (en) 2011-11-22 2014-04-29 Simplivity Corporation Method and apparatus for allocating erasure coded data to disk storage
JP5923964B2 (en) 2011-12-13 2016-05-25 富士通株式会社 Disk array device, control device, and program
US8788913B1 (en) 2011-12-30 2014-07-22 Emc Corporation Selection of erasure code parameters for no data repair
US8918579B2 (en) 2012-02-06 2014-12-23 Sandisk Technologies Inc. Storage device and method for selective data compression
US9405478B2 (en) 2012-02-08 2016-08-02 Hitachi, Ltd. Storage apparatus provided with a plurality of nonvolatile semiconductor storage media and storage control method
US8819383B1 (en) 2012-02-17 2014-08-26 Netapp, Inc. Non-disruptive realignment of virtual data
US8856619B1 (en) 2012-03-09 2014-10-07 Google Inc. Storing data across groups of storage nodes
EP2639997B1 (en) 2012-03-15 2014-09-03 ATS Group (IP Holdings) Limited Method and system for secure access of a first computer to a second computer
US9008316B2 (en) 2012-03-29 2015-04-14 Microsoft Technology Licensing, Llc Role-based distributed key management
US9043540B2 (en) 2012-03-30 2015-05-26 Netapp, Inc. Systems and methods for tracking block ownership
US9323667B2 (en) 2012-04-12 2016-04-26 Violin Memory Inc. System and method for managing trim operations in a flash memory system using mapping tables and block status tables
US9075710B2 (en) 2012-04-17 2015-07-07 SanDisk Technologies, Inc. Non-volatile key-value store
US9519647B2 (en) 2012-04-17 2016-12-13 Sandisk Technologies Llc Data expiry in a non-volatile device
US8996881B2 (en) 2012-04-23 2015-03-31 International Business Machines Corporation Preserving redundancy in data deduplication systems by encryption
US8793466B2 (en) 2012-04-27 2014-07-29 Netapp, Inc. Efficient data object storage and retrieval
EP2660723A1 (en) 2012-05-03 2013-11-06 Thomson Licensing Method of data storing and maintenance in a distributed data storage system and corresponding device
US9645177B2 (en) 2012-05-04 2017-05-09 Seagate Technology Llc Retention-drift-history-based non-volatile memory read threshold optimization
US8874850B1 (en) 2012-05-10 2014-10-28 Netapp, Inc. Hierarchically tagged cache
US20130318314A1 (en) 2012-05-25 2013-11-28 Red Hat, Inc. Managing copies of data on multiple nodes using a data controller node to avoid transaction deadlock
US8762353B2 (en) 2012-06-13 2014-06-24 Caringo, Inc. Elimination of duplicate objects in storage clusters
US8799746B2 (en) 2012-06-13 2014-08-05 Caringo, Inc. Erasure coding and replication in storage clusters
US8930633B2 (en) 2012-06-14 2015-01-06 International Business Machines Corporation Reducing read latency using a pool of processing cores
CN104769555A (en) 2012-06-18 2015-07-08 艾克特菲欧有限公司 Enhanced data management virtualization system
US9053808B2 (en) 2012-06-21 2015-06-09 Sandisk Technologies Inc. Flash memory with targeted read scrub algorithm
US8850288B1 (en) 2012-06-27 2014-09-30 Amazon Technologies, Inc. Throughput-sensitive redundancy encoding schemes for data storage
US8959305B1 (en) 2012-06-29 2015-02-17 Emc Corporation Space reclamation with virtually provisioned devices
KR102003930B1 (en) 2012-07-31 2019-07-25 삼성전자주식회사 method of controlling data writing in non volatile memory device and memory controller having wearleveling control function
US9189650B2 (en) 2012-07-31 2015-11-17 J.D. Power And Associates Privacy preserving method for summarizing user data
CN103577274B (en) 2012-07-31 2016-07-06 国际商业机器公司 The method and apparatus of management memory array
KR102028128B1 (en) 2012-08-07 2019-10-02 삼성전자주식회사 Operating method of memory system including nonvolatile random access memory and nand flash memory
US8904231B2 (en) 2012-08-08 2014-12-02 Netapp, Inc. Synchronous local and cross-site failover in clustered storage systems
US9489293B2 (en) 2012-08-17 2016-11-08 Netapp, Inc. Techniques for opportunistic data storage
US9122401B2 (en) 2012-08-23 2015-09-01 Apple Inc. Efficient enforcement of command execution order in solid state drives
US8929066B2 (en) 2012-08-28 2015-01-06 Skyera, Inc. Chassis with separate thermal chamber for solid state memory
US9778856B2 (en) 2012-08-30 2017-10-03 Microsoft Technology Licensing, Llc Block-level access to parallel storage
US9154298B2 (en) 2012-08-31 2015-10-06 Cleversafe, Inc. Securely storing data in a dispersed storage network
US9613656B2 (en) 2012-09-04 2017-04-04 Seagate Technology Llc Scalable storage protection
US8887011B2 (en) 2012-09-13 2014-11-11 Sandisk Technologies Inc. Erased page confirmation in multilevel memory
JP5954081B2 (en) 2012-09-26 2016-07-20 富士通株式会社 Storage control device, storage control method, and storage control program
US9348757B2 (en) 2012-10-08 2016-05-24 International Business Machines Corporation System supporting multiple partitions with differing translation formats
US9116819B2 (en) 2012-10-17 2015-08-25 Datadirect Networks, Inc. Reducing metadata in a write-anywhere storage system
US9348538B2 (en) 2012-10-18 2016-05-24 Netapp, Inc. Selective deduplication
US9176858B2 (en) 2012-11-19 2015-11-03 Hitachi, Ltd. Storage system configured to selectively utilize data compression based on real pool usage rates
KR20140072637A (en) 2012-12-05 2014-06-13 삼성전자주식회사 method for operating non-volatile memory device and memory controller
US9348840B2 (en) 2012-12-14 2016-05-24 Intel Corporation Adaptive data striping and replication across multiple storage clouds for high availability and performance
US20140181402A1 (en) 2012-12-21 2014-06-26 Advanced Micro Devices, Inc. Selective cache memory write-back and replacement policies
US9134908B2 (en) 2013-01-09 2015-09-15 Apple Inc. Logical volume space sharing
US9436720B2 (en) 2013-01-10 2016-09-06 Pure Storage, Inc. Safety for volume operations
US9886346B2 (en) 2013-01-11 2018-02-06 Commvault Systems, Inc. Single snapshot for multiple agents
US9652376B2 (en) 2013-01-28 2017-05-16 Radian Memory Systems, Inc. Cooperative flash memory control
US8862847B2 (en) 2013-02-08 2014-10-14 Huawei Technologies Co., Ltd. Distributed storage method, apparatus, and system for reducing a data loss that may result from a single-point failure
US20140237164A1 (en) 2013-02-19 2014-08-21 Kabushiki Kaisha Toshiba Hybrid drive that implements a deferred trim list
US8824261B1 (en) 2013-03-07 2014-09-02 Seagate Technology Llc Peer to peer vibration mitigation
US9201733B2 (en) 2013-03-13 2015-12-01 Futurewei Technologies, Inc. Systems and methods for data repair
US9335932B2 (en) 2013-03-15 2016-05-10 Bracket Computing, Inc. Storage unit selection for virtualized storage units
US9025393B2 (en) 2013-03-25 2015-05-05 Seagate Technology Llc Method of optimizing solid state drive soft retry voltages
US9519575B2 (en) 2013-04-25 2016-12-13 Sandisk Technologies Llc Conditional iteration for a non-volatile device
JP5953573B2 (en) 2013-05-02 2016-07-20 ▲ホア▼▲ウェイ▼技術有限公司Huawei Technologies Co.,Ltd. Computer system, method and apparatus for accessing a peripheral component interconnect express endpoint device
US9244761B2 (en) 2013-06-25 2016-01-26 Microsoft Technology Licensing, Llc Erasure coding across multiple zones and sub-zones
US9378084B2 (en) 2013-06-25 2016-06-28 Microsoft Technology Licensing, Llc Erasure coding across multiple zones
US20150032720A1 (en) 2013-07-23 2015-01-29 Yahoo! Inc. Optimizing database queries
US20150039645A1 (en) 2013-08-02 2015-02-05 Formation Data Systems, Inc. High-Performance Distributed Data Storage System with Implicit Content Routing and Data Deduplication
US20150039849A1 (en) 2013-08-02 2015-02-05 Formation Data Systems, Inc. Multi-Layer Data Storage Virtualization Using a Consistent Data Reference Model
US9431113B2 (en) * 2013-08-07 2016-08-30 Sandisk Technologies Llc Data storage system with dynamic erase block grouping mechanism and method of operation thereof
US9465735B2 (en) 2013-10-03 2016-10-11 Qualcomm Incorporated System and method for uniform interleaving of data across a multiple-channel memory architecture with asymmetric storage capacity
US10263770B2 (en) 2013-11-06 2019-04-16 Pure Storage, Inc. Data protection in a storage system using external secrets
US9516016B2 (en) 2013-11-11 2016-12-06 Pure Storage, Inc. Storage array password management
US9553822B2 (en) 2013-11-12 2017-01-24 Microsoft Technology Licensing, Llc Constructing virtual motherboards and virtual storage devices
US8843700B1 (en) 2013-11-29 2014-09-23 NXGN Data, Inc. Power efficient method for cold storage data retention management
US9582058B2 (en) 2013-11-29 2017-02-28 Sandisk Technologies Llc Power inrush management of storage devices
US9667496B2 (en) 2013-12-24 2017-05-30 International Business Machines Corporation Configuration updates across peer storage systems
US9251064B2 (en) 2014-01-08 2016-02-02 Netapp, Inc. NVRAM caching and logging in a storage system
JP6233086B2 (en) 2014-02-20 2017-11-22 富士通株式会社 Storage control device, storage system, and control program
US10169121B2 (en) 2014-02-27 2019-01-01 Commvault Systems, Inc. Work flow management for an information management system
US10656864B2 (en) 2014-03-20 2020-05-19 Pure Storage, Inc. Data replication within a flash storage array
US9361469B2 (en) 2014-03-26 2016-06-07 Amazon Technologies, Inc. Electronic communication with secure screen sharing of sensitive information
US10264071B2 (en) 2014-03-31 2019-04-16 Amazon Technologies, Inc. Session management in distributed storage systems
US9829066B2 (en) 2014-04-07 2017-11-28 Gates Corporation Electrically conductive power transmission belt
US9513820B1 (en) 2014-04-07 2016-12-06 Pure Storage, Inc. Dynamically controlling temporary compromise on data redundancy
US9003144B1 (en) 2014-06-04 2015-04-07 Pure Storage, Inc. Mechanism for persisting messages in a storage system
US8850108B1 (en) 2014-06-04 2014-09-30 Pure Storage, Inc. Storage cluster
US8868825B1 (en) 2014-07-02 2014-10-21 Pure Storage, Inc. Nonrepeating identifiers in an address space of a non-volatile solid-state storage
US8874836B1 (en) 2014-07-03 2014-10-28 Pure Storage, Inc. Scheduling policy for queues in a non-volatile solid-state storage
JP6483966B2 (en) 2014-07-04 2019-03-13 キヤノン株式会社 Image reading apparatus, system including image reading apparatus, method executed by image reading apparatus, and program
US9563509B2 (en) 2014-07-15 2017-02-07 Nimble Storage, Inc. Methods and systems for storing data in a redundant manner on a plurality of storage units of a storage system
US10430282B2 (en) 2014-10-07 2019-10-01 Pure Storage, Inc. Optimizing replication by distinguishing user and system write activity
US9489132B2 (en) 2014-10-07 2016-11-08 Pure Storage, Inc. Utilizing unmapped and unknown states in a replicated storage system
US9552248B2 (en) 2014-12-11 2017-01-24 Pure Storage, Inc. Cloud alert to replica
US9606734B2 (en) * 2014-12-22 2017-03-28 International Business Machines Corporation Two-level hierarchical log structured array architecture using coordinated garbage collection for flash arrays
US9384082B1 (en) 2015-10-23 2016-07-05 Pure Storage, Inc. Proactively providing corrective measures for storage arrays
US11024390B1 (en) * 2017-10-31 2021-06-01 Pure Storage, Inc. Overlapping RAID groups

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220278927A1 (en) * 2021-03-01 2022-09-01 Juniper Networks, Inc. Data interfaces with isolation for containers deployed to compute nodes

Also Published As

Publication number Publication date
US11494109B1 (en) 2022-11-08

Similar Documents

Publication Publication Date Title
US11354058B2 (en) Local relocation of data stored at a storage device of a storage system
US10990480B1 (en) Performance of RAID rebuild operations by a storage group controller of a storage system
US11714572B2 (en) Optimized data resiliency in a modular storage system
US11194473B1 (en) Programming frequently read data to low latency portions of a solid-state storage array
US20200327953A1 (en) Adaptive threshold for bad flash memory blocks
US11194759B2 (en) Optimizing local data relocation operations of a storage device of a storage system
US11868636B2 (en) Prioritizing garbage collection based on the extent to which data is deduplicated
US11899582B2 (en) Efficient memory dump
US10976947B2 (en) Dynamically selecting segment heights in a heterogeneous RAID group
US11221778B1 (en) Preparing data for deduplication
US20230022758A1 (en) Garbage collection for heterogenous flash memory storage devices
US11775491B2 (en) Machine learning model for storage system
US11847013B2 (en) Readable data determination
US20240004568A1 (en) Striping data across erase blocks having differing sizes
US20230074930A1 (en) Tuning storage devices
US11868309B2 (en) Queue management for data relocation
US11656961B2 (en) Deallocation within a storage system
US11334254B2 (en) Reliability based flash page sizing
US20240020230A1 (en) Intelligent subsegment formation in a heterogeneous storage system

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION