Logic module for use with encoded instructions

Information

  • Patent Grant
  • 11971828
  • Patent Number
    11,971,828
  • Date Filed
    Thursday, November 19, 2020
    4 years ago
  • Date Issued
    Tuesday, April 30, 2024
    7 months ago
Abstract
A method for hardware assisted data lookup in a storage unit is provided. The method includes formatting data in at least one of a plurality of data formats for storage in the storage unit. The method includes configuring a logic unit with one or more parameters associated with the plurality of data formats and identifying incoming data with the one or more parameters as an instruction for execution.
Description
BACKGROUND

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


It is within this context that the embodiments arise.


SUMMARY

In some embodiments, a method for hardware assisted data lookup in a storage unit is provided. The method includes formatting data in at least one of a plurality of data formats for storage in the storage unit. The method includes configuring a logic unit with one or more parameters associated with the plurality of data formats and identifying incoming data with the one or more parameters as an instruction for execution.


In some embodiments, a storage cluster is provided. The storage cluster includes a plurality of storage nodes, coupled together as the storage cluster and a plurality of storage units, each having storage memory. At least one of the plurality of storage units has a data layout engine and a logic module, the data layout engine is operable to configure the logic module with one or more parameters associated with a plurality of data formats and wherein the logic module identifies incoming data, with the one or more parameters, as an instruction for execution.


In some embodiments, a storage unit that communicates with a plurality of storage nodes of a storage cluster is provided. The storage unit includes a logic module having a state machine and one or more registers or counters. The logic unit includes a data layout engine configured to write one or more parameters to the one or more registers or counters of the logic module to enable the logic module to parse data associated with at least one data format of a plurality of data formats. The logic module is configured to identify incoming data, with the one or more parameters, as an instruction for execution.


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





BRIEF DESCRIPTION OF THE DRAWINGS

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



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



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



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



FIG. 4 depicts a host interface, a data layout engine and error correcting code logic of a storage unit, interacting with a page of storage memory in accordance with some embodiments.



FIG. 5 is an example logical layout of a page of storage memory, with a header and logical records in accordance with some embodiments.



FIG. 6 is an example of a page of storage memory, with a header, and metadata that has an instruction and a parameter encoded in the metadata in accordance with some embodiments.



FIG. 7 is a block diagram of a storage unit with an embodiment of the data layout engine of FIG. 4, which can determine an action for the storage unit to perform based on the instruction in the metadata as shown in FIG. 6 in accordance with some embodiments.



FIG. 8 is a block diagram of a storage unit with a further embodiment of the data layout engine and a logic module, which determines and performs actions based on contents of the metadata of a page as shown in FIG. 6 in accordance with some embodiments.



FIG. 9 is a flow diagram of a method for hardware assisted data lookup in a storage unit, which can be performed by a storage unit or more specifically by a data layout engine and a logic module in a storage unit in accordance with some embodiments.



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





DETAILED DESCRIPTION

A storage cluster with storage nodes and storage units with storage memory is herein described. One or more of the storage units, and in some embodiments, each of the storage units, has a data layout engine and a logic module that can find an instruction encoded explicitly or implicitly into metadata in a page in storage memory. The storage unit performs an action based on the instruction, such as returning data from the same page or another page of the storage memory, reading another page and determining an action, or searching in the same page or another page. A storage node can pass a parameter to the storage unit, by encoding the instruction into the metadata in the page of storage memory. The data layout engine can pass a parameter to the logic module by writing to a register or counter of the logic module, and thereby communicate information about formatting of storage memory and explicit or implicit instructions. The logic module monitors data flow from storage memory to buffer memory, and, based on this and the information communicated by the data layout engine, determines an instruction and corresponding action. The storage cluster, storage nodes and storage units are described below with reference to FIGS. 1-3. Embodiments of the data layout engine and the logic module are described below with reference to FIGS. 4-9.


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


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


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


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



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


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


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



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


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


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


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



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


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



FIG. 4 depicts a host interface 402, a data layout engine 404 and error correcting code logic 406 of a storage unit 152, interacting with a page 224 of storage memory. Aspects of organization of pages 224 are discussed below with reference to FIGS. 4-6, and this is followed by an embodiment of the data layout engine 404 in FIG. 7. The data layout engine 404 is a component in a storage unit 152 (see FIGS. 1-3), and can be implemented using software, firmware, hardware or combinations thereof. The host interface 402 couples the storage unit 152 to one or more storage nodes 150 in a storage cluster 160. For example, the host interface 402 could include a bus coupling or a network coupling. In the embodiment shown, the data layout engine 404 sits in a path between error correcting code logic 406 and the host interface 402. Each page 224 of storage memory is organized into multiple error correcting code codewords 408. Error correcting code logic 406 acts on an error correcting code codeword 408, performing error correction to the codeword 408 in a conventional manner. The data layout engine 404 receives a corrected codeword 408, and determines where to find an instruction, and optionally a parameter, as will be further described below. The instruction 604 directs the storage unit 152 to perform an action.



FIG. 5 is an example logical layout of a page 224 of storage memory, with a header 502 and logical records 504. The header 502 contains information pointing to logical records 504, such as an identifier of a logical record, shown in the example as the letter “x”, and starting and ending addresses (e.g., 1025, 2036 as shown in the example) of the logical record 504. The shaded area in the page 224 represents erased blocks which do not yet contain logical records 504. Generally, to read client datum “x” (e.g., a piece of data, one or more bits), the storage unit reads the page header 502, determines the location of the client datum, and reads the client datum from the determined location.



FIG. 6 is an example of a page 224 of storage memory, with a header 502, and metadata 602 that has an instruction 604 and a parameter 606 encoded in the metadata 602. In some embodiments, in order for the data layout engine 404 to find the instruction 604, the data layout engine 404 reads the header 502. The header 502 has information about where to find data or metadata in this or another page 224. In further embodiments, information about where to find data or metadata could be elsewhere on the page 224, and the data layout engine 404 would be designed accordingly. Once the data layout engine 404 obtains the location information from the header 502 (or elsewhere on the page 224), the data layout engine 404 reads the metadata 602 according to that location information. Next, the data layout engine 404 finds the instruction 604 in the metadata 602. In some embodiments, an instruction 604 can be accompanied by a parameter 606. The data layout engine 404 determines whether the instruction 604 is accompanied by a parameter, in such embodiments, and obtains the parameter 606 from the metadata 602 where appropriate.


As examples of instructions 604 and associated actions, the instruction 604 could direct the storage unit 152 to return data from the page 224, or return data from another page 224. If the data is to be returned from another page, the parameter 606 could direct where to find that other page 224 and that data, e.g., by providing an address and/or other location information. The instruction 604 could direct to read another page 224 and determine an action, e.g., by finding another instruction 604 on that page 224. The instruction 604 could direct to search on the page 224, e.g., according to the parameter 606. The instruction 604 could direct to search on another page 224. This process can be nested, in some embodiments, so that an instruction 604 on one page 224 can lead to an instruction 604 on another page 224, which could lead to yet another instruction 604 on yet another page 224, and so on. Searches so directed could be confined to one page 224, or could cross page boundaries. Data returns so directed could be confined to one page 224, or could cross page boundaries. Results of the actions are returned via the host interface 402 (see FIG. 4) to a storage node 150.



FIG. 7 is a block diagram of a storage unit 152 with an embodiment of the data layout engine 404 of FIG. 4, which can determine an action for the storage unit 152 to perform based on the instruction 604 in the metadata 602 as shown in FIG. 6. The storage unit 152 has the data layout engine 404, and the storage memory 714 organized as pages 224. In order to access pages 224 of the storage memory 714, the data layout engine 404 is coupled to the storage memory 714, for example by a bus. In some embodiments, this bus width is greater than the width of the host interface 402 (see FIG. 4) so that a page 204 can be read efficiently into the data access module 716, without causing a bottleneck in comparison with data flow across the host interface 402. In the data layout engine 404, a control unit 702 coordinates interactions among a data access module 716, an inspection unit 704, and the storage memory 714 in some embodiments. An error correcting code unit 712 in the data access module 716 includes error correcting code logic 406 (see FIG. 4) and performs error correction on codewords 408 of a page 224 of storage memory 714, as described above with reference to FIG. 4. An encryption/decryption module 710 in the data access module 716 performs encryption (for data writes) and decryption (for data reads) to the error correcting code codewords 408, in some embodiments.


A page unit 708 in the inspection unit 704 receives an error corrected page 224 from the data access module 716, decrypted, if appropriate, by the encryption/decryption module 710. A header unit 706 in the inspection unit 704 extracts or analyzes the header 502 from the page 224. From information in the header 502, the inspection unit 704 determines the location of the metadata 602 in the page 224, and determines the location of the instruction 604 and the optional parameter 606 in the metadata 602. From this determination, the data layout engine 404 determines the instruction 604 and, where appropriate, the optional parameter 606. Based on the instruction 604, the data layout engine 404 determines an action and performs that action, as described above. The control unit 702 guides the access to the page 224 and any further page 224 directed by the instruction 604.


With reference to FIGS. 4-7, the following scenarios illustrate utilization of this hardware assisted data lookup feature. A storage node 150 encodes an instruction 604 in metadata 602 of a page 224, and passes this page 224 to a storage unit 152 to write into storage memory 714. At a later time, the storage unit 152 reads the page 224 from the storage memory 714 of the storage unit 152. The control unit 702 coordinates reading the page 224 from storage memory 714, and performing error correction using the error correcting code unit 712 of the data access module 716. If the page 224 is encrypted, the control unit 702 coordinates the encryption/decryption module 710 of the data access module 716 to decrypt the page 224. The error correcting code unit 712 or the encryption/decryption module 710 passes the page 224 to the page unit 708 of the inspection unit 704. The control unit 702 coordinates the page unit 708 to cooperate with the header unit 706 and extract information from the header 502, pointing to the metadata 602 and the instruction 604. The inspection unit 704 extracts the instruction 604 from the metadata 602 and determines whether a parameter 606 accompanies the instruction 604. In the case that there is an accompanying parameter 606, the inspection unit 704 extracts the parameter 606 from the metadata 602. Next, the control unit 702 coordinates with the inspection unit 704 to determine an action, based on the instruction 604 and, if appropriate, based also on the parameter 606. If the action is to return data from the page 224, the control unit 702 coordinates with the page unit 708 to obtain the data from the page 224, and pass the data via the host interface 402 to the storage node 150. If the action is to return data from another page, the control unit 702 coordinates with the data access module 716 to read another page 224 from the storage memory 714, perform error correction and data extraction as above from this further page 224, and pass the data via the host interface 402 to the storage node 150. If the action is to read another page and determine an action there, the control unit 702 coordinates with the data access module 716 to read that page 224, and coordinates with the inspection unit 704 to obtain the instruction 604 from that other page 224, as described above. If the action is to search in the page 224, the control unit 702 coordinates with the inspection unit 704 to obtain a search parameter 606 and search in the page 224 as loaded into the page unit 708. If the action is to search in another page 224, the control unit 702 coordinates with the data access module 716 to read that page 224, and coordinates with the inspection unit 704 to search in that page 224 as loaded into the page unit 708. Processes given in these scenarios can be nested and iterative. Further instructions 604, actions, and scenarios involving one or more pages 224 of storage memory 714 as processed by the data layout engine 404 are readily devised. It should be appreciated that FIGS. 4-7 illustrate examples of data formats for illustrative purposes and are not meant to be limiting. The embodiments may integrate multiple data formats and are not meant to be limited to the data formats illustrated as the data layout engine may be utilized to configure a logic module to handle any suitable data format.



FIG. 8 is a block diagram of a storage unit 152 with a further embodiment of the data layout engine 404 and a logic module 802, which determines and performs actions based on contents of the metadata 602 of a page 224 as shown in FIG. 6 or other data formats. In some embodiments, the logic module 802 contains entirely logic hardware and no processor. Contents of one embodiment of the logic module 802 are shown to the right and below the logic module 802 in FIG. 8. The data layout engine 404 includes a software module executing on a processor of the storage unit 152 (e.g., the controller 212 in FIG. 3), firmware and/or hardware, in various combinations in various embodiments. The logic module 802 sits in a path between the ECC logic 406 and the DRAM 216, and monitors the data (e.g. in bytes or words) passing from storage memory 714 to DRAM 216 or other local memory acting as a buffer. Data from the storage memory 214 is error corrected, by the ECC logic 416, on the way to the DRAM 216, and may also have further formatting as described previously. Other processes of the storage unit 152 read data from the DRAM 216 or other local memory and perform further actions to prepare the data for return as metadata or user data as appropriate. As described above with reference to FIG. 6, some of the data in the storage memory 714 has parameters and/or instructions, which may be explicit or implicit, and the logic module 802 finds those parameters or instructions and determines a next action.


The data layout engine 404 is what determines what the data should be, what parameters and/or instructions are embedded in the data in the storage memory 714, and where the parameters and/or instructions are embedded (e.g., at what addresses in which pages 224 of the storage memory 714). In some embodiments, the logic module 802 can be considered a slave of the data layout engine 404, and the logic module 802 parses the data from the storage memory 714 in accordance with the format set up by the data layout engine 404. In some embodiments the data is transmitted from the storage unit in response to a request. To support this relationship, the data layout engine 404 communicates to the logic module 802 formatting information regarding expected contents of the pages 204 of the storage memory 714. In the embodiment depicted in FIG. 8, the logic module 802 includes one or more registers 804, one or more counters 806, match logic 810 and one or more state machines 808. The data layout engine 404 writes parameters to the registers 804, such as data to watch for, addresses, page numbers, etc. One of the counters 806 could be initialized to count pages 224, and/or another one of the counters 806 could be initialized to count bytes or words of a page 224, for example. The match logic 810 could use comparators, exclusive or (XOR) gates, AND or NAND gate logic, etc., to match contents of a register 804 to a byte or word flowing by from the storage memory 714 and ECC logic 406 to the DRAM 216. In some embodiments, the match logic 810 could match an address, or match a counter value. Decisions are performed by the state machine 808, which watches for data at a particular page and/or a particular address, or a match to an instruction or parameter or counter value, for example. In some embodiments, the state machine 808 performs the matching or identifying, and thus the match logic 810 is incorporated into the state machine 808. A counter 806 could determine position in a stream of bytes or whichever size data emerges from the storage memory 714 and ECC logic 406, e.g. by counting starting at the beginning of a flash page 224 or other portion of storage memory 714. A counter 806 could determine the size of a slice of data that comes in, so that the state machine 808 can direct capture of that slice of data. When the state machine 808 determines or identifies an instruction (whether explicit or implicit), the state machine 808 determines which of a number of possible actions to perform next.


For example, the instruction could be an explicit embedded instruction (like an opcode), or an implicit instruction determined from matching a parameter or matching an address of a page 224. The action could be to interpret a parameter, or to perform another read of another piece of data or another page 224. Processes could include repeating or recursive actions, e.g., one read could lead to another read which could lead to another read. In some embodiments, the hardware of the logic module 802 could alert software executing on a processor of the storage unit 152 to perform one or more actions, for example by having the state machine 808 write a parameter or value to a register 804, which is accessed by the data layout engine 404 or a processor of the storage unit 152. In some embodiments, one or more of the registers 804 is in the form of a queue. In other embodiments logic module 802 includes queues 812. When the state machine 808 determines that another read is needed, the hardware of the logic module 802 could perform the read itself, or this information may be tagged and could be placed into a queue and software could do the next read. Hardware of the logic module 802 could alert software that the software needs to perform another action, such as bookkeeping. Actions for the state machine 808 to perform could include searching for a next parameter, or alerting software to look for a next parameter in some embodiments. It should be appreciated that the action to perform may be configurable in some embodiments.


The state machine 808 has sufficient capability to analyze and identify an action from the data flow and perform that action without software being involved in that loop, and to directly perform the next action and/or direct the software to perform the next action, in various embodiments. With registers 804 that have content set up by the data layout engine 404, and content in storage memory 714 as set up by the data layout engine 404, the state machine 808 is able to monitor for implicit or explicit instructions that match contents of the registers 804 and/or the counters 806. If there is a match identified, the state machine 802 performs one or more actions, which could include reading additional data from the storage memory 714, writing to one or more registers 804, searching for additional parameters or matches, or notifying the data layout engine 404 or a processor of the storage unit 152 (eg., by writing to a register 804 or a queue) to perform one or more actions. By having a logic module 802 that is able to monitor and parse data flowing through from the storage memory 714, the storage unit 152 has more efficient functionality than if a processor had to perform a read, parsing, and issuing of next read instruction etc., with attendant roundtrips of data and multiple instruction fetches and execution cycles. The logic module 802 thus improves computational efficiency of the storage unit 152 and storage systems using one or more storage units 152 and improves data throughput rates of storage systems, as a technological advance.



FIG. 9 is a flow diagram of a method for hardware assisted data lookup in a storage unit, which can be performed by a storage unit or more specifically by a data layout engine and a logic module in a storage unit. In various embodiments, this method could be performed by hardware logic, and/or a processor, in a storage unit. In an action 902, data is formatted in at least one of a plurality of data formats for storage in the storage unit. As noted above, the embodiments may handle multiple data formats and are not limited to a particular data format. In an action 904, the data layout engine communicates one or more parameters associated with the plurality of data formats to configure a logic unit or module. For example, the data layout engine could write a parameter to a register or counter in the logic module as described above. In an action 906, the logic module monitors incoming data from the storage memory to a buffer memory in the storage unit. The logic module identifies an explicit or implicit instruction for execution in the incoming data flow, based on the parameter(s) provided by the data layout engine. The logic module determines an action based on the instruction, in an action 906. In an action 908, the logic module executes the action. For example, the logic module could read a page from storage memory, write to a register of the logic module, write to a queue of the logic module, search in the storage memory, notify a processor of a storage unit to perform a further action, or perform further actions.


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


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


Detailed illustrative embodiments are disclosed herein. However, specific functional details disclosed herein are merely representative for purposes of describing embodiments. Embodiments may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein.


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


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


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


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


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


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


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


In various embodiments, one or more portions of the methods and mechanisms described herein may form part of a cloud-computing environment. In such embodiments, resources may be provided over the Internet as services according to one or more various models. Such models may include Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). In IaaS, computer infrastructure is delivered as a service. In such a case, the computing equipment is generally owned and operated by the service provider. In the PaaS model, software tools and underlying equipment used by developers to develop software solutions may be provided as a service and hosted by the service provider. SaaS typically includes a service provider licensing software as a service on demand. The service provider may host the software, or may deploy the software to a customer for a given period of time. Numerous combinations of the above models are possible and are contemplated.


Various units, circuits, or other components may be described or claimed as “configured to” perform a task or tasks. In such contexts, the phrase “configured to” is used to connote structure by indicating that the units/circuits/components include structure (e.g., circuitry) that performs the task or tasks during operation. As such, the unit/circuit/component can be said to be configured to perform the task even when the specified unit/circuit/component is not currently operational (e.g., is not on). The units/circuits/components used with the “configured to” language include hardware—for example, circuits, memory storing program instructions executable to implement the operation, etc. Reciting that a unit/circuit/component is “configured to” perform one or more tasks is expressly intended not to invoke 35 U.S.C. 112, sixth paragraph, for that unit/circuit/component. Additionally, “configured to” can include generic structure (e.g., generic circuitry) that is manipulated by software and/or firmware (e.g., an FPGA or a general-purpose processor executing software) to operate in manner that is capable of performing the task(s) at issue. “Configured to” may also include adapting a manufacturing process (e.g., a semiconductor fabrication facility) to fabricate devices (e.g., integrated circuits) that are adapted to implement or perform one or more tasks.


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

Claims
  • 1. A method, comprising: reading a header of a page of memory of a solid state storage device, the header comprising location information of metadata stored in the memory; andidentifying, by a processing device, an instruction for execution in the metadata, the instruction comprising a command to perform an action on another page of the memory.
  • 2. The method of claim 1, wherein the instruction contains information on a next action to be performed.
  • 3. The method of claim 1, wherein the instruction encodes information indicating where the another page is located.
  • 4. The method of claim 1, further comprising: parsing data from the solid state storage device, wherein the data is parsed as the data flows through a storage unit containing the solid state storage device.
  • 5. The method of claim 4, wherein the data is error corrected data.
  • 6. The method of claim 1, wherein the identified instruction is placed into a queue for execution.
  • 7. The method of claim 1, wherein a logic unit module executes the identified instruction.
  • 8. A non-transitory computer-readable storage medium storing instructions which, when executed, cause a processing device to: read a header of a page of memory of a solid state storage device, the header comprising location information of metadata stored in the memory; andidentify an instruction for execution in the metadata, the instruction comprising a command to perform an action on another page of the memory.
  • 9. The non-transitory computer-readable storage medium of claim 8, wherein the instruction contains information on a next action to be performed.
  • 10. The non-transitory computer-readable storage medium of claim 8, wherein the instruction encodes information indicating where the another page is located.
  • 11. The non-transitory computer-readable storage medium of claim 8, wherein the processing device is configured to: parse data from the solid state storage device, wherein the data is parsed as the data flows through a storage unit containing the solid state storage device.
  • 12. The non-transitory computer-readable storage medium of claim 11, wherein the data is error corrected data.
  • 13. The non-transitory computer-readable storage medium of claim 8, wherein the identified instruction is placed into a queue for execution.
  • 14. A system comprising: a solid state storage device; anda processing device, operatively coupled to the solid state storage device, configured to: read a header of a page of memory of the solid state storage device, the header comprising location information of metadata stored in the memory; andidentify an instruction for execution in the metadata, the instruction comprising a command to perform an action on another page of the memory.
  • 15. The system of claim 14, wherein the instruction contains information on a next action to be performed.
  • 16. The system of claim 14, wherein the instruction encodes information indicating where the another page is located.
  • 17. The system of claim 14, wherein the processing device is further configured to: parse data from the solid state storage device, wherein the data is parsed as the data flows through a storage unit containing the solid state storage device.
  • 18. The system of claim 17, wherein the data is error corrected data.
  • 19. The system of claim 14, wherein the identified instruction is placed into a queue for execution.
  • 20. The system of claim 14, wherein a logic unit executes the identified instruction.
US Referenced Citations (459)
Number Name Date Kind
4562489 Gaskell Dec 1985 A
5390327 Lubbers et al. Feb 1995 A
5450581 Bergen et al. Sep 1995 A
5479653 Jones Dec 1995 A
5488731 Mendelsohn Jan 1996 A
5504858 Ellis et al. Apr 1996 A
5564113 Bergen et al. Oct 1996 A
5574882 Menon et al. Nov 1996 A
5649093 Hanko et al. Jul 1997 A
5883909 DeKoning et al. Mar 1999 A
6000010 Legg Dec 1999 A
6260156 Garvin et al. Jul 2001 B1
6269453 Krantz Jul 2001 B1
6275898 DeKoning Aug 2001 B1
6453428 Stephenson Sep 2002 B1
6523087 Busser Feb 2003 B2
6535417 Tsuda Mar 2003 B2
6643748 Wieland Nov 2003 B1
6725392 Frey et al. Apr 2004 B1
6763455 Hall Jul 2004 B2
6836816 Kendall Dec 2004 B2
6985995 Holland et al. Jan 2006 B2
7032125 Holt et al. Apr 2006 B2
7047358 Lee et al. May 2006 B2
7051155 Talagala et al. May 2006 B2
7055058 Lee et al. May 2006 B2
7065617 Wang Jun 2006 B2
7069383 Yamamoto et al. Jun 2006 B2
7076606 Orsley Jul 2006 B2
7107480 Moshayedi et al. Sep 2006 B1
7159150 Kenchammana-Hosekote et al. Jan 2007 B2
7162575 Dalal et al. Jan 2007 B2
7164608 Lee Jan 2007 B2
7188270 Nanda et al. Mar 2007 B1
7334156 Land et al. Feb 2008 B2
7370220 Nguyen et al. May 2008 B1
7386666 Beauchamp et al. Jun 2008 B1
7398285 Kisley Jul 2008 B2
7424498 Patterson Sep 2008 B1
7424592 Karr Sep 2008 B1
7444532 Masuyama et al. Oct 2008 B2
7480658 Heinla et al. Jan 2009 B2
7484056 Madnani et al. Jan 2009 B2
7484057 Madnani et al. Jan 2009 B1
7484059 Ofer et al. Jan 2009 B1
7536506 Ashmore et al. May 2009 B2
7558859 Kasiolas Jul 2009 B2
7565446 Talagala et al. Jul 2009 B2
7613947 Coatney Nov 2009 B1
7634617 Misra Dec 2009 B2
7634618 Misra Dec 2009 B2
7681104 Sim-Tang et al. Mar 2010 B1
7681105 Sim-Tang et al. Mar 2010 B1
7681109 Yang et al. Mar 2010 B2
7730257 Franklin Jun 2010 B2
7730258 Smith Jun 2010 B1
7730274 Usgaonkar Jun 2010 B1
7743276 Jacobsen et al. Jun 2010 B2
7752489 Deenadhayalan et al. Jul 2010 B2
7757038 Kitahara Jul 2010 B2
7757059 Ofer et al. Jul 2010 B1
7778960 Chatterjee et al. Aug 2010 B1
7783955 Haratsch et al. Aug 2010 B2
7814272 Barrall et al. Oct 2010 B2
7814273 Barrall Oct 2010 B2
7818531 Barrall Oct 2010 B2
7827351 Suetsugu et al. Nov 2010 B2
7827439 Matthew et al. Nov 2010 B2
7831768 Ananthamurthy et al. Nov 2010 B2
7856583 Smith Dec 2010 B1
7870105 Arakawa et al. Jan 2011 B2
7873878 Belluomini et al. Jan 2011 B2
7885938 Greene et al. Feb 2011 B1
7886111 Klemm et al. Feb 2011 B2
7908448 Chatterjee et al. Mar 2011 B1
7916538 Jeon et al. Mar 2011 B2
7921268 Jakob Apr 2011 B2
7930499 Duchesne Apr 2011 B2
7941697 Mathew et al. May 2011 B2
7958303 Shuster Jun 2011 B2
7971129 Watson Jun 2011 B2
7984016 Kisley Jul 2011 B2
7991822 Bish et al. Aug 2011 B2
8006126 Deenadhayalan et al. Aug 2011 B2
8010485 Chatterjee et al. Aug 2011 B1
8010829 Chatterjee et al. Aug 2011 B1
8020047 Courtney Sep 2011 B2
8046548 Chatterjee et al. Oct 2011 B1
8051361 Sim-Tang et al. Nov 2011 B2
8051362 Li et al. Nov 2011 B2
8074038 Lionetti et al. Dec 2011 B2
8082393 Galloway et al. Dec 2011 B2
8086603 Nasre et al. Dec 2011 B2
8086634 Mimatsu Dec 2011 B2
8086911 Taylor Dec 2011 B1
8090837 Shin et al. Jan 2012 B2
8108502 Tabbara et al. Jan 2012 B2
8117388 Jernigan, IV Feb 2012 B2
8117521 Yang et al. Feb 2012 B2
8140821 Raizen et al. Mar 2012 B1
8145838 Miller et al. Mar 2012 B1
8145840 Koul et al. Mar 2012 B2
8175012 Chu et al. May 2012 B2
8176360 Frost et al. May 2012 B2
8176405 Hafner et al. May 2012 B2
8180855 Aiello et al. May 2012 B2
8200922 McKean et al. Jun 2012 B2
8209469 Carpenter et al. Jun 2012 B2
8225006 Karamcheti Jul 2012 B1
8239618 Kotzur et al. Aug 2012 B2
8244999 Chatterjee et al. Aug 2012 B1
8261016 Goel Sep 2012 B1
8271455 Kesselman Sep 2012 B2
8285686 Kesselman Oct 2012 B2
8305811 Jeon Nov 2012 B2
8315999 Chatley et al. Nov 2012 B2
8327080 Der Dec 2012 B1
8335769 Kesselman Dec 2012 B2
8341118 Drobychev et al. Dec 2012 B2
8351290 Huang et al. Jan 2013 B1
8364920 Parkison et al. Jan 2013 B1
8365041 Chu et al. Jan 2013 B2
8375146 Sinclair Feb 2013 B2
8397016 Talagala et al. Mar 2013 B2
8402152 Duran Mar 2013 B2
8412880 Leibowitz et al. Apr 2013 B2
8423739 Ash et al. Apr 2013 B2
8429436 Filingim et al. Apr 2013 B2
8452928 Ofer et al. May 2013 B1
8473698 Lionetti et al. Jun 2013 B2
8473778 Simitci Jun 2013 B2
8473815 Yu et al. Jun 2013 B2
8479037 Chatterjee et al. Jul 2013 B1
8484414 Sugimoto et al. Jul 2013 B2
8498967 Chatterjee et al. Jul 2013 B1
8522073 Cohen Aug 2013 B2
8533408 Madnani et al. Sep 2013 B1
8533527 Daikokuya et al. Sep 2013 B2
8539177 Ofer et al. Sep 2013 B1
8544029 Bakke et al. Sep 2013 B2
8549224 Zeryck et al. Oct 2013 B1
8583861 Ofer et al. Nov 2013 B1
8589625 Colgrove et al. Nov 2013 B2
8595455 Chatterjee et al. Nov 2013 B2
8615599 Takefman et al. Dec 2013 B1
8627136 Shankar et al. Jan 2014 B2
8627138 Clark Jan 2014 B1
8639669 Douglis et al. Jan 2014 B1
8639863 Kanapathippillai et al. Jan 2014 B1
8640000 Cypher Jan 2014 B1
8650343 Kanapathippillai et al. Feb 2014 B1
8660131 Vermunt et al. Feb 2014 B2
8661218 Piszczek et al. Feb 2014 B1
8671072 Shah et al. Mar 2014 B1
8689042 Kanapathippillai et al. Apr 2014 B1
8700875 Barron et al. Apr 2014 B1
8706694 Chatterjee et al. Apr 2014 B2
8706914 Duchesneau Apr 2014 B2
8706932 Kanapathippillai et al. Apr 2014 B1
8712963 Douglis et al. Apr 2014 B1
8713405 Healey et al. Apr 2014 B2
8719621 Karmarkar May 2014 B1
8725730 Keeton et al. May 2014 B2
8751859 Becker-szendy et al. Jun 2014 B2
8756387 Frost et al. Jun 2014 B2
8762793 Grube et al. Jun 2014 B2
8838541 Camble et al. Jun 2014 B2
8769232 Suryabudi et al. Jul 2014 B2
8775858 Gower et al. Jul 2014 B2
8775868 Colgrove et al. Jul 2014 B2
8788913 Xin et al. Jul 2014 B1
8793447 Usgaonkar et al. Jul 2014 B2
8799746 Baker et al. Aug 2014 B2
8819311 Liao Aug 2014 B2
8819383 Jobanputra et al. Aug 2014 B1
8824261 Miller et al. Sep 2014 B1
8832528 Thatcher et al. Sep 2014 B2
8838892 Li Sep 2014 B2
8843700 Salessi et al. Sep 2014 B1
8850108 Hayes et al. Sep 2014 B1
8850288 Lazier et al. Sep 2014 B1
8856593 Eckhardt et al. Oct 2014 B2
8856619 Cypher Oct 2014 B1
8862617 Kesselman Oct 2014 B2
8862847 Feng et al. Oct 2014 B2
8862928 Xavier et al. Oct 2014 B2
8868825 Hayes Oct 2014 B1
8874836 Hayes Oct 2014 B1
8880793 Nagineni Nov 2014 B2
8880825 Lionetti et al. Nov 2014 B2
8886778 Nedved et al. Nov 2014 B2
8898383 Yamamoto et al. Nov 2014 B2
8898388 Kimmel Nov 2014 B1
8904231 Coatney et al. Dec 2014 B2
8918478 Ozzie et al. Dec 2014 B2
8930307 Colgrove et al. Jan 2015 B2
8930633 Amit et al. Jan 2015 B2
8943357 Atzmony Jan 2015 B2
8949502 McKnight et al. Feb 2015 B2
8959110 Smith et al. Feb 2015 B2
8959388 Kuang et al. Feb 2015 B1
8972478 Storer et al. Mar 2015 B1
8972779 Lee et al. Mar 2015 B2
8977597 Ganesh et al. Mar 2015 B2
8996828 Kalos et al. Mar 2015 B2
9003144 Hayes et al. Apr 2015 B1
9009724 Gold et al. Apr 2015 B2
9021053 Bernbo et al. Apr 2015 B2
9021215 Meir et al. Apr 2015 B2
9025393 Wu May 2015 B2
9043372 Makkar et al. May 2015 B2
9047214 Sharon et al. Jun 2015 B1
9053808 Sprouse Jun 2015 B2
9058155 Cepulis et al. Jun 2015 B2
9063895 Madnani et al. Jun 2015 B1
9063896 Madnani et al. Jun 2015 B1
9098211 Madnani et al. Aug 2015 B1
9110898 Chamness et al. Aug 2015 B1
9110964 Shilane et al. Aug 2015 B1
9116819 Cope et al. Aug 2015 B2
9117536 Yoon Aug 2015 B2
9122401 Zaltsman et al. Sep 2015 B2
9123422 Sharon et al. Sep 2015 B2
9124300 Olbrich et al. Sep 2015 B2
9134908 Horn et al. Sep 2015 B2
9153337 Sutardja Oct 2015 B2
9158472 Kesselman et al. Oct 2015 B2
9159422 Lee et al. Oct 2015 B1
9164891 Karamcheti et al. Oct 2015 B2
9183136 Kawamura et al. Nov 2015 B2
9189650 Jaye et al. Nov 2015 B2
9201733 Verma Dec 2015 B2
9207876 Shu et al. Dec 2015 B2
9229656 Contreras et al. Jan 2016 B1
9229810 He et al. Jan 2016 B2
9235475 Shilane et al. Jan 2016 B1
9244626 Shah et al. Jan 2016 B2
9250999 Barroso Feb 2016 B1
9251066 Colgrove et al. Feb 2016 B2
9268648 Barash et al. Feb 2016 B1
9268806 Kesselman et al. Feb 2016 B1
9286002 Karamcheti et al. Mar 2016 B1
9292214 Kalos et al. Mar 2016 B2
9298760 Li et al. Mar 2016 B1
9304908 Karamcheti et al. Apr 2016 B1
9311969 Murin Apr 2016 B2
9311970 Sharon et al. Apr 2016 B2
9323663 Karamcheti et al. Apr 2016 B2
9323667 Bennett Apr 2016 B2
9323681 Apostolides et al. Apr 2016 B2
9335942 Kumar et al. May 2016 B2
9348538 Mallaiah et al. May 2016 B2
9355022 Ravimohan et al. May 2016 B2
9384082 Lee et al. Jul 2016 B1
9384252 Akirav et al. Jul 2016 B2
9389958 Sundaram et al. Jul 2016 B2
9390019 Patterson et al. Jul 2016 B2
9396202 Drobychev et al. Jul 2016 B1
9400828 Kesselman et al. Jul 2016 B2
9405478 Koseki et al. Aug 2016 B2
9411685 Lee Aug 2016 B2
9417960 Klein Aug 2016 B2
9417963 He et al. Aug 2016 B2
9430250 Hamid et al. Aug 2016 B2
9430542 Akirav et al. Aug 2016 B2
9432541 Ishida Aug 2016 B2
9454434 Sundaram et al. Sep 2016 B2
9471579 Natanzon Oct 2016 B1
9477554 Chamness et al. Oct 2016 B2
9477632 Du Oct 2016 B2
9501398 George et al. Nov 2016 B2
9525737 Friedman Dec 2016 B2
9529542 Friedman et al. Dec 2016 B2
9535631 Fu et al. Jan 2017 B2
9552248 Miller et al. Jan 2017 B2
9552291 Munetoh et al. Jan 2017 B2
9552299 Stalzer Jan 2017 B2
9563517 Natanzon et al. Feb 2017 B1
9588698 Karamcheti et al. Mar 2017 B1
9588712 Kalos et al. Mar 2017 B2
9594652 Sathiamoorthy et al. Mar 2017 B1
9600193 Ahrens et al. Mar 2017 B2
9619321 Sharon et al. Apr 2017 B1
9619430 Kannan et al. Apr 2017 B2
9645754 Li et al. May 2017 B2
9667720 Bent et al. May 2017 B1
9710535 Aizman et al. Jul 2017 B2
9733840 Karamcheti et al. Aug 2017 B2
9734225 Akirav et al. Aug 2017 B2
9740403 Storer et al. Aug 2017 B2
9740700 Chopra et al. Aug 2017 B1
9740762 Horowitz et al. Aug 2017 B2
9747319 Bestler et al. Aug 2017 B2
9747320 Kesselman Aug 2017 B2
9767130 Bestler et al. Sep 2017 B2
9781227 Friedman et al. Oct 2017 B2
9785498 Misra et al. Oct 2017 B2
9798486 Singh Oct 2017 B1
9804925 Carmi et al. Oct 2017 B1
9811285 Karamcheti et al. Nov 2017 B1
9811546 Bent et al. Nov 2017 B1
9818478 Chung et al. Nov 2017 B2
9829066 Thomas Nov 2017 B2
9836245 Hayes et al. Dec 2017 B2
9891854 Munetoh et al. Feb 2018 B2
9891860 Delgado et al. Feb 2018 B1
9892005 Kedem et al. Feb 2018 B2
9892186 Akirav et al. Feb 2018 B2
9904589 Donlan et al. Feb 2018 B1
9904717 Anglin et al. Feb 2018 B2
9952809 Shah Feb 2018 B2
9910748 Pan Mar 2018 B2
9910904 Anglin et al. Mar 2018 B2
9934237 Shilane et al. Apr 2018 B1
9940065 Kalos et al. Apr 2018 B2
9946604 Glass Apr 2018 B1
9959167 Donlan et al. May 2018 B1
9965539 D'Halluin et al. May 2018 B2
9998539 Brock et al. Jun 2018 B1
10007457 Hayes et al. Jun 2018 B2
10013177 Liu et al. Jul 2018 B2
10013311 Sundaram et al. Jul 2018 B2
10019314 Litsyn et al. Jul 2018 B2
10019317 Usvyatsky et al. Jul 2018 B2
10031703 Natanzon et al. Jul 2018 B1
10061512 Chu et al. Aug 2018 B2
10073626 Karamcheti et al. Sep 2018 B2
10082985 Hayes et al. Sep 2018 B2
10089012 Chen et al. Oct 2018 B1
10089174 Lin Oct 2018 B2
10089176 Donlan et al. Oct 2018 B1
10108819 Donlan et al. Oct 2018 B1
10146787 Bashyam et al. Dec 2018 B2
10152268 Chakraborty et al. Dec 2018 B1
10157098 Chung et al. Dec 2018 B2
10162704 Kirschner et al. Dec 2018 B1
10180875 Northcott Jan 2019 B2
10185730 Bestler et al. Jan 2019 B2
10235065 Miller et al. Mar 2019 B1
20020144059 Kendall Oct 2002 A1
20030105984 Masuyama et al. Jun 2003 A1
20030110205 Johnson Jun 2003 A1
20040161086 Buntin et al. Aug 2004 A1
20050001652 Malik et al. Jan 2005 A1
20050076228 Davis et al. Apr 2005 A1
20050235132 Karr et al. Oct 2005 A1
20050278460 Shin et al. Dec 2005 A1
20050283649 Turner et al. Dec 2005 A1
20060015683 Ashmore et al. Jan 2006 A1
20060114930 Lucas et al. Jun 2006 A1
20060174157 Barrall et al. Aug 2006 A1
20060248294 Nedved et al. Nov 2006 A1
20070079068 Draggon Apr 2007 A1
20070214194 Reuter Sep 2007 A1
20070214314 Reuter Sep 2007 A1
20070234016 Davis et al. Oct 2007 A1
20070268905 Baker et al. Nov 2007 A1
20080080709 Michtchenko et al. Apr 2008 A1
20080107274 Worthy May 2008 A1
20080140724 Flynn Jun 2008 A1
20080155191 Anderson et al. Jun 2008 A1
20080295118 Liao Nov 2008 A1
20090077208 Nguyen et al. Mar 2009 A1
20090138654 Sutardja May 2009 A1
20090216910 Duchesneau Aug 2009 A1
20090216920 Lauterbach et al. Aug 2009 A1
20100017444 Chatterjee et al. Jan 2010 A1
20100042636 Lu Feb 2010 A1
20100094806 Apostolides et al. Apr 2010 A1
20100115070 Missimilly May 2010 A1
20100125695 Wu et al. May 2010 A1
20100162076 Sim-Tang et al. Jun 2010 A1
20100169707 Mathew et al. Jul 2010 A1
20100174576 Naylor Jul 2010 A1
20100268908 Ouyang et al. Oct 2010 A1
20110040925 Frost et al. Feb 2011 A1
20110060927 Fillingim et al. Mar 2011 A1
20110119462 Leach et al. May 2011 A1
20110219170 Frost et al. Sep 2011 A1
20110238625 Hamaguchi et al. Sep 2011 A1
20110264843 Haines et al. Oct 2011 A1
20110302369 Goto et al. Dec 2011 A1
20120011398 Eckhardt Jan 2012 A1
20120079318 Colgrove et al. Mar 2012 A1
20120089567 Takahashi et al. Apr 2012 A1
20120110249 Jeong et al. May 2012 A1
20120131253 McKnight May 2012 A1
20120158923 Mohamed et al. Jun 2012 A1
20120191900 Kunimatsu et al. Jul 2012 A1
20120198152 Terry et al. Aug 2012 A1
20120198261 Brown et al. Aug 2012 A1
20120209943 Jung Aug 2012 A1
20120226934 Rao Sep 2012 A1
20120246435 Meir et al. Sep 2012 A1
20120260055 Murase Oct 2012 A1
20120311557 Resch Dec 2012 A1
20130022201 Glew et al. Jan 2013 A1
20130036314 Glew et al. Feb 2013 A1
20130042056 Shats Feb 2013 A1
20130060884 Bernbo et al. Mar 2013 A1
20130067188 Mehra et al. Mar 2013 A1
20130073894 Xavier et al. Mar 2013 A1
20130124776 Hallak et al. May 2013 A1
20130132800 Healy et al. May 2013 A1
20130151653 Sawiki Jun 2013 A1
20130151771 Tsukahara et al. Jun 2013 A1
20130173853 Ungureanu et al. Jul 2013 A1
20130238554 Yucel et al. Sep 2013 A1
20130339314 Carpenter et al. Dec 2013 A1
20130339635 Amit et al. Dec 2013 A1
20130339818 Baker et al. Dec 2013 A1
20140040535 Lee Feb 2014 A1
20140040702 He et al. Feb 2014 A1
20140047263 Coatney et al. Feb 2014 A1
20140047269 Kim Feb 2014 A1
20140063721 Herman et al. Mar 2014 A1
20140064048 Cohen et al. Mar 2014 A1
20140068224 Fan et al. Mar 2014 A1
20140075252 Luo et al. Mar 2014 A1
20140122510 Namkoong et al. May 2014 A1
20140136880 Shankar et al. May 2014 A1
20140181402 White Jun 2014 A1
20140237164 Le et al. Aug 2014 A1
20140279936 Bernbo et al. Sep 2014 A1
20140280025 Eidson et al. Sep 2014 A1
20140289588 Nagadomi et al. Sep 2014 A1
20140330785 Isherwood et al. Nov 2014 A1
20140372838 Lou et al. Dec 2014 A1
20140380125 Calder et al. Dec 2014 A1
20140380126 Yekhanin et al. Dec 2014 A1
20150032720 James Jan 2015 A1
20150039645 Lewis Feb 2015 A1
20150039849 Lewis Feb 2015 A1
20150089283 Kermarrec et al. Mar 2015 A1
20150100746 Rychlik Apr 2015 A1
20150134824 Mickens May 2015 A1
20150153800 Lucas et al. Jun 2015 A1
20150180714 Chunn Jun 2015 A1
20150280959 Vincent Oct 2015 A1
20160054931 Romanovsky Feb 2016 A1
20160246537 Kim Feb 2016 A1
20160191508 Bestler et al. Jun 2016 A1
20160378612 Hipsh et al. Dec 2016 A1
20170083319 Burger Mar 2017 A1
20170091236 Hayes et al. Mar 2017 A1
20170103092 Hu et al. Apr 2017 A1
20170103094 Hu et al. Apr 2017 A1
20170103098 Hu et al. Apr 2017 A1
20170103116 Hu et al. Apr 2017 A1
20170177236 Haratsch et al. Jun 2017 A1
20180039442 Shadrin et al. Feb 2018 A1
20180081958 Akirav et al. Mar 2018 A1
20180101441 Hyun et al. Apr 2018 A1
20180101587 Anglin et al. Apr 2018 A1
20180101588 Anglin et al. Apr 2018 A1
20180217756 Liu et al. Aug 2018 A1
20180307560 Vishnumolakala et al. Oct 2018 A1
20180321874 Li et al. Nov 2018 A1
20190036703 Bestler Jan 2019 A1
Foreign Referenced Citations (6)
Number Date Country
2164006 Mar 2010 EP
2256621 Dec 2010 EP
WO 02-13033 Feb 2002 WO
WO 2008103569 Aug 2008 WO
WO 2008157081 Dec 2008 WO
WO 2013032825 Jul 2013 WO
Non-Patent Literature Citations (25)
Entry
Hwang, Kai, et al. “RAID-x: A New Distributed Disk Array for I/O-Centric Cluster Computing,” HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing, IEEE, 2000, pp. 279-286.
Schmid, Patrick: “RAID Scaling Charts, Part 3:4-128 kB Stripes Compared”, Tom's Hardware, Nov. 27, 2007 (http://www.tomshardware.com/reviews/RAID-SCALING-CHARTS.1735-4.html), See pp. 1-2.
Storer, Mark W. et al., “Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage,” Fast '08: 6th USENIX Conference on File and Storage Technologies, San Jose, CA, Feb. 26-29, 2008 pp. 1-16.
Ju-Kyeong Kim et al., “Data Access Frequency based Data Replication Method using Erasure Codes in Cloud Storage System”, Journal of the Institute of Electronics and Information Engineers, Feb. 2014, vol. 51, No. 2, pp. 85-91.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2015/018169, dated May 15, 2015.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2015/034302, dated Sep. 11, 2015.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2015/039135, dated Sep. 18, 2015.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2015/039136, dated Sep. 23, 2015.
International Search Report, PCT/US2015/039142, dated Sep. 24, 2015.
International Search Report, PCT/US2015/034291, dated Sep. 30, 2015.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2015/039137, dated Oct. 1, 2015.
International Search Report, PCT/US2015/044370, dated Dec. 15, 2015.
International Search Report amd the Written Opinion of the International Searching Authority, PCT/US2016/031039, dated May 5, 2016.
International Search Report, PCT/US2016/014604, dated May 19, 2016.
International Search Report, PCT/US2016/014361, dated May 30, 2016.
International Search Report, PCT/US2016/014356, dated Jun. 28, 2016.
International Search Report, PCT/US2016/014357, dated Jun. 29, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/016504, dated Jul. 6, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/024391, dated Jul. 12, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/026529, dated Jul. 19, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/023485, dated Jul. 21, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/033306, dated Aug. 19, 2016.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/047808, dated Nov. 25, 2016.
Stalzer, Mark A., “FlashBlades: System Architecture and Applications,” Proceedings of the 2nd Workshop on Architectures and Systems for Big Data, Association for Computing Machinery, New York, NY, 2012, pp. 10-14.
International Seach Report and the Written Opinion of the International Searching Authority, PCT/US2016/042147, dated Nov. 30, 2016.
Related Publications (1)
Number Date Country
20210073140 A1 Mar 2021 US
Continuations (1)
Number Date Country
Parent 14871757 Sep 2015 US
Child 16953079 US