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 per second or IOPS 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 challenge that arises relates to developing a mechanism to efficiently track where objects are stored across the commodity disks in the cluster as well as how to efficiently access them when needed. For example, while utilizing a flat namespace may provide a simplistic and efficient means to store and retrieve objects, it does not provide enough flexibility to create hierarchical relationships between objects that may be useful in organizing objects in a manner that is compatible with the existing interfaces of clients or that otherwise satisfies the different storage requirements of different clients. For example, many pre-existing environments that could leverage such a scalable object store (e.g., applications, storage management tools, virtualization hypervisors, etc.) may require that the object store provide a certain hierarchical file system based storage interface. One example is vSphere Hypervisor from VMware, Inc. which stores virtual machine metadata in the form of files in a hierarchical file system. Furthermore, because the datastore is shared among the cluster of host computers which may simultaneously access the same data stored therein, any file system that is used to manage the single namespace provided by the datastore needs to have mechanisms for concurrency control. Current distributed or clustered file systems typically provide some form of concurrency control. However, due to limitations in their inherent design, such current file systems typically have limitations on the number of simultaneous “clients” (e.g., host computers or virtual machines that access the file system) they can support. If a current file system used to manage the datastore has limits on the number of clients that can simultaneously access it, then the utility of a highly scalable datastore can plateau, even if additional commodity storage can be easily added to the datastore to increase its capacity, since no additional clients can be added to access such additional storage.
One embodiment of the present disclosure relates to a method for providing a file system interface for an object store intended to support simultaneous access to objects stored in the object store by multiple clients. In accordance with the method, an abstraction of a root directory to a hierarchical namespace for the object store is exposed to clients. The object store is backed by a plurality of physical storage devices housed in or directly attached to the plurality of host computers and internally tracks its stored objects using a flat namespace that maps unique identifiers to the stored objects. The creation of top-level objects appearing as subdirectories of the root directory is enabled, wherein each top-level object represents a separate abstraction of a storage device having a separate namespace that can be organized in accordance with any designated file system.
By layering a hierarchical namespace that can be used by clients while using a flat namespace to internally store and access objects, techniques herein are able to offer a framework that supports a large scalable clustered file system using a distribute of commodity storage resources. For example, providing the capability to create top-level objects representing file systems that contain file objects that may ultimately be accessed by clients, the foregoing object store offers higher scalability than existing distributed or clustered file systems because it is not confined, for example, by any limitations on the number of simultaneous clients inherent in the design of any particular distributed clustered file system (e.g., VMware VMFS, NFS, etc.) configured for any particular file system object in the object store. That is, implementing a clustered file system on top of an object store has scalability advantages, because different parts of the clustered file system can be placed on different objects such that scalability requirements from particular clients need to be achieved only by the subset of such clients that access data in a certain sub-space of the namespace which, in turn, resides on a certain object.
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 computer system having a processor, memory, and modules configured to implement one or more aspects of the disclosed methods.
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. In certain embodiments, file system objects may further be periodically “auto-unmounted” when access to objects in the file system objects cease or are idle for a period of 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, for example, to report whether a storage resource is congested.
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 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. Similarly, while the foregoing embodiments have referred to RAID configurations as one technique to organize a blueprint, it should be recognized that other configurations may be utilized in other embodiments, including, without limitation, using erasure codes and other similar techniques. While descriptions herein have discussed using “unique identifiers” to reference objects in the objects, it should be recognized that techniques to generate unique identifiers (hashes, etc.) may not necessarily be guaranteed to generate truly unique identifiers and therefore certain embodiments may further implement techniques for handling name collisions in case there are instances where identifiers for objects are not truly unique. In one such embodiment, in addition to the purported unique identifier, an additional administrator or user specified identifier is also assigned to an object during its creation (or otherwise mapped to the object's unique identifier). When there is a name collision due to a pre-existing object having the same unique identifier as a newly created object, the administrator or user-specified name can be transformed into the newly created object's user identifier.
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.
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). In the claims, elements and/or steps do not imply any particular order of operation, unless explicitly stated in the claims.
This application is a continuation application of U.S. patent application Ser. No. 15/800,872, filed on Nov. 1, 2017, which is a continuation application of U.S. patent application Ser. No. 14/010,293 filed on Aug. 26, 2013, now U.S. Pat. No. 9,811,531. This application is related to the following commonly assigned, applications: “Distributed Policy-Based Provisioning and Enforcement for Quality of Service” (U.S. patent application Ser. No. 14/010,247, now U.S. Pat. No. 9,887,924), “Load Balancing of Resources” (U.S. patent application Ser. No. 14/010,275), and “Virtual Disk Blueprint for a Virtualized Storage Area Network” (U.S. patent 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 |
---|---|---|---|
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 | Georgiev | Apr 2008 | B1 |
7669029 | Mishra et al. | Feb 2010 | B1 |
7716425 | Uysal et al. | May 2010 | B1 |
7739470 | Norgren | Jun 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 |
8453036 | Goel et al. | May 2013 | B1 |
8566520 | Bitner et al. | Oct 2013 | B1 |
8635422 | Kaliannan et al. | Jan 2014 | B1 |
8645654 | Bailey et al. | Feb 2014 | B1 |
8682916 | Wong | Mar 2014 | B2 |
8782335 | Pinchover et al. | Jul 2014 | B2 |
8843925 | Beda, III et al. | Sep 2014 | B1 |
8850455 | Bachu | 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 | Apr 2015 | B1 |
9020912 | Majee et al. | Apr 2015 | B1 |
9244967 | Provenzano | Jan 2016 | B2 |
9298715 | Kumarasamy | Mar 2016 | B2 |
9448883 | Shrader | Sep 2016 | B1 |
9582198 | Earl | Feb 2017 | B2 |
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 et al. | Oct 2003 | A1 |
20040054648 | Mogi et al. | Mar 2004 | A1 |
20040123062 | 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 |
20060218360 | Burkey | Sep 2006 | A1 |
20070055703 | Zimran | Mar 2007 | A1 |
20080235448 | Inoue et al. | Sep 2008 | A1 |
20090172666 | Yahalom et al. | Jul 2009 | A1 |
20090271412 | Lacapta et al. | Oct 2009 | A1 |
20090276566 | Coatney et al. | Nov 2009 | A1 |
20100057990 | Mizuno et al. | Mar 2010 | A1 |
20100153617 | Miroshnichenko et al. | Jun 2010 | A1 |
20100153966 | Arimilli et al. | Jun 2010 | A1 |
20100180230 | Bogner et al. | Jul 2010 | A1 |
20100205370 | Ikawa et al. | Aug 2010 | A1 |
20100235832 | Rajagopal et al. | 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 |
20110021927 | 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 et al. | 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 et al. | Jan 2013 | A1 |
20130124798 | Aszmann et al. | May 2013 | A1 |
20130185413 | Beaty et al. | Jul 2013 | A1 |
20130204849 | Chacko | Aug 2013 | A1 |
20130262801 | Sancheti | 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 et al. | Jun 2014 | A1 |
20140173226 | Gold | Jun 2014 | A1 |
20140173612 | Haydock et al. | Jun 2014 | A1 |
20140195847 | Webman et al. | Jul 2014 | A1 |
20140201152 | Kumarasamy | Jul 2014 | A1 |
20140201736 | Mizrahi et al. | Jul 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 | 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 |
Number | Date | Country |
---|---|---|
3039575 | Jul 2016 | EP |
3425883 | Jan 2019 | EP |
H06-110766 | Apr 1994 | JP |
H10-49423 | Feb 1998 | JP |
2002-108567 | Apr 2002 | JP |
2002-229837 | Aug 2002 | JP |
2005-510794 | Apr 2005 | JP |
2006-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 |
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 |
WO 2006077215 | Jul 2006 | WO |
WO2006077215 | Jul 2006 | WO |
WO2008109321 | Sep 2008 | WO |
WO 2010048048 | Apr 2010 | WO |
WO2011108027 | Sep 2011 | WO |
WO2012024801 | Mar 2012 | WO |
WO2012090247 | Jul 2012 | WO |
WO20124 04912 | Aug 2012 | WO |
WO2015030901 | Mar 2015 | WO |
Entry |
---|
Dissecting the new function of Windows Server 2003 Virtual Disk Service, Windows Pro, Sook, Nikkei BP, Oct. 1, 2003, 79, pp. 122-127. |
Examination Report dated Nov. 26, 2018 for Australian Application No. 2017225042, 7 pages. |
Extended European Search Report dated Oct. 9, 2018 for European Application No. 18190819.5, 6 pages. |
Japanese Office Action dated Jan. 30, 2018, filed in Japanese counterpart Application No. 2017-196048, 10 pages (with English Translation). |
Japanese Office Action dated Jul. 3, 2018 in Japanese counterpart Application No. 2017-196048, 8 pages (with English translation). |
Office Action dated Oct. 16, 2018 for Japanese Patent Application No. 2017-208059. X, 10 pages (with English Translation). |
Shinji Shiota, Integrated Operating Environment on Windows NewWave 3.0, ASCII, Book, ASCII Corporation, Dec. 1, 1992, vol. 16, No. 12, pp. 329-332. |
Adam et al., “Regeneration with Virtual Copies for Replicated Databases”, Proceedings of the International Conference on Distributed Computing Systems, IEEE Camp. Soc. Press, vol. Conf. 11, May 20, 1991, pp. 429-436.'. |
Bhattacharjee et al., Efficient index compression in DB2 LUW. Proc. VLDB Endow. Aug. 2, 2009, pp. 1462-1473. |
Direct Attached Storage, Article [online]. Apex Microsystems, 2009, retrieved on May 4, 2016, 2 pages. |
European Search Report dated Jul. 25, 2017 in European Patent Application 14736203.2-1871, 5 pages. |
Extended European Search Report and Written Opinion in European Appln. No. 19177852.1-1224, dated Sep. 16, 2019, 9 pages. |
Extended European Search Report in European Appln. No. 19210692.0, dated Jan. 29, 2020, 7 pages. |
Extended European Search Report received for European Patent Application No. 18190819.5, dated Oct. 16, 2018, 6 pages. |
Final Office Action received for U.S. Appl. No. 14/010,316, dated Jul. 12, 2017, 38 pages. |
Final Office Action received for U.S. Appl. No. 14/209,426, dated Oct. 31, 2016, 31 pages. |
Final Office: Action received for U.S. Appl. No. 14/010,293, dated Dec. 14, 2015, 8 pages. |
Final Office Action received for U.S. Appl. No. 14/010,293, dated Oct. 12, 2016, 9 pages. |
Gray, “Concurrent LRU Block Cache”, The Apache Software Foundation HBase. htips-l:ke'Lle ″∧f-ir:hi: nriplqhrowelH8ASE-1460 , 2009, 5 pages. |
Hu et al., “Performance Evaluation of Dynamic Supporting Algorithms”,Proceedings of the Annual International Computer Software and Applications Conference (COMPSAC), IEEE Camp., vol. Conf. 16, Sep. 21, 1992, pp. 90-95. |
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/U52014/41761, dated Mar. 10, 2016, 7 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/U52014/041164, dated Oct. 1, 2014, 8 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/U52014/041172, dated Dec. 8, 2014, 13 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/U52014/041757, dated Sep. 2014, 7 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/U52014/041764, dated Sep. 1, 2014, 10 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/U52014/41761, dated Oct. 17, 2014, 9 pages. |
Migdal, “Data Block Encoding of Key Values”, The Apache Software Foundation HBase. https://Issues.apache.org/jira/browse/HBASE-42182, Aug. 2011, 85 pages. |
Non-Final Office Action received for U.S. Appl. No. 14/010,293, dated Apr. 28, 2016, 9 pages. |
Non-Final Office Action received for U.S. Appl. No. 14/010,293, dated Jun. 30, 2015, 8 pages. |
Notice of Allowance received for U.S. Appl. No. 14/010,293, dated Aug. 15, 2017, 2 pages. |
Notice of Allowance received for U.S. Appl. No. 14/010,293, dated Jul. 11, 2017, 8 pages. |
Office Action received for Australian Patent Application No. 2017225042, dated Nov. 26, 2018, 7 pages. |
Office Action received for European Patent Application No. 14736203.2, dated Mar. 7, 2018, 7 Pages. |
Office Action received for Japanese Patent Application No. 2016-529768, dated Mar. 14, 2017, 13 pages (5 pages of English Translation and 8 pages of Official copy). |
Office Action received for Japanese Patent Application No. 2016-529768, dated Nov. 21, 2017, 8 pages (2 pages of English Translation and 6 pages of Office Action). |
Office Action received for Japanese Patent Application No. 2016-529769, dated Feb. 21, 2017, 7 pages (3 pages of English Translation and 4 pages of Official copy). |
Office Action received for Japanese Patent Application No. 2016-531609, dated Jan. 10, 2017, 7 pages (3 pages of English Translation and 4 pages of Official copy). |
Office Action received for Japanese Patent Application No. 2017-196048, dated Jul. 3, 2018, 24 pages (8 pages of English translation and 16 pages of Official copy). |
Search Report received for Australian Patent Application No. 2014311869, dated Jan. 16, 2017, 4 pages. |
Virtual Drive, Online Available at <https://web.archive.org/web/20120614001609/http://searchservervirtualization.techtarget.com/definition/virtual-drive>, Jun. 14, 2012, 11 pages. |
Vocabluary.com [Online], “Vocabulary.com”, Retrieved from the Internet, https://web.archive.org/web/20120910033525/http://www.vocabulary.com/dictionary/incorporated, Retrieved on Aug. 16, 2018, 1 page. |
Number | Date | Country | |
---|---|---|---|
20200174974 A1 | Jun 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15800872 | Nov 2017 | US |
Child | 16781673 | US | |
Parent | 14010293 | Aug 2013 | US |
Child | 15800872 | US |