The disclosed subject matter relates to data storage and, more particularly, to instantiating a virtual redundant array of independent disks (RAID) via extents of a physical storage device pool.
Redundant array of independent disks (RAID) is a common technology employed in data storage systems. RAID storage techniques, often referred to as RAID levels, can have distinctive storage and/or parity characteristics. Some common examples of RAID levels can be RAID0, RAID1, RAID3, RAID4, RAID5, RAID6, etc., of which RAID4, 5, and 6, are some of the more commonly practiced RAID levels. RAID4 can consist of block-level striping across a group of physical disks comprising a dedicated parity disk, for example, at 342 of
The subject disclosure is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the subject disclosure. It may be evident, however, that the subject disclosure may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the subject disclosure.
As mentioned, a redundant array of independent disks (RAID) can be a common data storage system technology. RAIDs can be, for example, of RAID0, RAID1, RAID3, RAID4, RAID5, RAID6, or various other RAID levels. RAID4 can consist of block-level striping across a group of physical disks comprising a dedicated parity disk, for example, at 342 of
In an aspect, data storage techniques can conventionally store data in one or more arrays of data storage devices. As an example, data can be stored in an ECS system such as is provided by DELL EMC. The example ECS system can comprise data storage devices. A data storage device can comprise one or more extent, wherein the sum of the extents of a data storage device represents the storage capacity of the data storage device, e.g., a 128 MB disk can comprise 128 extents, wherein each of the 128 extents can store approximately 1 MB of data. One use of data storage is in bulk data storage. Data can be stored in a group of disks format, for example, in a RAID. Conventionally, a RAID can be an arrangement of a group of physical disks that enable striping normal data and/or parity data across the group of physical disks. In an aspect, this can be termed a ‘physical RAID’ system.
In an aspect, a ‘virtual RAID’ (VRAID) can be a virtual embodiment of physical storage devices wherein the virtual embodiment can emulate a physical RAID. In an aspect, a physical storage device pool (PSDP) can comprise a group of disks each comprising extents, e.g., the PSDP can comprise the extents of the disks of the group of disks. It is noted that a PSDP can comprise storage devices other than disks, e.g., solid state drives (SSDs), random access memory (RAM), or other types of data storage, without departing from the scope of the presently disclosed subject matter and, for the sake of clarity and brevity, the term disk is to be regarded as inclusive of nearly any storage device germane to the instant disclosure. Generally, a PSDP can be described as being N disks wide and M extents deep, e.g., a group of 20 drives each having 50 extents can be described as a 20×40 PSDP. A VRAID can comprise some portion of a PSDP via a virtual storage device pool (VSDP) that can be embodied in the N×M PSDP. As an example, a PSDP can be 20×40 and a VSDP can be logically mapped onto the PSDP, for example as a 20×50 VSDP. In an aspect, the virtualization, e.g., mapping of the virtual onto the physical storage devices, can have more or fewer virtual disks and/or virtual extents than the corresponding physical disks/extents, however, for the sake of clarity and brevity, the PSDP can generally be mapped by a same sized VSDP in this disclosure. In the current example, a VRAID can, for example, be 4×4, e.g., four virtual disks wide by four virtual extents deep. As such, it can be readily appreciated that the 20×40 VSDP can support one or more VRAIDs, for example, up to 50 4×4 VRAIDs can fit into a 20×40 VSDP.
In an aspect, a VRAID can comprise contiguous and/or non-contiguous disks/extents. In an example, contiguous virtual disks (vd) and virtual extents (ye) can be allocated for a first example VRAID and can be from vd1.ve1 to vd4.ve4. In another example, non-contiguous vd and ve can be allocated for a second example VRAID, e.g., VRAID 230 of
Interaction with, management of, etc., the PSDP, VSDP, VRAID, or combinations thereof can be via a virtual-RAID control component (VRCC), e.g., VRCC 110, etc. In an aspect, a VRCC can comprise a processor, can be a virtual component executing on a physical processor, etc. As such, the VRCC can support mapping between PSDP elements and VSDP elements, can support allocation of VSDP elements to a VRAID, can receive VRAID criteria, can enable selection of VSDP elements based on the criteria, or nearly any other operation related to operating a VRAID based on VSDP elements mapped to PSDP elements. Accordingly, VRCC can comprise and/or employ various computing resources, e.g., a processor(s), memory(ies), network interface(s), user interface(s), etc., such as are illustrated at
In an embodiment, software, firmware, etc., can hide abstraction of physical storage elements, e.g., a VRAID can appear to have a conventional RAID topology even where it can be an abstraction of PSDP elements that have a topology that would be non-conventional for a RAID, e.g., a VSDP elements mapping to non-contiguous PSDP elements can still appear to be a contiguous RAID even where, for example, the VRAID can be embodied via multiple physical extents of one or more physical disks, across one or more geographic locations, etc. In some embodiments, a VRAID can be forbidden from having two virtual disks corresponding to physical extents of any one physical disk in a PSDP. This rule can harden the VRAID against a failure of the one physical disk triggering a failure of two virtual disks, which can result in a data loss event in some circumstances, which rule is generally referred to as the ‘data loss protection’ rule. In an example, where a first virtual extent can store data and a second virtual extent can store protection data for the stored data of the first virtual extent, then loss of both the first and second virtual extent can result in a data loss event. Accordingly, it can be a best practice to prohibit VRAIDs from this type of data loss, which can result from mapping the first and second virtual extent to a single physical disk, such that when the single physical disk becomes less accessible, the data of the corresponding virtual extents can become less accessible, which can compromise data stored via the first and second virtual extent where they map to a single physical disk.
In some embodiments, a PSDP can comprise storage space from geographically distributed physical storage devices, e.g., disks in different geographical areas. As an example, a PSDP can comprise storage space from hardware in one or more portions of a data center in Denver. In a second example, a PSDP can comprise storage space from hardware in a first data center in Denver and from a second data center in Denver. As a further example, a PSDP can comprise storage space from hardware in a first data center in Denver and a second data center in Seattle. As yet another example, a PSDP can comprise storage space from first hardware in a first data center in Houston, Tex., and second hardware in a data center in Mosco, Russia. Accordingly, data storage in a first data center located in Seattle, which can be subject to earthquakes, frequent violent political events, etc., and in a second data center located in Kansas, which can be less prone to earthquakes and political events, can physically spread stored data and can mitigate some risks to the data, e.g., risks form earthquake and riots, can be less in Kansas while risks from tornados can be less in Seattle. Numerous other examples are to be readily appreciated by one of skill in the art, and all such examples are considered within the scope of the present disclosure, even where not recited for the sake of clarity and brevity. As such, a VRAID can appear to be a conventional RAID, can level wear, can be flexibly deployed, can provide hardening against some types of data loss, and can provide other benefits over a conventional physical RAID data storage system.
To the accomplishment of the foregoing and related ends, the disclosed subject matter, then, comprises one or more of the features hereinafter more fully described. The following description and the annexed drawings set forth in detail certain illustrative aspects of the subject matter. However, these aspects are indicative of but a few of the various ways in which the principles of the subject matter can be employed. Other aspects, advantages, and novel features of the disclosed subject matter will become apparent from the following detailed description when considered in conjunction with the provided drawings.
In an aspect, system 100 can further comprise virtual-RAID control component (VRCC) 110 that can facilitate interaction with elements of PSDP 102 according to a virtualization of PSDP 102, e.g., via VSDP 120. As an example, storing data for storage in RAID system 104 at 2.8×, e.g., at a virtual extent (ye) of a virtual disk (vd) such as ve2 of vd2, can be coordinated via VRCC 110 and can correspond to physical storage of data for storage in RAID system 104 at a corresponding physical extent (e) of physical disk (d), namely 2.8 in this example. In an aspect, VRCC 110 can enable one or more VSDP 120 based on PSDP 102, wherein the sum of the storage spaces of said one or more VSDPs can be up to the storage space of PSDP 102.
As is illustrated in system 100, VSDP 120 can map physical extents of physical disks to various virtual extents of virtual disks. As an example, vd1.ve1 of VSDP 120 can map to d8.e3 of PSDP 102, which is represented in VSDP 120 as 8.3×. Moreover, while in some embodiments virtualized extents/disks can be contiguous, other embodiments can comprise non-contiguous elements of PSDP 102. As a non-illustrated example, for a contiguous mapping, ve2.vd2 of VSDP 120 can map to 2.6× based on ve2.vd1 mapping to 1.5×. However, mapping of physical elements in the virtual pool need not be contiguous and, as such, as illustrated, ve2.vd2 of VSDP 120 can map to 2.8× even where ve2.vd1 maps to 1.5×, e.g., non-contiguously. In some embodiments, VSDP 120 can minor PSDP 102.
In some embodiments, elements of PSDP 102 can be located local to other elements thereof, e.g., different disks in a same server rack, etc. In some embodiments, elements of PSDP 102 can be located remotely from other elements thereof, e.g., a disk in Seattle and another disk in Boston. In some embodiments, some elements of PSDP 102 can be local and other elements can be remote, e.g., seven disks in Seattle, nine disks in Boston, ten disks in Milan, four disks in Tokyo, etc. As such, PSDP 102 can provide data security by allowing normal data and corresponding parity data to be stored in a diversified manner. Moreover, storage of data via more disks can provide correspondingly more parallelism for data access. Further, whereas VSDP 120 can facilitate non-contiguous mapping between the physical and virtual storage device pool elements, elements for storing parity data can also be diverse, thereby supporting wear leveling.
In an aspect, at least a portion of PSDP 202 can be virtualized via one or more VSDPs, e.g., VSDP 220. As is illustrated in system 200, the hashed and shaded extents of PSDP 202 can be correspondingly represented in VSDP 220. VSDP 220 can illustrate a virtualization of elements of PSDP 202 having a 3+1 RAID5 topology in VSDP 220, e.g., shaded virtual parity extents can be distributed in a diagonal stripe across the virtual disks and can correspond to physical elements of PSDP 202 that do not share the same diagonal striping but are nonetheless distributed parity extents.
In an aspect, a virtual RAID, e.g., VRAID 230, can be supported via VSDP 220. VRAID 230, as illustrated, can embody a RAID4 topology, e.g., vd4 of VRAID 230 can be a virtual parity data storage disk. Illustrated VRAID 230 embodying a RAID4 topology does not present a diagonal parity data stripe that would be typical of a RAID5 topology, however, because VRAID 230 maps non-contiguously to PSDP 202 via VSDP 220, the vd4, while a virtual parity disk, actually stored parity data in a distributed manner, e.g., at 5.2×, 4.5×, 2.5× and 1.6×. Accordingly, interactions with VRAID 230 can employ simple RAID4 topology but still provide parity data distribution that can be similar to RAID5 topologies.
In an aspect, creation of VRAID 230 can be based on selecting portions of VSDP 220 that can employ parity data storage elements in PSDP 202 that can meet a wear leveling rule, a distribution rule, a data loss protection rule, and/or other rules. In an example, selection based on a data loss protection rule can prevent employing more than one extent from a single physical disk in a single extent of a VRAID. In this example, no two disks of vre1 of VRAID 230 can be from the same physical disk of PSDP 202, e.g., vre1 comprises extents from physical disks 8, 2, 4, and 5, which can satisfy the data loss protection rule. However, as a non-illustrated counter example, if vre1 comprises extents from physical disks 8,8, 4, and 5, then this can fail to satisfy the data loss protection rule because failure of physical disk 8 can then result in failure of vrd1 and vrd2 for vre1, in this non-illustrated example, which can lead to a data loss event.
In an example of a wear leveling rule, where physical disk 1.6 has previously been used to store normal data in a previous VRAID, and where physical disk 3.2 has been used to store parity data in another previous VRAID, then selecting a parity disk for VRAID 230 in this example can favor selection of 1.6× for the parity extent of vre4. The preference in this example can be appreciated as being based on preferring to select a less worn physical extent, and where parity storage is typically higher wear, then it can be preferable to select an extent that was not previously employed for parity storage, e.g., where physical disk 1.6 was not previously used for parity storage and physical disk 3.2 was, then it can be preferable to not use disk 3.2× for parity storage in VRAID 230, leaving use of disk 1.6× as preferable for parity storage in this example.
As an example of a distribution rule, it can be preferable to distribute parity storage. Accordingly, it would be less preferred to select extents all from a same physical disk as virtual extents for parity data storage in VRAID 230, e.g., it would be less preferable to select 5.1×, 5.2×, 5.5×, and 5.7× for vd4 in VRAID 230 because this does not distribute the parity data storage well and a failure of physical disk 5 can result in loss of all parity data in vd4 of VRAID 230. However, as is illustrated, vd4 comprises distributed extents for parity data storage, e.g., mapping to physical disks 5.2, 4.5, 2.5, and 1.6. Moreover, where disk 5 can be in Seattle, disk 4 can be in San Jose, disk 2 can be in Cape Town, and disk 1 can be in Paris, the parity disks can also be geographically diverse, which can further provide protection against regional impacting events such as natural disasters, power outages, political unrest, etc.
Also illustrated in system 300 is VRAID 330 that can be provisioned from virtualized elements of VSDP 320, e.g., VRAID 330 can be comprised of elements of VSDP 320 that can be virtualized from a PSDP. In an aspect, VRAID 330 can map parity data storage elements into vd4. This aspect can result in VRAID 330 emulating a RAID4 topology. As an example, vd4 of VRAID 330 can emulate d4 of RAID4 342, as illustrated, comprising Ap, Bp, Cp, and Dp. In an aspect, VRAID 330 can appear to be a RAID4 topology and be interacted with accordingly. However, in this aspect, the logical arrangement of the virtualized RAID can also provide distribution of parity data storage elements that can be akin to other RAID topologies, e.g., RAID5, RAID6, etc.
VRCC 410 can communicate with parity control component (PCC) 450, which can enable selection of, and/or interaction with, parity elements of VSDP 420, e.g., via a VRAID built on VSDP 420, etc. In an aspect, PCC 450 can enable selection of virtual parity data storage elements corresponding to physical storage elements of PSDP 402 that can be used to store parity data. This can be based, for example, in part on historical extent_parity (HEP) data 452. HEP data 452 can reflect historical use of storage elements in relation to storing parity data. As an example, an element(s) of physical disks/extents can be associated with a counter indicating use for parity data storage, an amount of wear to the element(s) due to normal data storage and/or parity data storage, or other information that can be correlated to HEP. In an aspect, HEP data 452 can be employed to increment or decrement a rank of an element(s) in relation to being selected for use in storing parity data for a VRAID supported via VSDP 420. As an example, a first real extent that is has historically been heavily worn based on an use for an extended period of time to store parity data can be lower ranked via PCC 450 based on HEP data 452 reflecting the heavy wear. As such, in this example, the first real extent, and correspondingly a virtual extent of VSDP 420, can be less likely to be selected for use as a parity data storage element, e.g., encouraging use of other element(s) for parity data storage to better level storage device wear.
In a further aspect, PCC 450 can receive active wear-leveling (AWL) data 454 that can be employed to actively select alternate element(s) for parity data storage, e.g., where a first storage element is experiencing a high level of wear, for example via extended use as a parity data storage element, etc., a second storage element can be selected via PCC 450 based on AWL data 454. In this example, parity data can accordingly be actively moved from the first element to the second element, or by otherwise rebuilding parity data at the second element, to allow further parity data updates to cause wear on the second element in lieu of the first element. In an aspect, this active wear leveling in a VRAID can be transparent to a user of the VRAID but can be akin to a physical disk swap in a conventional RAID device.
Moreover, VRCC 410 can enable provisioning one or more VRAIDs via one or more VSDPs built on PSDP 402. As such, VRCC 410 can generate VRAIDs on the fly based on user requests that can be embodied in virtual-RAID criteria 412. Additionally, requests to terminate VRAIDs can be processed via VRCC 410. Accordingly, older VRAIDs can be torn down and their elements can be reused in newer VRAIDs spawned over time. In this aspect, HEP data 452 can provide for wear leveling across the lifetimes of a plurality of VRAIDs. Additionally, where there can be long term VRAIDs that are not as easily wear leveled via destruction/creation mechanisms, AWL data 454 can be employed to support wear leveling. Moreover, VRCC 410 can provide for determining that one or more rules are satisfied in relation to provisioning VRAIDs, e.g., diversity of elements to provide greater parallel data access mechanisms, geographic diversity rules, rules for data loss protection, etc.
In an aspect, system 501 can comprise VSDP 521 that can provide two parity data stripes, e.g., 1.6×, 2.5×, 4.5×, and 5.2× as in system 500, in addition to 2.7×, 3.3.×, 5.1×, and 8.3×. In an aspect, VSDP 521 can emulate a RAID6 topology via parity block distribution of two parity stripes. In system 501, a VRAID, e.g., VRAID 531, can be built on VSDP 521 and, similar to VRAID 530, can emulate a RAID4 topology, e.g., vd3 and vd4 of VRAID 531 can be regarded as parity data disks even though the mapping of non-contiguous physical extents in vd3 and vd4 can provide RAID6 type parity data storage diversity.
In view of the example system(s) described above, example method(s) that can be implemented in accordance with the disclosed subject matter can be better appreciated with reference to flowcharts in
At 620, method 600 can comprise determining a virtual RAID (VRAID) based on the VSDP, wherein the VRAID comprises first virtual extents that map to first physical extents for non-parity data storage and second virtual extents that map to second physical extents for parity data storage. In an aspect, VSDP can enable contiguous and/or non-contiguous mapping of PSDP. In an aspect, VSDP can support one or more VRAIDs. At 620, a VRAID can provide a mapping of virtual extents that can emulate a RAID level, for example a VRAID can emulate a RAID4 topology even though the mapping to physical storage elements of PSDP can provide RAID5-like parity diversity, see for example VRAID 230 in
Method 600, at 630, can comprise enabling storage of non-parity data via the first physical extents according to the first virtual extents and storage of parity data via the second physical extents according to the second virtual extents. At this point method 600 can end. In an aspect, non-parity data, e.g., data for storage in RAID system 104, 404, etc., and parity data can be stored via element(s) of PSDP according to a VRAID supported by VSDP. In an aspect, parity data can be stored by real extents, mapped to virtual extents, which can be correspondingly designated for storage of parity data, e.g., a parity_extent can store parity data, which can enable historical tracking of extents designated for storing parity data. In an aspect, this can enable wear leveling, e.g., by allocating VRAIDs in a manner that balances wear via distributing a parity_extent(s), by active wear balancing, or combinations thereof.
At 720, method 700 can comprise designating first physical extents for non-parity data storage and designating second physical extents for parity data storage based on historical wear data for storage elements comprising the physical extents. Extents of the disks of PSDP can be segregated into extents that can store parity data, extents that can store non-parity data, and as yet unassigned extents. This can enable tracking of extents by the type of data they can store, e.g., parity or non-parity. Accordingly, where updating of parity type data storage is typically greater than for non-parity, wear of parity storage extents can be determined to be greater than for non-parity. Where an extent can have already been used to store parity data, a ranking can be decremented such that the extent can be less likely to be reselected for storing parity data in a VRAID. This can therefore act as a metric that can support proactive wear leveling by preferably selecting less worn extents, e.g., extents that have had less previous use storing parity data, for provisioning into a VRAID.
At 730, method 700 can comprise determining a VRAID based on the VSDP, wherein the VRAID comprises first virtual extents that map to the first physical extents and second virtual extents that map to the second physical extents. Mapping of VSDP from PSDP can be contiguous and/or non-contiguous. VSDP can support one or more VRAIDs that can emulate a physical RAID topology and providing parity data diversity. As an example, a VRAID can emulate RAID4 and can provide RAID5, RAID6, etc., parity diversity.
At 740, method 700 can comprise enabling storage of non-parity data via the first physical extents according to the first virtual extents and storage of parity data via the second physical extents according to the second virtual extents. At this point method 700 can end. In an aspect, non-parity data, e.g., data for storage in RAID system 104, 404, etc., and parity data can be stored via element(s) of PSDP according to a VRAID supported by VSDP. In an aspect, parity data can be stored by real extents, mapped to virtual extents, which can be correspondingly designated for storage of parity data, e.g., a parity_extent can store parity data, which can enable historical tracking of extents designated for storing parity data. In an aspect, this can enable wear leveling, e.g., by allocating VRAIDs in a manner that balances wear via distributing a parity_extent(s), by active wear balancing, or combinations thereof.
At 820, method 800 can comprise designating first physical extents for non-parity data storage and designating second physical extents for parity data storage based on historical wear data for storage elements comprising the physical extents. As in method 700, extents of the disks of PSDP in method 800 can be segregated into extents that can store parity data, extents that can store non-parity data, and as yet unassigned extents. This can enable tracking of extents by the type of data they can store, e.g., parity or non-parity. Accordingly, where updating of parity type data storage is typically greater than for non-parity, wear of parity storage extents can be determined to be greater than for non-parity. Where an extent can have already been used to store parity data, e.g., based on historical wear data that can track previous use of an extent for parity data storage, a ranking can be decremented such that the extent can be less likely to be reselected for storing parity data in a VRAID. Historical wear data can therefore act as a metric that can support proactive wear leveling by preferably selecting less worn extents, e.g., extents that have had less previous use storing parity data, for provisioning into a VRAID.
At 830, method 800 can comprise determining a VRAID based on the VSDP, wherein the VRAID comprises first virtual extents that map to the first physical extents and second virtual extents that map to the second physical extents. Mapping of VSDP from PSDP can be contiguous and/or non-contiguous. VSDP can support one or more VRAIDs that can emulate a physical RAID topology and providing parity data diversity. As an example, a VRAID can emulate RAID4 and can provide RAID5, RAID6, etc., parity diversity.
At 840, method 800 can comprise enabling storage of non-parity data via the first physical extents according to the first virtual extents and storage of parity data via the second physical extents according to the second virtual extents. In an aspect, non-parity data, e.g., data for storage in RAID system 104, 404, etc., and parity data can be stored via element(s) of PSDP according to a VRAID supported by VSDP. In an aspect, parity data can be stored by real extents, mapped to virtual extents, which can be correspondingly designated for storage of parity data, e.g., a parity_extent can store parity data, which can enable historical tracking of extents designated for storing parity data. In an aspect, this can enable wear leveling, e.g., by allocating VRAIDs in a manner that balances wear via distributing a parity_extent(s), by active wear balancing, or combinations thereof.
At 850, method 800 can comprise adapting a composition of virtual extents comprising the second virtual extents based on a level of wear of a virtual extent of the second virtual extents being determined to have transitioned a threshold wear value, e.g., active wear leveling. At this point method 800 can end. In an aspect, where historical wear data can enable proactive wear leveling via selection of less worn extents as parity data stores in a VRAID, active wear leveling can address adapting which extents are employed by an existing VRAID to store parity data. In an aspect, an existing VRAID can already have been assigned proactively wear leveled extents and can have used those assigned extents to a point where the wear on those extents, resulting from updating parity data, can have transitioned a threshold level. Accordingly, the extents can be updated to transition parity data to a less worn extent, e.g., via active wear leveling. Active wear leveling can be in addition to proactive wear leveling. AS an example of active wear leveling, an existing VRAID that can use a first extent for parity data for a comparatively long period of time can experience threshold levels of wear on the first extent. In this example, a second extent with a low level of wear can be assigned to the existing VRAID and parity data can be transitioned from the first extent to the second extent such that the VRAID with the second extent in lieu of the first extent can comprise less worn extents.
The system 900 also comprises one or more local component(s) 920. The local component(s) 920 can be hardware and/or software (e.g., threads, processes, computing devices). In some embodiments, local component(s) 920 can be physical disks, or extents thereof, in communication with other physical disks that can be located in a same physical location, e.g., different disks in a same server rack, same data center, etc.
One possible communication between a remote component(s) 910 and a local component(s) 920 can be in the form of a data packet adapted to be transmitted between two or more computer processes. Another possible communication between a remote component(s) 910 and a local component(s) 920 can be in the form of circuit-switched data adapted to be transmitted between two or more computer processes in radio time slots. The system 900 comprises a communication framework 940 that can be employed to facilitate communications between the remote component(s) 910 and the local component(s) 920, and can comprise an air interface, e.g., Uu interface of a UMTS network, via a long-term evolution (LTE) network, etc. Remote component(s) 910 can be operably connected to one or more remote data store(s) 950, such as a hard drive, solid state drive (SSD), SIM card, device memory, etc., that can be employed to store information on the remote component(s) 910 side of communication framework 940. Similarly, local component(s) 920 can be operably connected to one or more local data store(s) 930, that can be employed to store information on the local component(s) 920 side of communication framework 940. As an example, remote and local real nodes can communicate KPIs, move stored data between local and remote real nodes, such as when a mapping of mapped clusters to a real cluster is updated based on affinity score, etc.
In order to provide a context for the various aspects of the disclosed subject matter,
In the subject specification, terms such as “store,” “storage,” “data store,” data storage,” “database,” and substantially any other information storage component relevant to operation and functionality of a component, refer to “memory components,” or entities embodied in a “memory” or components comprising the memory. It is noted that the memory components described herein can be either volatile memory or nonvolatile memory, or can comprise both volatile and nonvolatile memory, by way of illustration, and not limitation, volatile memory 1020 (see below), non-volatile memory 1022 (see below), disk storage 1024 (see below), and memory storage 1046 (see below). Further, nonvolatile memory can be included in read only memory, programmable read only memory, electrically programmable read only memory, electrically erasable read only memory, or flash memory. Volatile memory can comprise random access memory, which acts as external cache memory. By way of illustration and not limitation, random access memory is available in many forms such as synchronous random access memory, dynamic random access memory, synchronous dynamic random access memory, double data rate synchronous dynamic random access memory, enhanced synchronous dynamic random access memory, SynchLink dynamic random access memory, and direct Rambus random access memory. Additionally, the disclosed memory components of systems or methods herein are intended to comprise, without being limited to comprising, these and any other suitable types of memory.
Moreover, it is noted that the disclosed subject matter can be practiced with other computer system configurations, comprising single-processor or multiprocessor computer systems, mini-computing devices, mainframe computers, as well as personal computers, hand-held computing devices (e.g., personal digital assistant, phone, watch, tablet computers, netbook computers, . . . ), microprocessor-based or programmable consumer or industrial electronics, and the like. The illustrated aspects can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network; however, some if not all aspects of the subject disclosure can be practiced on stand-alone computers. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
System bus 1018 can be any of several types of bus structure(s) comprising a memory bus or a memory controller, a peripheral bus or an external bus, and/or a local bus using any variety of available bus architectures comprising, but not limited to, industrial standard architecture, micro-channel architecture, extended industrial standard architecture, intelligent drive electronics, video electronics standards association local bus, peripheral component interconnect, card bus, universal serial bus, advanced graphics port, personal computer memory card international association bus, Firewire (Institute of Electrical and Electronics Engineers 1194), and small computer systems interface.
System memory 1016 can comprise volatile memory 1020 and nonvolatile memory 1022. A basic input/output system, containing routines to transfer information between elements within computer 1012, such as during start-up, can be stored in nonvolatile memory 1022. By way of illustration, and not limitation, nonvolatile memory 1022 can comprise read only memory, programmable read only memory, electrically programmable read only memory, electrically erasable read only memory, or flash memory. Volatile memory 1020 comprises read only memory, which acts as external cache memory. By way of illustration and not limitation, read only memory is available in many forms such as synchronous random access memory, dynamic read only memory, synchronous dynamic read only memory, double data rate synchronous dynamic read only memory, enhanced synchronous dynamic read only memory, SynchLink dynamic read only memory, Rambus direct read only memory, direct Rambus dynamic read only memory, and Rambus dynamic read only memory.
Computer 1012 can also comprise removable/non-removable, volatile/non-volatile computer storage media.
Computing devices typically comprise a variety of media, which can comprise computer-readable storage media or communications media, which two terms are used herein differently from one another as follows.
Computer-readable storage media can be any available storage media that can be accessed by the computer and comprises both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer-readable storage media can be implemented in connection with any method or technology for storage of information such as computer-readable instructions, program modules, structured data, or unstructured data. Computer-readable storage media can comprise, but are not limited to, read only memory, programmable read only memory, electrically programmable read only memory, electrically erasable read only memory, flash memory or other memory technology, compact disk read only memory, digital versatile disk or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or other tangible media which can be used to store desired information. In this regard, the term “tangible” herein as may be applied to storage, memory or computer-readable media, is to be understood to exclude only propagating intangible signals per se as a modifier and does not relinquish coverage of all standard storage, memory or computer-readable media that are not only propagating intangible signals per se. In an aspect, tangible media can comprise non-transitory media wherein the term “non-transitory” herein as may be applied to storage, memory or computer-readable media, is to be understood to exclude only propagating transitory signals per se as a modifier and does not relinquish coverage of all standard storage, memory or computer-readable media that are not only propagating transitory signals per se. Computer-readable storage media can be accessed by one or more local or remote computing devices, e.g., via access requests, queries or other data retrieval protocols, for a variety of operations with respect to the information stored by the medium. As such, for example, a computer-readable medium can comprise executable instructions stored thereon that, in response to execution, can cause a system comprising a processor to perform operations, comprising determining a VRAID based on a VSDP that is mapped to a PSDP, wherein the PSDP comprises physical disks comprising physical extents, and wherein the VRAID comprises first virtual extents that map to first physical extents to enable non-parity data storage and second virtual extents that map to second physical extents to enable parity data storage. The example operations can further comprise permitting storage of non-parity data via the first physical extents according to the first virtual extents and storage of parity data via the second physical extents according to the second virtual extents.
Communications media typically embody computer-readable instructions, data structures, program modules or other structured or unstructured data in a data signal such as a modulated data signal, e.g., a carrier wave or other transport mechanism, and comprises any information delivery or transport media. The term “modulated data signal” or signals refers to a signal that has one or more of its characteristics set or changed in such a manner as to encode information in one or more signals. By way of example, and not limitation, communication media comprise wired media, such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media.
It can be noted that
A user can enter commands or information into computer 1012 through input device(s) 1036. In some embodiments, a user interface can allow entry of user preference information, etc., and can be embodied in a touch sensitive display panel, a mouse/pointer input to a graphical user interface (GUI), a command line controlled interface, etc., allowing a user to interact with computer 1012. Input devices 1036 comprise, but are not limited to, a pointing device such as a mouse, trackball, stylus, touch pad, keyboard, microphone, joystick, game pad, satellite dish, scanner, TV tuner card, digital camera, digital video camera, web camera, cell phone, smartphone, tablet computer, etc. These and other input devices connect to processing unit 1014 through system bus 1018 by way of interface port(s) 1038. Interface port(s) 1038 comprise, for example, a serial port, a parallel port, a game port, a universal serial bus, an infrared port, a Bluetooth port, an IP port, or a logical port associated with a wireless service, etc. Output device(s) 1040 use some of the same type of ports as input device(s) 1036.
Thus, for example, a universal serial busport can be used to provide input to computer 1012 and to output information from computer 1012 to an output device 1040. Output adapter 1042 is provided to illustrate that there are some output devices 1040 like monitors, speakers, and printers, among other output devices 1040, which use special adapters. Output adapters 1042 comprise, by way of illustration and not limitation, video and sound cards that provide means of connection between output device 1040 and system bus 1018. It should be noted that other devices and/or systems of devices provide both input and output capabilities such as remote computer(s) 1044.
Computer 1012 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1044. Remote computer(s) 1044 can be a personal computer, a server, a router, a network PC, cloud storage, a cloud service, code executing in a cloud-computing environment, a workstation, a microprocessor-based appliance, a peer device, or other common network node and the like, and typically comprises many or all of the elements described relative to computer 1012. A cloud computing environment, the cloud, or other similar terms can refer to computing that can share processing resources and data to one or more computer and/or other device(s) on an as needed basis to enable access to a shared pool of configurable computing resources that can be provisioned and released readily. Cloud computing and storage solutions can store and/or process data in third-party data centers which can leverage an economy of scale and can view accessing computing resources via a cloud service in a manner similar to a subscribing to an electric utility to access electrical energy, a telephone utility to access telephonic services, etc.
For purposes of brevity, only a memory storage device 1046 is illustrated with remote computer(s) 1044. Remote computer(s) 1044 is logically connected to computer 1012 through a network interface 1048 and then physically connected by way of communication connection 1050. Network interface 1048 encompasses wire and/or wireless communication networks such as local area networks and wide area networks. Local area network technologies comprise fiber distributed data interface, copper distributed data interface, Ethernet, Token Ring and the like. Wide area network technologies comprise, but are not limited to, point-to-point links, circuit-switching networks like integrated services digital networks and variations thereon, packet switching networks, and digital subscriber lines. As noted below, wireless technologies may be used in addition to or in place of the foregoing.
Communication connection(s) 1050 refer(s) to hardware/software employed to connect network interface 1048 to bus 1018. While communication connection 1050 is shown for illustrative clarity inside computer 1012, it can also be external to computer 1012. The hardware/software for connection to network interface 1048 can comprise, for example, internal and external technologies such as modems, comprising regular telephone grade modems, cable modems and digital subscriber line modems, integrated services digital network adapters, and Ethernet cards.
The above description of illustrated embodiments of the subject disclosure, comprising what is described in the Abstract, is not intended to be exhaustive or to limit the disclosed embodiments to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various modifications are possible that are considered within the scope of such embodiments and examples, as those skilled in the relevant art can recognize.
In this regard, while the disclosed subject matter has been described in connection with various embodiments and corresponding Figures, where applicable, it is to be understood that other similar embodiments can be used or modifications and additions can be made to the described embodiments for performing the same, similar, alternative, or substitute function of the disclosed subject matter without deviating therefrom. Therefore, the disclosed subject matter should not be limited to any single embodiment described herein, but rather should be construed in breadth and scope in accordance with the appended claims below.
As it employed in the subject specification, the term “processor” can refer to substantially any computing processing unit or device comprising, but not limited to comprising, single-core processors; single-processors with software multithread execution capability; multi-core processors; multi-core processors with software multithread execution capability; multi-core processors with hardware multithread technology; parallel platforms; and parallel platforms with distributed shared memory. Additionally, a processor can refer to an integrated circuit, an application specific integrated circuit, a digital signal processor, a field programmable gate array, a programmable logic controller, a complex programmable logic device, a discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. Processors can exploit nano-scale architectures such as, but not limited to, molecular and quantum-dot based transistors, switches and gates, in order to optimize space usage or enhance performance of user equipment. A processor may also be implemented as a combination of computing processing units.
As used in this application, the terms “component,” “system,” “platform,” “layer,” “selector,” “interface,” and the like are intended to refer to a computer-related entity or an entity related to an operational apparatus with one or more specific functionalities, wherein the entity can be either hardware, a combination of hardware and software, software, or software in execution. As an example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration and not limitation, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate via local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems via the signal). As another example, a component can be an apparatus with specific functionality provided by mechanical parts operated by electric or electronic circuitry, which is operated by a software or a firmware application executed by a processor, wherein the processor can be internal or external to the apparatus and executes at least a part of the software or firmware application. As yet another example, a component can be an apparatus that provides specific functionality through electronic components without mechanical parts, the electronic components can comprise a processor therein to execute software or firmware that confers at least in part the functionality of the electronic components.
In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then “X employs A or B” is satisfied under any of the foregoing instances. Moreover, articles “a” and “an” as used in the subject specification and annexed drawings should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Moreover, the use of any particular embodiment or example in the present disclosure should not be treated as exclusive of any other particular embodiment or example, unless expressly indicated as such, e.g., a first embodiment that has aspect A and a second embodiment that has aspect B does not preclude a third embodiment that has aspect A and aspect B. The use of granular examples and embodiments is intended to simplify understanding of certain features, aspects, etc., of the disclosed subject matter and is not intended to limit the disclosure to said granular instances of the disclosed subject matter or to illustrate that combinations of embodiments of the disclosed subject matter were not contemplated at the time of actual or constructive reduction to practice.
Further, the term “include” is intended to be employed as an open or inclusive term, rather than a closed or exclusive term. The term “include” can be substituted with the term “comprising” and is to be treated with similar scope, unless otherwise explicitly used otherwise. As an example, “a basket of fruit including an apple” is to be treated with the same breadth of scope as, “a basket of fruit comprising an apple.”
Furthermore, the terms “user,” “subscriber,” “customer,” “consumer,” “prosumer,” “agent,” and the like are employed interchangeably throughout the subject specification, unless context warrants particular distinction(s) among the terms. It should be appreciated that such terms can refer to human entities, machine learning components, or automated components (e.g., supported through artificial intelligence, as through a capacity to make inferences based on complex mathematical formalisms), that can provide simulated vision, sound recognition and so forth.
Aspects, features, or advantages of the subject matter can be exploited in substantially any, or any, wired, broadcast, wireless telecommunication, radio technology or network, or combinations thereof. Non-limiting examples of such technologies or networks comprise broadcast technologies (e.g., sub-Hertz, extremely low frequency, very low frequency, low frequency, medium frequency, high frequency, very high frequency, ultra-high frequency, super-high frequency, extremely high frequency, terahertz broadcasts, etc.); Ethernet; X.25; powerline-type networking, e.g., Powerline audio video Ethernet, etc.; femtocell technology; Wi-Fi; worldwide interoperability for microwave access; enhanced general packet radio service; second generation partnership project (2G or 2GPP); third generation partnership project (3G or 3GPP); fourth generation partnership project (4G or 4GPP); long term evolution (LTE); fifth generation partnership project (5G or 5GPP); third generation partnership project universal mobile telecommunications system; third generation partnership project 2; ultra mobile broadband; high speed packet access; high speed downlink packet access; high speed uplink packet access; enhanced data rates for global system for mobile communication evolution radio access network; universal mobile telecommunications system terrestrial radio access network; or long term evolution advanced. As an example, a millimeter wave broadcast technology can employ electromagnetic waves in the frequency spectrum from about 30 GHz to about 300 GHz. These millimeter waves can be generally situated between microwaves (from about 1 GHz to about 30 GHz) and infrared (IR) waves, and are sometimes referred to extremely high frequency (EHF). The wavelength (λ) for millimeter waves is typically in the 1-mm to 10-mm range.
The term “infer” or “inference” can generally refer to the process of reasoning about, or inferring states of, the system, environment, user, and/or intent from a set of observations as captured via events and/or data. Captured data and events can include user data, device data, environment data, data from sensors, sensor data, application data, implicit data, explicit data, etc. Inference, for example, can be employed to identify a specific context or action, or can generate a probability distribution over states of interest based on a consideration of data and events. Inference can also refer to techniques employed for composing higher-level events from a set of events and/or data. Such inference results in the construction of new events or actions from a set of observed events and/or stored event data, whether the events, in some instances, can be correlated in close temporal proximity, and whether the events and data come from one or several event and data sources. Various classification schemes and/or systems (e.g., support vector machines, neural networks, expert systems, Bayesian belief networks, fuzzy logic, and data fusion engines) can be employed in connection with performing automatic and/or inferred action in connection with the disclosed subject matter.
What has been described above includes examples of systems and methods illustrative of the disclosed subject matter. It is, of course, not possible to describe every combination of components or methods herein. One of ordinary skill in the art may recognize that many further combinations and permutations of the claimed subject matter are possible. Furthermore, to the extent that the terms “includes,” “has,” “possesses,” and the like are used in the detailed description, claims, appendices and drawings such terms are intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.
Number | Name | Date | Kind |
---|---|---|---|
5675802 | Allen et al. | Oct 1997 | A |
5805788 | Johnson | Sep 1998 | A |
5950225 | Kleiman | Sep 1999 | A |
6065020 | Dussud | May 2000 | A |
6073218 | DeKoning et al. | Jun 2000 | A |
6108684 | DeKoning et al. | Aug 2000 | A |
6233696 | Kedem | May 2001 | B1 |
6240527 | Schneider et al. | May 2001 | B1 |
6502243 | Thomas | Dec 2002 | B1 |
6549921 | Ofek | Apr 2003 | B1 |
7007044 | Rafert et al. | Feb 2006 | B1 |
7103884 | Fellin et al. | Sep 2006 | B2 |
7389393 | Karr et al. | Jun 2008 | B1 |
7577091 | Antal et al. | Aug 2009 | B2 |
7631051 | Fein et al. | Dec 2009 | B1 |
7636814 | Karr | Dec 2009 | B1 |
7653792 | Shimada et al. | Jan 2010 | B2 |
7664839 | Karr et al. | Feb 2010 | B1 |
7680875 | Shopiro et al. | Mar 2010 | B1 |
7694191 | Bono et al. | Apr 2010 | B1 |
7721044 | Chatterjee et al. | May 2010 | B1 |
7752403 | Weinman, Jr. | Jul 2010 | B1 |
7895394 | Nakajima et al. | Feb 2011 | B2 |
8125406 | Jensen et al. | Feb 2012 | B1 |
8261033 | Slik et al. | Sep 2012 | B1 |
8370542 | Lu et al. | Feb 2013 | B2 |
8429514 | Goel | Apr 2013 | B1 |
8479037 | Chatterjee et al. | Jul 2013 | B1 |
8495465 | Anholt et al. | Jul 2013 | B1 |
8504518 | Ghemawat et al. | Aug 2013 | B1 |
8540625 | Miyoshi | Sep 2013 | B2 |
8683205 | Resch et al. | Mar 2014 | B2 |
8725986 | Goel | May 2014 | B1 |
8751599 | Tran et al. | Jun 2014 | B2 |
8751740 | De Forest et al. | Jun 2014 | B1 |
8751897 | Borthakur et al. | Jun 2014 | B2 |
8799746 | Baker et al. | Aug 2014 | B2 |
8832234 | Brooker et al. | Sep 2014 | B1 |
8856619 | Cypher | Oct 2014 | B1 |
8856624 | Paniconi | Oct 2014 | B1 |
8892938 | Sundaram et al. | Nov 2014 | B1 |
8972478 | Storer et al. | Mar 2015 | B1 |
9003086 | Schuller et al. | Apr 2015 | B1 |
9021296 | Kiselev et al. | Apr 2015 | B1 |
9037825 | Donlan et al. | May 2015 | B1 |
9052942 | Barber et al. | Jun 2015 | B1 |
9063838 | Boyle et al. | Jun 2015 | B1 |
9098447 | Donlan et al. | Aug 2015 | B1 |
9128910 | Dayal et al. | Sep 2015 | B1 |
9208009 | Resch et al. | Dec 2015 | B2 |
9218135 | Miller et al. | Dec 2015 | B2 |
9244761 | Yekhanin et al. | Jan 2016 | B2 |
9268783 | Shilane et al. | Feb 2016 | B1 |
9274903 | Garlapati et al. | Mar 2016 | B1 |
9280430 | Sarfare et al. | Mar 2016 | B2 |
9405483 | Wei et al. | Aug 2016 | B1 |
9411717 | Goss et al. | Aug 2016 | B2 |
9442802 | Hung | Sep 2016 | B2 |
9477682 | Bent et al. | Oct 2016 | B1 |
9495241 | Flynn et al. | Nov 2016 | B2 |
9619256 | Natanzon et al. | Apr 2017 | B1 |
9641615 | Robins et al. | May 2017 | B1 |
9665428 | Vairavanathan et al. | May 2017 | B2 |
9747057 | Ramani et al. | Aug 2017 | B1 |
9817713 | Gupta et al. | Nov 2017 | B2 |
9864527 | Srivastav et al. | Jan 2018 | B1 |
9942084 | Sorenson, III | Apr 2018 | B1 |
9971649 | Dhuse et al. | May 2018 | B2 |
10001947 | Chatterjee et al. | Jun 2018 | B1 |
10007561 | Pudipeddi et al. | Jun 2018 | B1 |
10055145 | Danilov et al. | Aug 2018 | B1 |
10061668 | Lazier et al. | Aug 2018 | B1 |
10089026 | Puhov | Oct 2018 | B1 |
10097659 | Rao | Oct 2018 | B1 |
10108819 | Donlan et al. | Oct 2018 | B1 |
10127234 | Krishnan et al. | Nov 2018 | B1 |
10216770 | Kulesza et al. | Feb 2019 | B1 |
10242022 | Jain et al. | Mar 2019 | B1 |
10282262 | Panara et al. | May 2019 | B2 |
10289488 | Danilov et al. | May 2019 | B1 |
10331516 | Danilov et al. | Jun 2019 | B2 |
10361810 | Myung et al. | Jul 2019 | B2 |
10387546 | Duran et al. | Aug 2019 | B1 |
10496330 | Bernat et al. | Dec 2019 | B1 |
10503611 | Srivastav et al. | Dec 2019 | B1 |
10567009 | Yang et al. | Feb 2020 | B2 |
10579490 | Danilov et al. | Mar 2020 | B2 |
10613780 | Naeni et al. | Apr 2020 | B1 |
10628043 | Chatterjee et al. | Apr 2020 | B1 |
10644408 | Sakai et al. | May 2020 | B2 |
10671431 | Dolan et al. | Jun 2020 | B1 |
10705911 | Vishnumolakala et al. | Jul 2020 | B2 |
10733053 | Miller et al. | Aug 2020 | B1 |
10740183 | Blaum et al. | Aug 2020 | B1 |
10754845 | Danilov et al. | Aug 2020 | B2 |
10761931 | Goyal et al. | Sep 2020 | B2 |
10797863 | Chen et al. | Oct 2020 | B2 |
10846003 | Danilov et al. | Nov 2020 | B2 |
10924543 | Chen et al. | Feb 2021 | B1 |
10951236 | Chen et al. | Mar 2021 | B2 |
11023331 | Danilov et al. | Jun 2021 | B2 |
11150995 | Dhoolam et al. | Oct 2021 | B1 |
20020049883 | Schneider et al. | Apr 2002 | A1 |
20020166026 | Ulrich et al. | Nov 2002 | A1 |
20020191311 | Ulrich et al. | Dec 2002 | A1 |
20030016596 | Chiquoine et al. | Jan 2003 | A1 |
20050027938 | Burkey | Feb 2005 | A1 |
20050071546 | Delaney et al. | Mar 2005 | A1 |
20050080982 | Vasilevsky et al. | Apr 2005 | A1 |
20050088318 | Liu et al. | Apr 2005 | A1 |
20050108775 | Bachar et al. | May 2005 | A1 |
20050140529 | Choi et al. | Jun 2005 | A1 |
20050234941 | Watanabe | Oct 2005 | A1 |
20060047896 | Nguyen et al. | Mar 2006 | A1 |
20060075007 | Anderson et al. | Apr 2006 | A1 |
20060143508 | Mochizuki et al. | Jun 2006 | A1 |
20060212744 | Benner et al. | Sep 2006 | A1 |
20060265211 | Canniff et al. | Nov 2006 | A1 |
20070076321 | Takahashi et al. | Apr 2007 | A1 |
20070239759 | Shen et al. | Oct 2007 | A1 |
20070250674 | Findberg et al. | Oct 2007 | A1 |
20080222480 | Huang et al. | Sep 2008 | A1 |
20080222481 | Huang et al. | Sep 2008 | A1 |
20080244353 | Dholakia et al. | Oct 2008 | A1 |
20080320061 | Aszmann et al. | Dec 2008 | A1 |
20090070771 | Yuyitung et al. | Mar 2009 | A1 |
20090113034 | Krishnappa et al. | Apr 2009 | A1 |
20090132543 | Chatley et al. | May 2009 | A1 |
20090172464 | Byrne et al. | Jul 2009 | A1 |
20090183056 | Aston | Jul 2009 | A1 |
20090204959 | Anand et al. | Aug 2009 | A1 |
20090240880 | Kawaguchi | Sep 2009 | A1 |
20090259882 | Shellhamer | Oct 2009 | A1 |
20100031060 | Chew et al. | Feb 2010 | A1 |
20100094963 | Zuckerman et al. | Apr 2010 | A1 |
20100174968 | Charles et al. | Jul 2010 | A1 |
20100218037 | Swartz et al. | Aug 2010 | A1 |
20100293348 | Ye et al. | Nov 2010 | A1 |
20100332748 | Van der Goot et al. | Dec 2010 | A1 |
20110029836 | Dhuse et al. | Feb 2011 | A1 |
20110040937 | Augenstein et al. | Feb 2011 | A1 |
20110066882 | Walls | Mar 2011 | A1 |
20110106972 | Grube et al. | May 2011 | A1 |
20110107165 | Resch et al. | May 2011 | A1 |
20110138148 | Friedman et al. | Jun 2011 | A1 |
20110161712 | Athalye et al. | Jun 2011 | A1 |
20110191536 | Mizuno | Aug 2011 | A1 |
20110196833 | Drobychev et al. | Aug 2011 | A1 |
20110246503 | Bender et al. | Oct 2011 | A1 |
20110292054 | Boker et al. | Dec 2011 | A1 |
20120023291 | Zeng et al. | Jan 2012 | A1 |
20120096214 | Lu et al. | Apr 2012 | A1 |
20120191675 | Kim et al. | Jul 2012 | A1 |
20120191901 | Norair | Jul 2012 | A1 |
20120204077 | D'Abreu et al. | Aug 2012 | A1 |
20120233117 | Holt et al. | Sep 2012 | A1 |
20120311395 | Leggette et al. | Dec 2012 | A1 |
20120317234 | Bohrer et al. | Dec 2012 | A1 |
20120321052 | Morrill et al. | Dec 2012 | A1 |
20130013564 | Ben-Or et al. | Jan 2013 | A1 |
20130047187 | Frazier et al. | Feb 2013 | A1 |
20130054822 | Mordani et al. | Feb 2013 | A1 |
20130067159 | Mehra | Mar 2013 | A1 |
20130067187 | Moss et al. | Mar 2013 | A1 |
20130088501 | Fell | Apr 2013 | A1 |
20130097470 | Hwang et al. | Apr 2013 | A1 |
20130145208 | Yen et al. | Jun 2013 | A1 |
20130238932 | Resch | Sep 2013 | A1 |
20130246876 | Manssour et al. | Sep 2013 | A1 |
20130290482 | Leggette | Oct 2013 | A1 |
20130305365 | Rubin et al. | Nov 2013 | A1 |
20140040417 | Galdwin et al. | Feb 2014 | A1 |
20140064048 | Cohen et al. | Mar 2014 | A1 |
20140082414 | Olster | Mar 2014 | A1 |
20140115182 | Sabaa et al. | Apr 2014 | A1 |
20140122745 | Singh | May 2014 | A1 |
20140149794 | Shetty et al. | May 2014 | A1 |
20140164430 | Hadjieleftheriou et al. | Jun 2014 | A1 |
20140164694 | Storer | Jun 2014 | A1 |
20140172930 | Molaro et al. | Jun 2014 | A1 |
20140250450 | Yu et al. | Sep 2014 | A1 |
20140280375 | Rawson et al. | Sep 2014 | A1 |
20140281804 | Resch | Sep 2014 | A1 |
20140297955 | Yamazaki et al. | Oct 2014 | A1 |
20140304460 | Carlson, Jr. et al. | Oct 2014 | A1 |
20140331100 | Dhuse et al. | Nov 2014 | A1 |
20140351633 | Grube et al. | Nov 2014 | A1 |
20140358972 | Guarrieri et al. | Dec 2014 | A1 |
20140359244 | Chambliss et al. | Dec 2014 | A1 |
20140380088 | Bennett et al. | Dec 2014 | A1 |
20140380093 | Molaro et al. | Dec 2014 | A1 |
20140380125 | Calder et al. | Dec 2014 | A1 |
20140380126 | Yekhanin et al. | Dec 2014 | A1 |
20150006846 | Youngworth | Jan 2015 | A1 |
20150074065 | Christ et al. | Mar 2015 | A1 |
20150112951 | Narayanamurthy et al. | Apr 2015 | A1 |
20150134626 | Theimer et al. | May 2015 | A1 |
20150142863 | Yuen et al. | May 2015 | A1 |
20150160872 | Chen | Jun 2015 | A1 |
20150178007 | Moisa et al. | Jun 2015 | A1 |
20150186043 | Kesselman et al. | Jul 2015 | A1 |
20150254150 | Gordon et al. | Sep 2015 | A1 |
20150269025 | Krishnamurthy et al. | Sep 2015 | A1 |
20150303949 | Jafarkhani et al. | Oct 2015 | A1 |
20150331766 | Sarfare et al. | Nov 2015 | A1 |
20150370656 | Tsafrir et al. | Dec 2015 | A1 |
20150378542 | Saito et al. | Dec 2015 | A1 |
20160011935 | Luby | Jan 2016 | A1 |
20160011936 | Luby | Jan 2016 | A1 |
20160055054 | Patterson, III et al. | Feb 2016 | A1 |
20160085645 | Buzzard et al. | Mar 2016 | A1 |
20160162378 | Garlapati et al. | Jun 2016 | A1 |
20160169692 | Gupta | Jun 2016 | A1 |
20160170668 | Mehra | Jun 2016 | A1 |
20160217104 | Kamble et al. | Jul 2016 | A1 |
20160232055 | Vairavanathan et al. | Aug 2016 | A1 |
20160239384 | Slik | Aug 2016 | A1 |
20160253400 | McAlister et al. | Sep 2016 | A1 |
20160277497 | Bannister et al. | Sep 2016 | A1 |
20160292429 | Bannister et al. | Sep 2016 | A1 |
20160294419 | Sandell et al. | Oct 2016 | A1 |
20160328295 | Baptist et al. | Nov 2016 | A1 |
20160357443 | Li et al. | Dec 2016 | A1 |
20160357649 | Karrotu et al. | Dec 2016 | A1 |
20160371145 | Akutsu et al. | Dec 2016 | A1 |
20160378624 | Jenkins, Jr. et al. | Dec 2016 | A1 |
20160380650 | Calder et al. | Dec 2016 | A1 |
20170003880 | Fisher et al. | Jan 2017 | A1 |
20170004044 | Tormasov et al. | Jan 2017 | A1 |
20170010944 | Saito | Jan 2017 | A1 |
20170017671 | Baptist et al. | Jan 2017 | A1 |
20170031945 | Sarab et al. | Feb 2017 | A1 |
20170097875 | Jess et al. | Apr 2017 | A1 |
20170102993 | Hu et al. | Apr 2017 | A1 |
20170115903 | Franke | Apr 2017 | A1 |
20170116088 | Anami et al. | Apr 2017 | A1 |
20170123914 | Li et al. | May 2017 | A1 |
20170153946 | Baptist et al. | Jun 2017 | A1 |
20170185331 | Gao | Jun 2017 | A1 |
20170187398 | Trusov | Jun 2017 | A1 |
20170187766 | Zheng et al. | Jun 2017 | A1 |
20170206025 | Viswanathan | Jul 2017 | A1 |
20170206135 | Zeng | Jul 2017 | A1 |
20170212680 | Waghulde | Jul 2017 | A1 |
20170212845 | Conway | Jul 2017 | A1 |
20170220662 | Barton et al. | Aug 2017 | A1 |
20170235507 | Sinha et al. | Aug 2017 | A1 |
20170262187 | Manzanares et al. | Sep 2017 | A1 |
20170268900 | Nicolaas et al. | Sep 2017 | A1 |
20170272209 | Yanovsky et al. | Sep 2017 | A1 |
20170285952 | Danilov et al. | Oct 2017 | A1 |
20170286009 | Danilov et al. | Oct 2017 | A1 |
20170286436 | Neporada et al. | Oct 2017 | A1 |
20170286516 | Horowitz et al. | Oct 2017 | A1 |
20170288701 | Slik et al. | Oct 2017 | A1 |
20170344285 | Choi et al. | Nov 2017 | A1 |
20180032279 | Davis et al. | Feb 2018 | A1 |
20180052744 | Chen et al. | Feb 2018 | A1 |
20180063213 | Bevilacqua-Linn et al. | Mar 2018 | A1 |
20180074753 | Ober | Mar 2018 | A1 |
20180074881 | Burden | Mar 2018 | A1 |
20180088857 | Gao | Mar 2018 | A1 |
20180107415 | Motwani et al. | Apr 2018 | A1 |
20180121286 | Sipos | May 2018 | A1 |
20180129417 | Sivasubramanian et al. | May 2018 | A1 |
20180129600 | Ishiyama | May 2018 | A1 |
20180181324 | Danilov et al. | Jun 2018 | A1 |
20180181475 | Danilov et al. | Jun 2018 | A1 |
20180181612 | Danilov et al. | Jun 2018 | A1 |
20180217888 | Colgrove et al. | Aug 2018 | A1 |
20180246668 | Sakashita et al. | Aug 2018 | A1 |
20180267856 | Hayasaka et al. | Sep 2018 | A1 |
20180267985 | Badey et al. | Sep 2018 | A1 |
20180293017 | Curley et al. | Oct 2018 | A1 |
20180306600 | Nicolaas et al. | Oct 2018 | A1 |
20180307560 | Vishnumolakala et al. | Oct 2018 | A1 |
20180341662 | He | Nov 2018 | A1 |
20180375936 | Chirammal et al. | Dec 2018 | A1 |
20190028179 | Kalhan | Jan 2019 | A1 |
20190034084 | Nagarajan et al. | Jan 2019 | A1 |
20190043201 | Strong et al. | Feb 2019 | A1 |
20190043351 | Yang et al. | Feb 2019 | A1 |
20190050301 | Juniwal et al. | Feb 2019 | A1 |
20190065092 | Shah et al. | Feb 2019 | A1 |
20190065310 | Rozas | Feb 2019 | A1 |
20190102103 | Ari et al. | Apr 2019 | A1 |
20190114223 | Pydipaty et al. | Apr 2019 | A1 |
20190129644 | Gao | May 2019 | A1 |
20190188079 | Kohli | Jun 2019 | A1 |
20190205437 | Larson et al. | Jul 2019 | A1 |
20190215017 | Danilov et al. | Jul 2019 | A1 |
20190220207 | Lingarajappa | Jul 2019 | A1 |
20190266062 | Borlick | Aug 2019 | A1 |
20190342418 | Eda et al. | Nov 2019 | A1 |
20190356416 | Yanovsky et al. | Nov 2019 | A1 |
20190384500 | Danilov et al. | Dec 2019 | A1 |
20190386683 | Danilov et al. | Dec 2019 | A1 |
20200004447 | Danilov et al. | Jan 2020 | A1 |
20200026810 | Subramaniam et al. | Jan 2020 | A1 |
20200034339 | Gershaneck et al. | Jan 2020 | A1 |
20200034471 | Danilov et al. | Jan 2020 | A1 |
20200042178 | Danilov et al. | Feb 2020 | A1 |
20200050510 | Chien et al. | Feb 2020 | A1 |
20200104377 | Earnesty, Jr. et al. | Apr 2020 | A1 |
20200117547 | Danilov et al. | Apr 2020 | A1 |
20200117556 | Zou et al. | Apr 2020 | A1 |
20200145511 | Gray et al. | May 2020 | A1 |
20200151353 | Struttmann | May 2020 | A1 |
20200204198 | Danilov et al. | Jun 2020 | A1 |
20210019067 | Miller et al. | Jan 2021 | A1 |
20210019093 | Karr et al. | Jan 2021 | A1 |
20210019237 | Karr et al. | Jan 2021 | A1 |
20210034268 | Hara et al. | Feb 2021 | A1 |
20210096754 | Danilov et al. | Apr 2021 | A1 |
20210132851 | Danilov et al. | May 2021 | A1 |
20210133049 | Danilov et al. | May 2021 | A1 |
20210218420 | Danilov et al. | Jul 2021 | A1 |
20210255791 | Shimada et al. | Aug 2021 | A1 |
20210273660 | Danilov et al. | Sep 2021 | A1 |
Entry |
---|
Non-Final Office Action received for U.S. Appl. No. 16/584,800 dated Mar. 3, 2022, 90 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/403,417 dated Feb. 25, 2022, 100 pages. |
Notice of Allowance dated May 16, 2022 for U.S. Appl. No. 16/526,182, 54 pages. |
Notice of Allowance received for U.S. Appl. No. 17/333,793 dated Mar. 9, 2022, 39 pages. |
Sun et al., “Data Management across Geographically-Distributed Autonomous Systems: Architecture, Implementation, and Performance Evaluation,” IEEE Transactions on Industrial Informatics, 2019, 9 pages. |
Office Action dated Sep. 3, 2021 for U.S. Appl. No. 16/803,913, 23 pages. |
Office Action dated Jan. 25, 2022 for U.S. Appl. No. 16/803,913, 25 pages. |
Office Action dated May 27, 2022 for U.S. Appl. No. 16/803,913, 24 pages. |
RAID vs. non-RAID Storage—Difference & Comparison, https://www.fromdev.com/2014/01/raid-vs-non-raid-storage-difference.html, pp. 1-4, 2014. (Year: 2014). |
Notice of Allowance received for U.S. Appl. No. 16/584,800 dated Jun. 27, 2022, 33 pages. |
Notice of Allowance received for U.S. Appl. No. 16/179,486 dated Jun. 8, 2022, 67 pages. |
Final Office Action received for U.S. Appl. No. 16/986,222 dated Jun. 17, 2022, 76 pages. |
Wu et al., “Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution,” 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006, pp. 207-217. |
Final Office Action received for U.S. Appl. No. 16/538,984 dated Jun. 1, 2022, 114 pages. |
Notice of Allowance received for U.S. Appl. No. 17/333,815 dated Jun. 27, 2022, 27 pages. |
Final Office Action dated Aug. 31, 2022 for U.S. Appl. No. 16/403,417, 37 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/403,417 dated Dec. 6, 2022, 39 pages. |
Notice of Allowance received for U.S. Appl. No. 16/986,222 dated Oct. 13, 2022, 37 pages. |
Files Controlling User Accounts and Groups. https://access.redhat.com/documentation/en-us/red_hat_enterprise_linux/4, 2012, pp. 1-2. (Year: 2012). |
Final Office Action received for U.S. Appl. No. 16/803,913 dated Oct. 26, 2022, 102 pages. |
Notice of Allowance received for U.S. Appl. No. 16/745,855 dated Sep. 10, 2021, 37 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/526,182 dated Nov. 24, 2021, 83 pages. |
Notice of Allowance received for U.S. Appl. No. 16/888,144 dated Nov. 22, 2021, 71 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/698,096 dated Jan. 5, 2022, 21 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/670,715 dated Jan. 5, 2022, 22 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/231,018 dated May 8, 2020, 78 pages. |
Notice of Allowance dated May 11, 2020 for U.S. Appl. No. 16/240,193, 24 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/228,624 dated Jun. 24, 2020, 65 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/240,272 dated Jun. 29, 2020, 64 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/228,612 dated Jun. 29, 2020, 62 pages. |
Final Office Action received for U.S. Appl. No. 16/010,255 dated Jul. 23, 2020, 36 pages. |
Office Action received for U.S. Appl. No. 16/010,246 dated Jul. 27, 2020 36 pages. |
Office Action received for U.S. Appl. No. 16/177,278, dated Aug. 21, 2020, 53 pages. |
Office Action received for U.S. Appl. No. 16/179,486, dated Aug. 13, 2020, 64 pages. |
Guo et al., “GeoScale: Providing Geo-Elasticity in Distributed Clouds” 2016 IEEE International Conference on Cloud Engineering, 4 pages. |
Guo et al., “Providing Geo-Elasticity in Geographically Distributed Clouds”. ACM Transactions on Internet Technology, vol. 18, No. 3, Article 38. Apr. 2018. 27 pages. |
Office Action received for U.S. Appl. No. 16/254,073, dated Aug. 18, 2020, 62 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/526,142 dated Oct. 15, 2020, 21 pages. |
Notice of Allowance received U.S. Appl. No. 16/228,612 dated Oct. 20, 2020, 84 pages. |
Zhou, et al. “Fast Erasure Coding for Data Storage: A Comprehensive Study of the Acceleration Techniques” Proceedings of the 17th Usenix Conference on File and Storage Technologies (FAST '19), [https://www.usenix.org/conference/fast19/presentation/zhou], Feb. 2019, Boston, MA, USA. 14 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/010,255 dated Oct. 29, 2020, 65 pages. |
Final Office Action received for U.S. Appl. No. 16/240,272 dated Oct. 27, 2020, 42 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/399,902 dated Oct. 28, 2020, 83 pages. |
Notice of Allowance received for U.S. Appl. No. 16/374,726 dated Nov. 20, 2020, 78 pages. |
Final Office Action received for U.S. Appl. No. 16/228,624 dated Dec. 1, 2020, 63 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/570,657 dated Nov. 27, 2020, 75 pages. |
Final Office Action received for U.S. Appl. No. 16/177,285 dated Dec. 30, 2020, 61 pages. |
Final Office Action received for U.S. Appl. No. 16/511,161 dated Dec. 30, 2020, 61 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/399,895 dated Jan. 4, 2021, 64 pages. |
Notice of Allowance received for U.S. Appl. No. 16/374,726 dated Jan. 6, 2021, 56 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/399,897 dated Feb. 19, 2021, 56 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/670,715 dated Mar. 31, 2021, 60 pages. |
Final Office Action received for U.S. Appl. No. 16/177,278 dated Feb. 24, 2021, 109 pages. |
Dell, “EMC ECS (Elastic Cloud Storage) Architectural Guide v2.x”, URL : https://www.dell.com/community/s/vjauj58549/attachments/vjauj58549/solutions-ch/477/1/h14071-ecs-architectural-guide-wp.pdf, H14071.1, Jun. 2015, pp. 1-21. |
Mohan et al., “Geo-aware erasure coding for high-performance erasure-coded storage clusters”, Annals of Telemmmunintions, vol. 73, Springer, Jan. 18, 2018, pp. 139-152. |
Final Office Action received for U.S. Appl. No. 16/179,486 dated Jan. 28, 2021, 55 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/670,746 dated Feb. 16, 2021, 55 pages. |
Jarvis, Zhu, “ECS Overview and Architecture”, Dell Technologies, h14071.18, Feb. 2021, pp. 1-55. |
EMC; “EMC ECS (Elastic Cloud Storage) Architectural Guide v2.x”, URL : https://www.dell.com/community/s/vjauj58549/attachments/vjauj58549/solutions-ch/477 /1/h14071-ecs-architectural-guide-wp.pdf, Jun. 2015, 21 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/177,285 dated Apr. 9, 2021, 41 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/779,208 dated Apr. 20, 2021, 71 pages. |
Notice of Allowance received for U.S. Appl. No. 16/726,428 dated Jun. 14, 2021, 34 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/698,096 dated May 24, 2021, 62 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/745,855 dated May 13, 2021, 71 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/834,649 dated Jun. 24, 2021, 61 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/179,486 dated May 12, 2021, 50 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/570,657 dated May 12, 2021, 79 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/670,765 dated Jul. 20, 2021, 79 pages. |
Thomasian et al., “Hierarchical RAID: Design, performance, reliability, and recovery”, J. Parallel Distrib. Compul. vol. 72 (2012) pp. 1753-1769. |
Notice of Allowance received for U.S. Appl. No. 16/570,657 dated Sep. 7, 2021, 65 pages. |
Ma et al., “An Ensemble of Replication and Erasure Codes for Cloud File Systems”, Proceedings—IEEE INFOCOM, Apr. 2013, pp. 1276-1284. |
Final Office Action received for U.S. Appl. No. 16/698,096 dated Sep. 7, 2021, 24 pages. |
Final Office Action received for U.S. Appl. No. 16/177,285 dated Sep. 14, 2021, 65 pages. |
Final Office Action received for U.S. Appl. No. 16/670,715 dated Sep. 7, 2021, 35 pages. |
Final Office Action received for U.S. Appl. No. 16/179,486 dated Oct. 20, 2021, 46 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/209,185 dated Jun. 18, 2020, 22 pages. |
Martin Hosken, Developing a Hyper-Converged Storage Strategy for VMware vCloud Director with VMware vSAN, Jan. 2018 (Year: 2018) |
Non-Final Office Action received for U.S. Appl. No. 16/261,549 dated Apr. 15, 2020, 22 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/374,726 dated Jun. 2, 2020, 47 pages. |
Natarajan, RAID 0, RAID 1, RAID 5, RAID 10 Explained with Diagrams, Aug. 10, 2010, thegeekstuff.com (18 pages). |
Non-Final Office Action received for U.S. Appl. No. 16/177,285 dated Jul. 22, 2020, 31 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/261,547 dated Sep. 3, 2020, 26 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/261,548 dated Aug. 21, 2020, 42 pages. |
Notice of Allowance received for U.S. Appl. No. 16/261,549 dated Jul. 17, 2020, 40 pages. |
Qiang et al., “Dynamics Process of Long-running Allocation/Collection in Linear Storage Space”, International Conference on Networking, Architecture, and Storage (NAS 2007), Guilin, 2007, pp. 209-216. |
Non-Final Office Action received for U.S. Appl. No. 16/374,725 dated Aug. 19, 2020, 50 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/511,161 dated Jul. 10, 2020, 24 pages. |
Notice of Allowance received for U.S. Appl. No. 15/862,547 dated Mar. 29, 2019 27 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/792,714 dated Apr. 4, 2019, 20 pages. |
Final Office Action received for U.S. Appl. No. 15/792,714 dated Sep. 12, 2019, 43 pages. |
Wikipedia “Garbage Collection”, URL: https://en.wikipedia.org/wiki/Garbage_collection_(computer science)#Availability (Year: 2017) retrieved using the WayBackMachine, Sep. 8, 2017, 8 pages. |
Wikipedia “Erasure code”, URL: https://web.archive.org/web/20170908171158/https://en.wikipedia.org/wiki/Erasure_code (Year: 2017), retrieved using the WayBackMachine, Sep. 8, 2017, 5 pages. |
Wikipedia “Front and back ends” URL: https://en.wikipedia.org/wiki/Front_and_back_ends (Year: 2019), Sep. 6, 2019, 4 pages. |
Notice of Allowance received for U.S. Appl. No. 15/792,714 dated Nov. 8, 2019, 31 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/791,390 dated Sep. 20, 2019, 27 pages. |
Final Office Action received for U.S. Appl. No. 15/791,390 dated Feb. 6, 2020, 29 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/791,390 dated Apr. 30, 2020, 48 pages. |
Huang et al., “Scale-RS: An Efficient Scaling Scheme for RS-Coded Storage Clusters,” in IEEE Transactions on Parallel and Distributed Systems, vol. 26, No. 6, pp. 1704-1717, Jun. 1, 2015. |
Non-Final Office Action received for U.S. Appl. No. 16/457,615 dated Jul. 20, 2020, 34 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/651,504 dated Mar. 21, 2019, 10 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/662,273 dated Nov. 16, 2018, 19 pages. |
Final Office Action received for U.S. Appl. No. 15/662,273 dated May 15, 2019, 33 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/965,479 dated Apr. 15, 2019, 21 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/794,950 dated Jul. 9, 2019, 29 pages. |
Final Office Action received for U.S. Appl. No. 15/651,504 dated Sep. 18, 2019, 15 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/952,179 dated Sep. 10, 2019, 42 pages. |
Wikipedia, “Standard Raid Levels—RAID 6”, URL: https://en.wikipedia.org/wiki/Standard_RAID_levels#RAID_6, Oct. 18, 2019, 11 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/656,382 dated Nov. 1, 2019, 47 pages. |
Final Office Action received for U.S. Appl. No. 15/952,179 dated Nov. 26, 2019, 53 pages. |
Non Final Office Action received for U.S. Appl. No. 16/024,314 dated Nov. 25, 2019, 42 pages. |
Non- Final Office Action received for U.S. Appl. No. 16/177,278 dated Dec. 2, 2019, 55 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/651,504 dated Dec. 31, 2019, 18 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/010,246 dated Dec. 5, 2019, 67 pages. |
Stonebreaker et al. “Distributed RAID—A New Multiple Copy Algorithm”, IEEE ICDE, 1990, pp. 430-437. |
Muralidhar et al. “f4: Facebook's Warm BLOB Storage System”, USENIX. OSDI, Oct. 2014, pp. 383-398. |
Final Office Action dated Feb. 12, 2020 for U.S. Appl. No. 16/024,314, 29 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/010,255 dated Jan. 9, 2020, 31 pages. |
Office Action dated Feb. 5, 2020 for U.S. Appl. No. 16/261,551, 30 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/228,612 dated Feb. 27, 2020, 49 pages. |
Final Office Action received for U.S. Appl. No. 16/010,246 dated Mar. 16, 2020, 33 pages. |
Final Office Action received for U.S. Appl. No. 15/656,382 dated Apr. 6, 2020, 31 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/582,167 dated Sep. 7, 2018, 19 pages. |
Non-Final Office Action received for U.S. Appl. No. 15/952,179 dated Apr. 20, 2020, 68 pages. |
Notice of Allowance received for U.S. Appl. No. 16/240,193, dated May 4, 2020, 46 pages. |
Final Office Action received for U.S. Appl. No. 16/177,278, dated May 11, 2020, 53 pages. |
Office Action dated Apr. 13, 2021 for U.S. Appl. No. 16/781,316, 21 pages. |
Office Action dated Nov. 24, 2021 for U.S. Appl. No. 16/538,984, 30 pages. |
Non-Final Office Action received for U.S. Appl. No. 16/834,649 dated Jan. 28, 2022, 26 pages. |
Office Action dated Feb. 8, 2022 for U.S. Appl. No. 16/986,222, 62 pages. |
Office Action dated Feb. 28, 2023 for U.S. Appl. No. 16/403,417, 36 pages. |
Number | Date | Country | |
---|---|---|---|
20220229568 A1 | Jul 2022 | US |