Distributed systems allow multiple clients in a network to access a pool of shared resources. For example, a distributed storage system allows a cluster of host computers to aggregate local disks (e.g., SSD, PCI-based flash storage, SATA, or SAS magnetic disks) located in or attached to each host computer to create a single and shared pool of storage. This pool of storage (sometimes referred to herein as a “datastore” or “store”) is accessible by all host computers in the cluster and may be presented as a single namespace of storage entities (such as a hierarchical file system namespace in the case of files, a flat namespace of unique identifiers in the case of objects, etc.). Storage clients in turn, such as virtual machines spawned on the host computers may use the datastore, for example, to store virtual disks that are accessed by the virtual machines during their operation. Because the shared local disks that make up the datastore may have different performance characteristics (e.g., capacity, input/output operations per second or TOPS capabilities, etc.), usage of such shared local disks to store virtual disks or portions thereof may be distributed among the virtual machines based on the needs of each given virtual machine.
This approach provides enterprises with cost-effective performance. For instance, distributed storage using pooled local disks is inexpensive, highly scalable, and relatively simple to manage. Because such distributed storage can use commodity disks in the cluster, enterprises do not need to invest in additional storage infrastructure. However, one issue with this approach is resource usage variance. That is, high variance between resource types results in inefficient usage overall. Continuing the distributed storage system example, when the system creates a virtual machine, the system may provision a set of resources (e.g., capacity, performance, availability, etc.) to the new virtual machine based on requirements of the virtual machine. If a particular partition of the shared datastore has high consumption of one or more types of resource, such as operations, and a much lower consumption in another, such as capacity, then the system may be unable to assign that partition to the virtual machine despite the available capacity. It is also a problem when consumption of one resource type is high for a particular partition in the datastore but consumption is low throughout the rest of the datastore because it is an inefficient distribution of resources.
One or more embodiments disclosed herein provide a method for distributing a storage object having a workload to a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system. The method generally includes retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system. The method also generally includes identifying one or more candidate resource containers within each node based on the statuses. Each candidate resource container has an original variance among the resource usage of the plurality of resource types. The method also generally includes determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container. The method also generally includes placing the set of distributed resources in one of at least one candidate resource container with the expected variance being lower than the original variance.
Another embodiment disclosed herein provides a method for rebalancing a multidimensional set of distributed resources having a plurality of resource types in a distributed resources system. The method generally includes retrieving a status of resource usage of each of the plurality of resource types in resource containers published by each node of the distributed resources system. The method also generally includes identifying a source object component causing an imbalance of the resource usage in a first one of the resource containers. The method also generally includes identifying one or more candidate resource containers within each node based on the statuses. Each candidate resource container has an original variance among resource usage of the plurality of resource types. The method also generally includes determining an expected variance among the resource usage of the plurality of resource types for each candidate resource container. The method also generally includes relocating the source object component to one of the one or more of the candidate resource containers that reduces the original variance based on the expected variance.
Other embodiments include, without limitation, a computer-readable medium that includes instructions that enable a processing unit to implement one or more aspects of the disclosed methods as well as a system having a processor, memory, and application programs configured to implement one or more aspects of the disclosed methods.
Embodiments disclosed herein provide techniques for balancing the usage variance of a multidimensional set of distributed resources across and within the individual host computers providing resources in a networked cluster. The techniques disclosed herein allow for relatively balanced resource usage and sufficient headroom in resources for thin-provisioning. In one embodiment, balancing (or rebalancing) occurs in assigning a new workload to distributed resources or in adjusting an existing usage variance imbalance in each individual node of the system. Each node publishes aggregate resource usage data by resource type for each resource container. Using the published data across the cluster, each node identifies candidate resource containers to place or migrate a workflow. For each candidate, the node determines an expected variance. Based on the expected variances, the host node selects a randomized placement (or migration) having a minus variance that results in an approximate balance in resource usage.
For instance, the techniques described herein may apply to a distributed storage system. One example of an applicable distributed storage system is a software-based “virtual storage area network” (VSAN) where host servers in a cluster each act as a node that contributes its commodity local storage resources (e.g., hard disk and/or solid state drives, etc.) to provide an aggregate “object” store. Each host server may include a storage management module (also referred to herein as a VSAN module) in order to automate storage management workflows (e.g., create objects in the object store, etc.) and provide access to objects in the object store (e.g., handle I/O operations to objects in the object store, etc.) based on predefined storage policies specified for objects in the object store. In one particular embodiment, the host servers further support the instantiation of virtual machines (VMs) which act as clients to the VSAN object store. In such an embodiment, the “objects” stored in the object store may include, for example, file system objects that may contain VM configuration files and virtual disk descriptor files, virtual disk objects that are accessed by the VMs during runtime and the like. The VSAN module in each node aims to balance resource usage in local disk groups between resource types, such as solid state drive TOPS and capacity as well as magnetic disk IOPS and capacity. In a software-based VSAN, balancing resource usage variance in each individual host server ensures that virtual machines across the virtualization cluster consume storage resources efficiently and are able to access resource types when available. Further, the distributed approach of individual host nodes monitoring resource consumption and readjusting the resource workloads eliminates the need for a centralized approach (e.g., through a management application or server) to balance the resources across the cluster.
Reference is now made in detail to several embodiments, examples of which are illustrated in the accompanying figures. Note, that wherever practicable, similar or like reference numbers may be used in the figures and may indicate similar or like functionality. The figures depict embodiments for purposes of illustration only. One having skill in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles described herein.
In the following, a VSAN module provides as a reference example of a system that load balances multiple resource types in a distributed resources system. This reference example is included to provide an understanding of the embodiments described herein. However, it will be apparent to one of skill in the art that these embodiments are applicable in other contexts related load balancing shared resources, regardless of the type of computing environment. For example, the embodiments may be applicable to software defined computers, networks, and storage arrays. Further, the embodiments are applicable to balancing other shared computing resources (e.g., processing, memory, and network resources, etc.).
Similarly, numerous specific details are provided to provide a thorough understanding of the embodiments. One of skill in the art will recognize that the embodiments may be practiced without some of these specific details. In other instances, well known process operations and implementation details have not been described in detail to avoid unnecessary obscuring of novel aspects of the disclosure.
A virtualization management platform 105 is associated with cluster 110 of nodes 111. Virtualization management platform 105 enables an administrator to manage the configuration and spawning of VMs on the various nodes 111. As depicted in the embodiment of
In one embodiment, VSAN module 114 is implemented as a “VSAN” device driver within hypervisor 113. In such an embodiment, VSAN module 114 provides access to a conceptual “VSAN” 115 through which an administrator can create a number of top-level “device” or namespace objects that are backed by object store 116. In one common scenario, during creation of a device object, the administrator may specify a particular file system for the device object (such device objects hereinafter also thus referred to “file system objects”). For example, in one embodiment, each hypervisor 113 in each node 111 may, during a boot process, discover a /vsan/ root node for a conceptual global namespace that is exposed by VSAN module 114. By, for example, accessing APIs exposed by VSAN module 114, hypervisor 113 can then determine all the top-level file system objects (or other types of top-level device objects) currently residing in VSAN 115. When a VM (or other client) attempts to access one of the file system objects, hypervisor 113 may dynamically “auto-mount” the file system object at that time. A file system object (e.g., /vsan/fs_name1, etc.) that is accessible through VSAN 115 may, for example, be implemented to emulate the semantics of a particular file system such as VMware's distributed or clustered file system, VMFS, which is designed to provide concurrency control among simultaneously accessing VMs. Because VSAN 115 supports multiple file system objects, it is able provide storage resources through object store 116 without being confined by limitations of any particular clustered file system. For example, many clustered file systems (e.g., VMFS, etc.) can only scale to support a certain amount of nodes 111. By providing multiple top-level file system object support, VSAN 115 overcomes the scalability limitations of such clustered file systems.
As described in further detail in the context of
Descriptor file 210 includes a reference to composite object 200 that is separately stored in object store 116 and conceptually represents the virtual disk (and thus may also be sometimes referenced herein as a virtual disk object). Composite object 200 stores metadata describing a storage organization or configuration for the virtual disk (sometimes referred to herein as a virtual disk “blueprint”) that suits the storage requirements or service level agreements (SLAs) in a corresponding storage profile or policy (e.g., capacity, availability, IOPs, etc.) generated by an administrator when creating the virtual disk. For example, in the embodiment of
In one embodiment, if an administrator creates a storage profile or policy for a composite object such as virtual disk object 200, CLOM sub-module 325 applies a variety of heuristics and/or distributed algorithms to generate virtual disk blueprint 215 that describes a configuration in cluster 110 that meets or otherwise suits the storage policy (e.g., RAID configuration to achieve desired redundancy through mirroring and access performance through striping, which nodes' local storage should store certain portions/partitions/stripes of the virtual disk to achieve load balancing, etc.). For example, CLOM sub-module 325, in one embodiment, is responsible for generating blueprint 215 describing the RAID 1/RAID 0 configuration for virtual disk object 200 in
In addition to CLOM sub-module 325 and DOM sub-module 340, as further depicted in
As previously discussed, DOM sub-module 340, during the handling of I/O operations as well as during object creation, controls access to and handles operations on those component objects in object store 116 that are stored in the local storage of the particular node 111 in which DOM sub-module 340 runs as well as certain other composite objects for which its node 111 has been currently designated as the “coordinator” or “owner.” For example, when handling an I/O operation from a VM, due to the hierarchical nature of composite objects in certain embodiments, a DOM sub-module 340 that serves as the coordinator for the target composite object (e.g., the virtual disk object that is subject to the I/O operation) may need to further communicate across the network with a different DOM sub-module 340 in a second node 111 (or nodes) that serves as the coordinator for the particular component object (e.g., stripe, etc.) of the virtual disk object that is stored in the local storage of the second node 111 and which is the portion of the virtual disk that is subject to the I/O operation. If the VM issuing the I/O operation resides on a node 111 that is also different from the coordinator of the virtual disk object, the DOM sub-module 340 of the node running the VM would also have to communicate across the network with the DOM sub-module 340 of the coordinator. In certain embodiments, if the VM issuing the I/O operation resides on node that is different from the coordinator of the virtual disk object subject to the I/O operation, the two DOM sub-modules 340 of the two nodes may to communicate to change the role of the coordinator of the virtual disk object to the node running the VM (e.g., thereby reducing the amount of network communication needed to coordinate I/O operations between the node running the VM and the node serving as the coordinator for the virtual disk object).
DOM sub-modules 340 also similarly communicate amongst one another during object creation. For example, a virtual disk blueprint generated by CLOM module 325 during creation of a virtual disk may include information that designates which nodes 111 should serve as the coordinators for the virtual disk object as well as its corresponding component objects (stripes, etc.). Each of the DOM sub-modules 340 for such designated nodes is issued requests (e.g., by the DOM sub-module 340 designated as the coordinator for the virtual disk object or by the DOM sub-module 340 of the node generating the virtual disk blueprint, etc. depending on embodiments) to create their respective objects, allocate local storage to such objects (if needed), and advertise their objects to their corresponding CMMDS sub-module 335 in order to update the in-memory metadata database with metadata regarding the object. In order to perform such requests, DOM sub-module 340 interacts with a log structured object manager (LSOM) sub-module 350 that serves as the component in VSAN module 114 that actually drives communication with the local SSDs and magnetic disks of its node 111. In addition to allocating local storage for component objects (as well as to store other metadata such a policies and configurations for composite objects for which its node serves as coordinator, etc.), LSOM sub-module 350 additionally monitors the flow of I/O operations to the local storage of its node 111.
However, the resource consumption variance shown in disk group 510 is not a desirable case. Disk group 510 depicts an uneven variance with high consumption in SSD capacity. In this case, although disk group 510 has a considerable amount of SSD TOPS, magnetic disk TOPS, and magnetic disk capacity available, the VSAN module may be unable to provision a new component with a certain workload to disk group 510 because the SSD capacity is almost unavailable for the component. VSAN module 114 remedies the imbalance by placing a workload from another virtual machine to disk group 510 that reduces the variance (e.g., one with high consumption of SSD operations, magnetic disk operations, and magnetic disk capacity) or migrating the workload from disk group 510 to another disk group reduce the variance in both.
Note that although each VSAN module 114 aims to balance resource workloads across all individual disks in the object store 116, VSAN module 114 does not aim for uniform resource consumption. Generally, VSAN module 114 chooses object placements or migrations that reduce variance in consumption to avoid running out of one resource type in a disk while still having an abundance of another resource type available.
Additionally, in a thin provisioning configuration, VSAN module 114 should ensure that sufficient headroom is available for potentially needed resources. For example, assume three virtual machines A, B, and C each have 100 GB each reserved on a 200 GB disk. While it is possible that A, B, and C might not all use the entire provisioned 100 GB simultaneously, VSAN module 114 may rebalance the workloads as the disk thickens (i.e., as the virtual machines use more of the resource capacity).
As shown, disk group 605 includes two workgroups A and B. Workgroup A depicts approximately an even amount of resource consumption across all types, while workgroup B depicts high usage in SSD capacity and low usage in the other resource types. The high usage in SSD capacity results in an imbalance. Disk group 610 includes a workload C that consumes a large amount of the resources relatively evenly. Disk group 615 includes a workload D that is consuming a large amount of SSD operations, magnetic disk operations, and magnetic disk capacity but consuming a small amount of SSD capacity. As a result, the variance between resource types in disk group 615 is high.
The resources in disk group 605 and 615 are not efficiently being used because of the high variance in consumption between the four resource types. Upon detecting imbalance among the resources, the VSAN module rebalances the resources so that the resources are more evenly distributed. Disk groups 6051, 6101, and 6151 illustrate disk groups 605, 610, and 615 after the rebalancing. As shown, workgroup B has been migrated from disk group 605 to disk group 615, resulting in disk group 6151. As a result, 6051, 6101, and 6151 represent more evenly balanced disk groups. The method for rebalancing is described in further detail in
The method begins at step 705, where CLOM sub-module 325 identifies candidate placements that match a policy. For example, assume that a local node in the virtualization cluster launches a new virtual machine. The virtual machine has storage requirements for 700 operations and 500 GB capacity. Accordingly, CLOM sub-module 325 identifies disk groups in component objects that are capable of satisfying the requirements. To do this, CLOM sub-module 325 consults the directory service in CMMDS sub-module 335 for objects that adhere to the requirements.
Once CLOM sub-module 325 has identified a set of candidate placements, then for each candidate placement, CLOM sub-module 325 determines expected variances that would result from the placement (at 710). This results in candidate placements having an increased or reduced variance. Thereafter, at step 715, CLOM sub-module 325 selects one of the candidates to place the new object. In one embodiment, CLOM sub-module 325 randomly selects the candidate placement to avoid placing components in the same disk group each time.
At any rate, in the event of an excessive imbalance within a local disk group, CLOM sub-module 325 identifies a source component having an associated workload to migrate to another disk group. Using
In step 815, once CLOM sub-module 325 has identified candidate migrations, it then determines expected variances for each potential migration. CLOM sub-module 325 disregards candidate migrations that increase the variance in favor of migrations that decrease the variance. In step 820, CLOM sub-module 325 selects a migration to place the source workload. In one particular embodiment, CLOM sub-module 325 randomizes the selection to avoid other migrations to that disk group. In step 830, CLOM sub-module 325 assigns the component having the associated workload to the selected disk group.
Although one or more embodiments have been described in some detail for clarity of understanding, it will be apparent that certain changes and modifications may be made within the scope of the claims. Accordingly, the described embodiments are to be considered as illustrative and not restrictive, and the scope of the claims is not to be limited to details given herein, but may be modified within the scope and equivalents of the claims. For example, although a number of foregoing described embodiments describe virtual machines as the clients that access the virtual disks provided by the VSAN module, it should be recognized that any clients, such as a cluster of non-virtualized host servers and/or non-virtualized applications running therein may similarly utilize the VSAN module in alternative embodiment. Similarly, alternative embodiments of the VSAN module may enable creation of high level storage objects other than virtual disks, such as, without limitation, REST objects, files, file systems, blob (binary large objects) and other objects. Similarly, while the load balancing techniques described in the foregoing embodiments related primarily to dealing with placing and/or rebalancing local storage disk groups, alternative embodiments may utilize similar techniques to rebalance memory, processing and/or networking resources. In such embodiments, DOM sub-module 340 may also monitor and publish resource usage in CPU, memory, and networking to other nodes in a distributed cluster. Similarly, while VSAN module 114 has been generally depicted as embedded in hypervisor 113, alternative embodiments may implement VSAN module separate from hypervisor 113, for example as a special virtual machine or virtual appliance, a separate application or any other “pluggable” module or driver that can be inserted into computing platform in order to provide and manage a distributed object store.
As described, embodiments described herein provide balancing the workloads of various resource types by the host. Advantageously, because each host computer rebalances local resources individually, this distributed approach does not require using a centralized algorithm or software for load balancing. Further, this approach ensures that storage clients are able to consume available resources efficiently throughout the distributed resources system and that individual disks do not run out of one or more resource types while an abundance of other resource types are available.
Generally speaking, the various embodiments described herein may employ various computer-implemented operations involving data stored in computer systems. For example, these operations may require physical manipulation of physical quantities usually, though not necessarily, these quantities may take the form of electrical or magnetic signals where they, or representations of them, are capable of being stored, transferred, combined, compared, or otherwise manipulated. Further, such manipulations are often referred to in terms, such as producing, identifying, determining, or comparing. Any operations described herein that form part of one or more embodiments may be useful machine operations. In addition, one or more embodiments also relate to a device or an apparatus for performing these operations. The apparatus may be specially constructed for specific required purposes, or it may be a general purpose computer selectively activated or configured by a computer program stored in the computer. In particular, various general purpose machines may 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.
The various embodiments described herein may be practiced with other computer system configurations including hand-held devices, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like.
One or more embodiments may be implemented as one or more computer programs or as one or more computer program modules embodied in one or more computer readable media. The term computer readable medium refers to any data storage device that can store data which can thereafter be input to a computer system computer readable media may be based on any existing or subsequently developed technology for embodying computer programs in a manner that enables them to be read by a computer. Examples of a computer readable medium include a hard drive, network attached storage (NAS), read-only memory, random-access memory (e.g., a flash memory device), a CD (Compact Discs), CD-ROM, a CD-R, or a CD-RW, a DVD (Digital Versatile Disc), a magnetic tape, 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.
Although one or more embodiments have been described in some detail for clarity of understanding, it will be apparent that certain changes and modifications may be made within the scope of the claims. Accordingly, the described embodiments are to be considered as illustrative and not restrictive, and the scope of the claims is not to be limited to details given herein, but may be modified within the scope and equivalents of the claims. In the claims, elements and/or steps do not imply any particular order of operation, unless explicitly stated in the claims.
In addition, while described virtualization methods have generally assumed that virtual machines present interfaces consistent with a particular hardware system, the methods described may be used in conjunction with virtualizations that do not correspond directly to any particular hardware system. Virtualization systems in accordance with the various embodiments, implemented as hosted embodiments, non-hosted embodiments, or as embodiments that tend to blur distinctions between the two, are all envisioned. Furthermore, various virtualization operations may be wholly or partially implemented in hardware. For example, a hardware implementation may employ a look-up table for modification of storage access requests to secure non-disk data.
Many variations, modifications, additions, and improvements are possible, regardless the degree of virtualization. The virtualization software can therefore include components of a host, console, or guest operating system that performs virtualization functions. Plural instances may be provided for components, operations or structures described herein as a single instance. Finally, boundaries between various components, operations and data stores are somewhat arbitrary, and particular operations are illustrated in the context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within the scope of one or more embodiments. In general, structures and functionality presented as separate components in exemplary configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements may fall within the scope of the appended claims(s).
This application is a continuation of U.S. patent application Ser. No. 14/010,275, filed Aug. 26, 2013. The entire contents of this application are hereby incorporated by reference in their entirety. This application is related to the following commonly assigned, co-pending applications: “Distributed Policy-Based Provisioning and Enforcement for Quality of Service” (application Ser. No. 14/010,247), “Scalable Distributed Storage Architecture” (application Ser. No. 14/010,293), and “Virtual Disk Blueprints for a Virtualized Storage Area Network” (application Ser. No. 14/010,316), each of which was filed on Aug. 26, 2013. Each related application is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5948110 | Hitz et al. | Sep 1999 | A |
6032224 | Blumenau | Feb 2000 | A |
6314526 | Arendt et al. | Nov 2001 | B1 |
6553389 | Golding et al. | Apr 2003 | B1 |
6658473 | Block et al. | Dec 2003 | B1 |
6839752 | Miller et al. | Jan 2005 | B1 |
7360030 | Georglev | Apr 2008 | B1 |
7441096 | Kitamura | Oct 2008 | B2 |
7669029 | Mishra et al. | Feb 2010 | B1 |
7716425 | Uysal et al. | May 2010 | B1 |
7734884 | Marshak | Jun 2010 | B1 |
7739470 | Norgren | Jun 2010 | B1 |
7774444 | George et al. | Aug 2010 | B1 |
8018892 | Chen et al. | Sep 2011 | B1 |
8037273 | Mizuno et al. | Oct 2011 | B2 |
8074003 | Salamon et al. | Dec 2011 | B1 |
8103769 | Weiser et al. | Jan 2012 | B1 |
8127059 | Carr et al. | Feb 2012 | B1 |
8429097 | Sivabramanian et al. | Apr 2013 | B1 |
8453036 | Goel et al. | May 2013 | B1 |
8566520 | Bitner et al. | Oct 2013 | B1 |
8601473 | Aron et al. | Dec 2013 | B1 |
8635422 | Kaliannan et al. | Jan 2014 | B1 |
8645654 | Bailey et al. | Feb 2014 | B1 |
8682916 | Wong et al. | Mar 2014 | B2 |
8782335 | Pinchover et al. | Jul 2014 | B2 |
8843925 | Beda et al. | Sep 2014 | B1 |
8850130 | Aron et al. | Sep 2014 | B1 |
8850455 | Bachu et al. | Sep 2014 | B1 |
8898224 | Haugh et al. | Nov 2014 | B2 |
8954979 | Myers et al. | Feb 2015 | B1 |
8984243 | Chen et al. | Mar 2015 | B1 |
9015123 | Mathew et al. | Apr 2015 | B1 |
9020912 | Majee et al. | Apr 2015 | B1 |
9244967 | Provensano et al. | Jan 2016 | B2 |
9298715 | Kumarasamay et al. | Mar 2016 | B2 |
9448883 | Shrader | Sep 2016 | B1 |
9507887 | Wang et al. | Nov 2016 | B1 |
9612966 | Joshi et al. | Apr 2017 | B2 |
20010034733 | Prompt et al. | Oct 2001 | A1 |
20020188590 | Curran et al. | Dec 2002 | A1 |
20030131020 | Karamanolis et al. | Jul 2003 | A1 |
20030158836 | Venkatesh et al. | Aug 2003 | A1 |
20030204509 | Dinker | Oct 2003 | A1 |
20040054648 | Mogi et al. | Mar 2004 | A1 |
20040123062 | Dalal et al. | Jun 2004 | A1 |
20040123063 | Dalal et al. | Jun 2004 | A1 |
20040136379 | Liao et al. | Jul 2004 | A1 |
20040153479 | Mikesell et al. | Aug 2004 | A1 |
20040177228 | Leonhardt et al. | Sep 2004 | A1 |
20040215639 | Bamford et al. | Oct 2004 | A1 |
20050055603 | Soran et al. | Mar 2005 | A1 |
20050097073 | Mair et al. | May 2005 | A1 |
20050166011 | Burnett et al. | Jul 2005 | A1 |
20050240714 | McCauley et al. | Oct 2005 | A1 |
20060107131 | Mills | May 2006 | A1 |
20060218360 | Burkey | Sep 2006 | A1 |
20070055703 | Zimran et al. | Mar 2007 | A1 |
20080235448 | Inoue | Sep 2008 | A1 |
20090172666 | Yahalom et al. | Jul 2009 | A1 |
20090271412 | Lacapra et al. | Oct 2009 | A1 |
20090276566 | Coatney et al. | Nov 2009 | A1 |
20090293055 | Carroll | Nov 2009 | A1 |
20100057990 | Mizuno et al. | Mar 2010 | A1 |
20100153966 | Arimilli et al. | Jun 2010 | A1 |
20100153617 | Miroshnichenko | Jul 2010 | A1 |
20100180230 | Bogner | Jul 2010 | A1 |
20100205370 | Ikawa et al. | Aug 2010 | A1 |
20100235832 | Rajagopal | Sep 2010 | A1 |
20100299495 | Frank | Nov 2010 | A1 |
20100306280 | Sapek | Dec 2010 | A1 |
20110083131 | Pirzada et al. | Apr 2011 | A1 |
20110087631 | Feldman et al. | Apr 2011 | A1 |
20110219271 | Kaneko et al. | Sep 2011 | A1 |
20110238814 | Pitts | Sep 2011 | A1 |
20110238857 | Certain et al. | Sep 2011 | A1 |
20110265085 | Kedem et al. | Oct 2011 | A1 |
20120005435 | Emaru et al. | Jan 2012 | A1 |
20120016840 | Lin et al. | Jan 2012 | A1 |
20120117320 | Pinchover et al. | May 2012 | A1 |
20120137066 | Nolterieke et al. | May 2012 | A1 |
20120204176 | Tian | Aug 2012 | A1 |
20120210068 | Joshi et al. | Aug 2012 | A1 |
20120239896 | Sobel | Sep 2012 | A1 |
20120272241 | Nonaka et al. | Oct 2012 | A1 |
20120303322 | Rego et al. | Nov 2012 | A1 |
20120304171 | Joshi et al. | Nov 2012 | A1 |
20130007436 | Bookman | Jan 2013 | A1 |
20130124798 | Aszmann et al. | May 2013 | A1 |
20130185413 | Beaty | Jul 2013 | A1 |
20130204849 | Chacko | Aug 2013 | A1 |
20130262801 | Sancheti et al. | Oct 2013 | A1 |
20130311989 | Ota et al. | Nov 2013 | A1 |
20140013055 | Frey et al. | Jan 2014 | A1 |
20140115579 | Kong | Apr 2014 | A1 |
20140123062 | Nguyen et al. | May 2014 | A1 |
20140130055 | Guha | May 2014 | A1 |
20140156925 | Baron | Jun 2014 | A1 |
20140173612 | Haydock et al. | Jun 2014 | A1 |
20140195847 | Webman et al. | Jul 2014 | A1 |
20140201152 | Kumarasamy et al. | Jul 2014 | A1 |
20140201736 | Mizrahi et al. | Jul 2014 | A1 |
20140173226 | Gold et al. | Dec 2014 | A1 |
20140359556 | Jujare et al. | Dec 2014 | A1 |
20150039763 | Chaudhary et al. | Feb 2015 | A1 |
20150058298 | Earl et al. | Feb 2015 | A1 |
20150058384 | Karamanolis et al. | Feb 2015 | A1 |
20150058475 | Earl et al. | Feb 2015 | A1 |
20150058555 | Karamanolis et al. | Feb 2015 | A1 |
20150058577 | Earl | Feb 2015 | A1 |
20150058863 | Karamanolis et al. | Feb 2015 | A1 |
20160004616 | Narita et al. | Jan 2016 | A1 |
20160105504 | Vallabhaneni et al. | Apr 2016 | A1 |
20170317947 | Karamanolis et al. | Nov 2017 | A9 |
20180095991 | Karamanolis et al. | Apr 2018 | A1 |
20180176142 | Earl et al. | Jun 2018 | A1 |
20200174974 | Karamanolis et al. | Jun 2020 | A1 |
20200371721 | Karamanolis et al. | Nov 2020 | A1 |
20210271524 | Karamanolis et al. | Sep 2021 | A1 |
20220043608 | Karamanolis et al. | Feb 2022 | A1 |
Number | Date | Country |
---|---|---|
3039575 | Jul 2016 | EP |
3425883 | Jan 2019 | EP |
H06110766 | Apr 1994 | JP |
H1049423 | Feb 1998 | JP |
2002-108567 | Apr 2002 | JP |
2002-229837 | Aug 2002 | JP |
2005-510794 | Apr 2005 | JP |
006-107501 | Apr 2006 | JP |
2007-501455 | Jan 2007 | JP |
2007-272874 | Oct 2007 | JP |
2008-527555 | Jul 2008 | JP |
2008-192139 | Aug 2008 | JP |
2008-210057 | Sep 2008 | JP |
2008-541207 | Nov 2008 | JP |
2009-217475 | Sep 2009 | JP |
2010-044789 | Feb 2010 | JP |
2010-055369 | Mar 2010 | JP |
2010-066842 | Mar 2010 | JP |
2010-186223 | Aug 2010 | JP |
2010-186472 | Aug 2010 | JP |
2012-008854 | Jan 2012 | JP |
2012-507075 | Mar 2012 | JP |
2012-104097 | May 2012 | JP |
2012-173996 | Sep 2012 | JP |
2006077215 | Jul 2006 | WO |
2008109321 | Sep 2008 | WO |
2010048048 | Apr 2010 | WO |
2011108027 | Sep 2011 | WO |
2012024801 | Mar 2012 | WO |
2012090247 | Jul 2012 | WO |
2012104912 | Aug 2012 | WO |
2015030901 | Mar 2015 | WO |
Entry |
---|
Vocabulary.com Article [online]. Vocabulary.com, Sep. 10, 2012 [retrieved on Aug. 30, 2016]. Retrieved from the Internet <https://web.archive.org/web/20120910033525/http://www.vocabulary.com/dictionary/incorporated>. |
Adam, Nabil R. et al., Regeneration with Virtual Copies for Replicated Databases, [Proceedings of the International Conference on Distributed Computing Systems], Los Alamitos, IEEE Comp. Soc. Press, US. vol. CONF. 11, May 20, 1991, pp. 429-436. |
Hu, Ping et al., Performance Evaluation of Dynamic Supporting Algorithms, Proceedings of the Annual International Computer Software and Applications Conference (COMPSAC), Los Alamitos, IEEE Comp., vol. CONF. 16, Sep. 21, 1992, pp. 90-95. |
“Virtual Drive”, Web Page ,http://searchservervirtualization.techtarget.com/definition/virtual-drive>, Jun. 14, 2012, retrieved from Internet Archive Wayback Machine, https://web.archive.org/web/20120614001609/http://searchservervirtualization.techtarget.com/definition/virtual-drive> on Feb. 3, 2016. |
“Jacek Migdal. 2011. Data Block Encoding of KeyValues (aka delta encoding I prefix compression). The Apache SoftwareFoundation HBase. https://issues.apache.org/jira/browse/HBASE-4218”. |
Jonathan Gray. 2009. Concurrent LRU Block Cache. The Apache Software Foundation HBase. https://issues.apache.org/jira/browse/HBASE-1460. |
Bhattacharjee, Bishwaranjan et al., Efficient Index Compression in DB2 LUW, Proc. VLDB Endow. 2, 2, Aug. 2009, pp. 1462-1473. DOI= 10.14778/1687553.1687573 http://dx.doi.org/1 0.14 778/1687553.1687573. |
Direct Attached Storage. Article [online]. Apex Microsystems, 2009 [retrieved on May 4, 2016]. Retrieved from the Internet <http://www.apexmicrosystem.com/?page_id+518>. |
Dissecting the new function of Windows Server 2003 “Virtual Disk Service”, Windows Pro, Book, Nikkei BP, Oct. 1, 2003, 79, pp. 122-127. |
Shinji Shiota, Integrated Operating Environment on Windows NewWave 3.0, ASCII, Book, ASCII Corporation, Dec. 1, 1992, vol. 16, No. 12, pp. 329-332. |
Number | Date | Country | |
---|---|---|---|
20210271524 A1 | Sep 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14010275 | Aug 2013 | US |
Child | 17321299 | US |