Patent Application
20190012329
The subject matter described herein relates generally to distributed computing and more specifically to a shared filesystem within a distributed data storage system.
A distributed data storage system can store data across multiple computing nodes. These computing nodes can be located across different racks, availability zones, and/or data centers in the distributed data storage system. Furthermore, the distributed data storage system can be configured to store data from multiple tenants. Data from each individual tenant can be organized into one or more data partitions and stored in at least one data container. Moreover, each data partition can be stored in one of the computing nodes in the distributed data storage system. As such, locating data within the distributed data storage system, for example, in order to respond to a query (e.g., a structured query language (SQL) statement and/or the like), can require identifying the data partition and/or the data container holding the data. Alternatively and/or additionally, locating data within the distributed data storage system can require identifying the data center, availability zone, rack, and/or computing node storing the data.
Systems, methods, and articles of manufacture, including computer program products, are provided for page list based data persistency. In one aspect, there is provided a system. The system may include at least one data processor and at least one memory. The at least one memory may store instructions that result in operations when executed by the at least one data processor. The operations may include: storing, at the distributed data storage system, a file that is part of a shared filesystem, the file being stored as an inode object and a series of data block objects in the shared filesystem; and responding to a first request from a client to open the file at least by generating, in the shared filesystem a first open file object and a client index object, the first open file object and the client index object being linked to a client object corresponding to the client, the first open file object and the client index object further being linked to the inode object to at least indicate the file being accessed by the client.
In some variations, one or more features disclosed herein including the following features can optionally be included in any feasible combination. The inode object can be further linked to another inode object corresponding to a directory in the shared filesystem, a directory entry object, and/or a directory entry index object. The directory can correspond to a directory in the shared filesystem. Linking the inode object to the other inode object corresponding to the directory, the directory entry object, and/or the directory entry index object can indicate that the file corresponding to the inode object is part of the directory corresponding to other inode object.
In some variations, the client object can be associated with an access time object storing a time when the client corresponding to the client object last accessed the shared filesystem. The access time object can be replaced with another access time object in response to the client updating the time when the client corresponding to the client object last accessed the shared filesystem. A timeout of a connection between the client and the shared filesystem can be determined based at least on the access time object. In response to determining that the connection between the client and the shared filesystem has timed out, the client object, the first open file object, and/or the client index object can be removed from the shared filesystem. The removal of the client object, the first open file object, and/or the client index object can trigger a deletion of the inode object and/or the series of data block objects holding the file corresponding to the inode object based at least on the inode object not being referenced by another client and/or a directory.
In some variations, the response to a second request from the client to open the file can include generating a second open file object. The second open file object can be associated with a different discriminator value than the first open file object.
In some variations, the inode object can be generated. The inode object can be linked to a directory entry object and the series of data block objects corresponding to one or more data blocks storing the file corresponding to the inode object. The inode object and another inode object corresponding to the directory further being linked to a directory entry object and/or to a directory entry index object to at least indicate the file corresponding to the inode object being part of a directory corresponding to the other inode object corresponding to the directory.
In some variations, a response to a second request from the client to close the file can include deleting the first open file object and/or the client index object. In response to determining that a link count of the inode object is zero and the inode object is not associated with any client index objects, the inode object and/or the series of data block objects storing the file can be deleted.
In some variations, a response to a second request to read from and/or write to the file corresponding to the inode object can include iterating through the one or more data blocks. The iteration can be based at least on a composite key stored in each data block object in the series of data block objects. The composite key can include an inode identifier of the file and a block index computed based at least on an offset associated with a corresponding data block. Writing to one or more unallocated blocks for storing the file corresponding to the inode object further comprises: allocating a data block for storing data being written to the file; generating a data block object corresponding to the data block, the data block object being linked to the inode object corresponding to the file; and updating a block count value stored in the inode object.
In some variations, the distributed data storage system can include a first computing node and a second computing node. One or more partitions of the shared filesystem can be stored at a key-value store at each of the first computing node and the second computing node. Each file in the shared filesystem can be stored as a key-value pair in the key-value store at each of the first computing node and the second computing node.
In some variations, the client object can be created in response to the client connecting to the shared filesystem. The client object can be removed in response to the client disconnecting from the shared filesystem.
Implementations of the current subject matter can include, but are not limited to, methods consistent with the descriptions provided herein as well as articles that comprise a tangibly embodied machine-readable medium operable to cause one or more machines (e.g., computers, etc.) to result in operations implementing one or more of the described features. Similarly, computer systems are also described that may include one or more processors and one or more memories coupled to the one or more processors. A memory, which can include a non-transitory computer-readable or machine-readable storage medium, may include, encode, store, or the like one or more programs that cause one or more processors to perform one or more of the operations described herein. Computer implemented methods consistent with one or more implementations of the current subject matter can be implemented by one or more data processors residing in a single computing system or multiple computing systems. Such multiple computing systems can be connected and can exchange data and/or commands or other instructions or the like via one or more connections, including, for example, to a connection over a network (e.g. the Internet, a wireless wide area network, a local area network, a wide area network, a wired network, or the like), via a direct connection between one or more of the multiple computing systems, etc.
The details of one or more variations of the subject matter described herein are set forth in the accompanying drawings and the description below. Other features and advantages of the subject matter described herein will be apparent from the description and drawings, and from the claims. While certain features of the currently disclosed subject matter are described for illustrative purposes in relation to web application user interfaces, it should be readily understood that such features are not intended to be limiting. The claims that follow this disclosure are intended to define the scope of the protected subject matter.
The accompanying drawings, which are incorporated in and constitute a part of this specification, show certain aspects of the subject matter disclosed herein and, together with the description, help explain some of the principles associated with the disclosed implementations. In the drawings,
When practical, similar reference numbers denote similar structures, features, or elements.
A distributed data storage system can include a plurality of computing nodes, each of which store data in fixed and/or variable sized blocks of memory such as, for example, memory pages and/or the like. Each computing node in the distributed data storage system can be associated with a state machine configured to track changes to the data stored at the computing node. For instance, applying changes to the data stored at a computing node can trigger one or more state transitions at the state machine associated with the computing node. Snapshots of the state machine can be created at various checkpoints in order to capture the state of the data stored at the computing node at each checkpoint. Furthermore, the changes applied to the data subsequent to a checkpoint can be recorded in a log such as, for example, a write ahead log and/or the like. In the event of a crash at the computing node, the data at the computing node can be restored to a state prior to the crash by at least applying the changes in the log to a snapshot of the state machine created prior to the crash.
A shared file system can be created on top of a distributed data storage system for storing common files including, for example, installation executable files, configuration files, trace files, and/or the like. A conventional shared filed system may be implemented by storing the common files at a central location such as, for example, a network file system (NFS) server, a server message block (SMB)/common Internet filesystem (CIFS) server, and/or the like. But centralizing the shared filesystem may give rise to a single point of failure in the distributed data storage system while local disks at the computing nodes within the distributed data storage system are left underutilized. As such, according to some implementations of the current subject matter, a shared filesystem may be implemented by storing replicas of the common files at multiple computing nodes within the distributed data storage system. For instance, the common files may be stored in key-value stores across multiple computing nodes.
In some implementations of the current subject matter, the shared filesystem can include a plurality of objects for tracking and/or controlling access to the shared filesystem including, for example, the files and/or directories included in the shared filesystem. For example, an inode object can represent a file included in the shared filesystem and/or a directory in the shared filesystem. To indicate that the file is part of a directory in the shared filesystem, the inode object of the file can be linked to another inode object corresponding to the directory as well as a directory entry object that is further linked to a directory entry index object. When a client of the distributed data storage system connects to the shared filesystem, a client object can be generated to represent the client while an open file object can be generated to represent the files being accessed by the client. The client object and/or the open file object can further be linked to one or more client index objects, which can represent the files being accessed by the client by at least being linked to the corresponding inode objects. According to some implementations of the current subject matter, a garbage collector can be configured to remove at least some of the objects within the shared filesystem. For instance, a client object and/or an index object can be removed upon termination of the connection between a corresponding client and the shared filesystem. Meanwhile, closing a file and/or a directory can trigger the removal of the corresponding open file object, directory entry object, and/or directory entry index object.
A shared filesystem 120 can be created on top of the distributed data storage system 100 and can store a plurality of common files such as, for example, installation executable files, configuration files, trace files, and/or the like. In some implementations of the current subject matter, one or more partitions of the shared filesystem 120120 including the common files can be stored at each of the plurality of computing nodes including, for example, in a first data store 112A at the first computing node 110A and/or in a second data store 112B the second computing node 110B. Furthermore, each partition of the shared filesystem 120 can be coupled with a shared filesystem controller. For example, as shown in
For example, in some implementations of the current subject matter, the first computing node 110A can serve as a leader node while the second computing node 110B can act as a follower node. As such, the first computing node 110A can respond to one or more requests from the client 160, for example, by applying the corresponding changes to the data stored at the first computing node 110A, for example, in the first data store 114A. These changes can include, for example, additions, deletions, and/or updates with respect to the one or more partitions of the shared filesystem 120 stored in the first data store 114A at the first computing node 110A. Moreover, these changes can trigger one or more state transitions at a first state machine 112A associated with the first computing node 110A, which can be configured to track, via the state transitions, the changes to the data in the first data store 114A. A second state machine 112B at the second computing node 110B can be configured to track, via state transitions, the changes to the data in the second data store 114B which, as noted, can also include one or more partitions of the shared filesystem 120. As part of the consensus protocol, changes to the data stored at the first computing node 110A serving as the leader node can be propagated to the second computing node 110B acting as a follower node. Consistency across the replicas of the data stored at the first computing node 110A and the second computing node 110B can be maintained by at least applying the same changes to the data including, for example, the replica of shared filesystem 120, stored at the second computing node 110B.
In some implementations of the current subject matter, the first data store 114A and/or the second data store 114B can be a key-value store configured to store data in the form of one or more key-value pairs (KVPs). As such, the first shared filesystem controller 130A and/or the second shared filesystem controller 130B can be configured to translate requests, for example, from the client 160, into one or more calls to a key-value store. For instance, the first data store 114A and/or the second data store 114B can be a hybrid key-value store in which data records that do not exceed a threshold size (e.g., 2 kilobytes and/or a different size) are stored in an in-memory key-value store and data records that do exceed the threshold size (e.g., 2 kilobytes and/or a different size) are stored in a secondary data store. It should be appreciated that an in-memory key-value store can be implemented using any type of persistence that supports low latency access including, for example, random access memory (RAM) and/or the like. Meanwhile, the secondary data store can be implemented using any type of persistence that supports high capacity storage including, for example, hard disk and/or the like.
Referring again to
In some implementations of the current subject matter, the implementation of shared filesystem 120 can include a plurality of objects. An object may store metadata that includes, for example, one or more attributes of the object, relationships to other objects in the shared filesystem 120, and/or the like. For example, an inode object can represent a file included in the shared filesystem. To indicate that the file is part of a directory in the shared filesystem, the inode object of the file can be linked to another inode object corresponding to the directory as well as a directory entry object that is further linked to a directory entry index object. When a client of the distributed data storage system connects to the shared filesystem, a client object can be generated to represent the client while an open file object can be generated to represent the files being accessed by the client. The client object and/or the open file object can further be linked to one or more client index objects, which can represent the files being accessed by the client by at least being linked to the corresponding inode objects.
It should be appreciated that the links between objects in the shared filesystem can be implemented as hard links and/or soft links. A soft link between two objects can be achieved by storing an identifier of one object as part of the metadata included in the other inode object (e.g., stored in a data block of a symbolic link inode). Meanwhile, a hard link to an object can be achieved by linking the inode object to another directory inode and incrementing the link count associated with the inode object.
To further illustrate,
Referring again to
In some implementations of the current subject matter, the client object 210 can be associated with a globally unique identifier (GUID). The globally unique identifier can be part of the metadata stored in the client object 210. As shown in
In some implementations of the current subject matter, each file in the shared filesystem 120 can be represented by an inode object such as, for example, the inode object 220. The inode object 220 can store, for example, metadata associated with the corresponding file. Furthermore, the inode object 220 can be linked to the data block object 224, which can contain the actual data of the file corresponding to the inode object 220. Although only a single data block object is shown in
In some implementations of the current subject matter, the client open file object 214 and the client open file index 222 linking to the inode object 220 can be created when the client 160 requests to open a file corresponding to the inode object 220. The client open file index 222 can indicate the clients accessing the file corresponding to the inode object 220 by being linked to the corresponding client objects and open file objects. For instance, as shown in
In some implementations of the current subject matter, the inode object 220 can be linked to another inode object corresponding to a directory as well as the directory entry object 235 to indicate that the file corresponding to the inode object 220 is part of the directory. The directory entry object 235 can be further linked to the root object 200 corresponding to a root directory of the shared filesystem 120. The directory entry object 235 can be removed from the shared filesystem 120 when the file corresponding to the inode object 220 is deleted from the shared filesystem 120. For instance, the directory entry object can be removed by deleting the directory entry object 235 by name in the directory to which the directory entry object 235 belongs. Alternatively and/or additionally, the directory entry index object 230 can also be removed from the shared filesystem 120 immediately, for example, by the first shared filesystem controller 130A and/or the second shared filesystem controller 130B, upon the deletion of the corresponding directory entry object 235.
In some implementations of the current subject matter, the shared filesystem controller can generate the client open file object 214 in response to the client 160 opening the file corresponding to the inode object 220. The client open file object 214 can be linked to the inode object 220 in order to indicate that the file corresponding to the inode object 220 is being accessed by the client 160 corresponding to the client object 210. Furthermore, the client open file object 214 can be removed from the shared filesystem 120, for example, by the garbage collector 150, when the client 160 closes the file corresponding to the inode object 220. Alternatively and/or additionally, the open file object 214 and/or the inode object 220 can be linked to the client open file index 222. For instance,
The shared filesystem controller can create a file in the shared filesystem 120 by at least generating an inode object, an open file object, a client index object, a data block object, a directory entry object, and/or a directory entry index object (252). For example, in some implementations of the current subject matter, the shared filesystem controller can create a file in the shared filesystem 120 by generating the inode object 220 corresponding to the file and the data block object 224 corresponding to the data block storing the file. The shared filesystem controller can generate the client open file object 214 and the client open file index 222, which can indicate the client accessing the file corresponding to the inode object 220. Alternatively and/or additionally, the shared filesystem controller can generate the directory entry object 235, which can be linked to the directory entry index object 230 to at least indicate that the file corresponding to the inode object 220 is part of the directory corresponding to another inode object in the shared filesystem 120. The inode object corresponding to the directory can be linked to the client open file object 214 by a directory inode identifier (e.g., directory_inode_id) stored as part of the directory entry object 235.
The shared filesystem controller can respond to a request from the client 160 to connect to the shared filesystem 120 by at least generating a corresponding client object and access time object (254). For instance, the shared filesystem controller can respond to a request from the client 160 to connect to the shared filesystem 120 by generating the client object 210 and the client last access index object 212. The client last access index object 212 can store a time when the client 160 last accessed the shared filesystem 120. In some implementations of the current subject matter, the client last access index object 212 can store a time when the client 160 last accessed the shared filesystem 120. The client last access index object 212 can be updated, for example, by the client 160, in order to avoid a timeout of the connection between the client 160 and the shared filesystem 120.
The shared filesystem controller can respond to a request from the client 160 to access a file in the shared filesystem 120 by at least generating an open file object linked to an inode object of the file and linking a client object of the client 160 to the client index object of the file (256). For example, the client 160 can request to access one or more files in the shared filesystem 120 including, for example, the file corresponding to the inode object 220. In some implementations of the current subject matter, the shared filesystem controller can respond to the request by generating the client open file object 214, which can be linked to the inode object 220. Furthermore, the shared filesystem controller can link the client object 210 corresponding to the client 160 to the client open file index 222 associated with the inode object 220. The link between the client object 210 and the client open file index 222 can indicate that the client 160 is one of the clients accessing the file corresponding to the inode object 220.
The shared filesystem controller can perform garbage collection to remove one or more objects from the shared filesystem 120 (258). For instance, in some implementations of the current subject matter, the shared filesystem controller, for example, the garbage collector 150, can remove the client object 120, the client last access index object 212, and/or the client open file object 214 when the connection between the client 160 and the shared filesystem 120 closes and/or times out. The client open file object 214 and client open file index object 222 can also be removed when the client 160 closes the file corresponding to the inode object 220. Alternatively and/or additionally, the shared filesystem controller, for example, the garbage collector 150, can remove the inode object 220, the data block object 224, the directory entry object 235, and/or the corresponding directory entry index object 230 when the file corresponding to the inode object 220 is deleted from the shared filesystem 120. The directory entry index object 230 can be removed from the shared filesystem 120 upon deletion of the corresponding directory form the shared filesystem 120.
As shown in
As shown in
In some implementations of the current subject matter, the client 160 can periodically update the last access time associated with the client 160 in order to prevent the connection between the client 160 and the shared filesystem 120 from timing out. Referring to
As shown in
As shown in
In some implementations of the current subject matter, each open file can be associated with a key to enable a differentiation between different open files. However, a key formed from a client identifier and an inode identifier are insufficient to differentiate between open files associated with the client 160 if the client 160 opens the same file multiple times. As such, according to some implementations of the current subject matter, the key associated with an open file can be formed based on a client identifier, an inode identifier, and a discriminator value. The discriminator value can be generated, for example, by a counter associated with the client 160. It should be appreciated that including a discriminator value in the keys associated with open files and can enable a differentiation between open files associated with the client 160 even when the client 160 opens the same file multiple times. For instance, as shown in
For example, the client 160 can request to open the file corresponding to the inode object 220 and/or a directory corresponding to another inode object. In some implementations of the current subject matter, the shared filesystem controller can respond to the request by creating the client open file object 214, which can be linked to the client object 210 associated with the client 160 and the inode object 220 corresponding to the file and/or another inode object corresponding to the directory. The shared filesystem controller can further generate the client open file index 222, which can be linked to the client object 210, the inode object 220 corresponding to the file, and/or another inode object corresponding to the directory to at least indicate that the file and/or the directory are being accessed by the client 160. According to some implementations of the current subject matter, the shared filesystem controller can locate the inode corresponding to the inode object 220 corresponding to the file and/or the other inode object corresponding to the directory. The shared filesystem controller can further cache these inode objects since the client 160 is likely to request the corresponding file and/or directory multiple times.
For example, the client 160 can request to close the file corresponding to the inode object 220 and/or the directory corresponding to another inode object. In some implementations of the current subject matter, the shared filesystem controller can respond to the request by deleting the client open file index 222, which can be linked to the client object 210 and the inode object 220 to indicate that the client 160 associated with the client object 210 is accessing the file associated with the inode object 220. According to some implementations of the current subject matter, the shared filesystem controller can delete the inode object 220 and any data block objects associated with the file (e.g., the data block object 224 and/or the like) if the inode object 220 is not associated with a directory entry object and any other client index objects. That is the shared filesystem controller can delete the file from the shared filesystem 120 if the file is not part of a directory and is not being accessed by any other clients of the shared filesystem 120. Furthermore, the shared filesystem controller can delete the client open file object 214 associated with the client object 210 and the inode object 220. As noted, the client open file object 214 can indicate that the client 160 is accessing the file corresponding to the inode object 220. Thus, the client open file object 214 can be deleted once the client 160 requests to close the file corresponding to the inode object 220.
In some implementations of the current subject matter, the shared filesystem controller can respond to a request from the client 160 to create a file and/or a directory including, for example, the file corresponding to the inode object 220 and/or the directory corresponding to the another inode object. As shown in
In some implementations of the current subject matter, upon generating the client open file object 214, the shared filesystem controller can then generate the client open file index 222. As shown in
Referring again to
In some implementations of the current subject matter, upon successfully generating the inode object 220 corresponding to the file and/or another inode object corresponding to the directory, the shared filesystem controller can generate the directory entry index object 230 corresponding to a directory in the shared filesystem 120 that includes the file corresponding to the inode object 220. If the shared filesystem controller is unable to successfully generate the directory entry index object 230, the shared filesystem controller can delete the inode objects corresponding to the file and/or the directory, the client open file object 214, and/or the client open file index 222 previously generated by the shared filesystem controller. Furthermore, the shared filesystem controller can return an error indication to the client 160.
Alternatively and/or additionally, if the shared filesystem controller is able to successfully generate the directory entry index object 230, the shared filesystem controller can then generate the directory entry object 235. As shown in
In some implementations of the current subject matter, the shared file system controller can respond to a request from the client 160 to delete a file and/or a directory from the shared filesystem 120 including, for example, the file corresponding to the inode object 220 and/or the directory corresponding to another inode object in the shared filesystem 120. Referring to
For example, as shown in
In some implementations of the current subject matter, the shared filesystem controller can respond to a request from the client 160 to read from the inode object 220 referenced by another directory in the shared filesystem 120 such as, for example, the directory corresponding to another inode object linked with the directory entry index object 230. As shown in
As shown in
In some implementations of the current subject matter, the data blocks storing the file can be indexed based on a composite key, which can be stored as part of the data block object corresponding to each of the data blocks storing the file. The composite key can include an inode identifier of the file, which can be stored as part of the inode object 220. Furthermore, the composite key can include a block index, which can be computed based on an offset associated with the corresponding data block. Referring again to
As noted, the data blocks storing the file corresponding to the inode object 220 can be indexed based on a composite key that includes an inode identifier and a block index. As shown in
In some implementations of the current subject matter, the file corresponding to the inode object 220 can be truncated by at least deallocating the data blocks storing the file including, for example, the data block corresponding to the data block object 224. Truncating the file can include updating the inode object 220 to reflect the change in the quantity of data blocks storing the file. For instance, the block count value stored in the inode object 220 can be updated to reflect a decrease in the quantity of data blocks storing the file corresponding to the inode object 220.
As shown in
The memory 520 is a computer readable medium such as volatile or non-volatile that stores information within the computing system 500. The memory 520 can store data structures representing configuration object databases, for example. The storage device 530 is capable of providing persistent storage for the computing system 500. The storage device 530 can be a floppy disk device, a hard disk device, an optical disk device, or a tape device, or other suitable persistent storage means. The input/output device 540 provides input/output operations for the computing system 500. In some implementations of the current subject matter, the input/output device 540 includes a keyboard and/or pointing device. In various implementations, the input/output device 540 includes a display unit for displaying graphical user interfaces.
According to some implementations of the current subject matter, the input/output device 540 can provide input/output operations for a network device. For example, the input/output device 540 can include Ethernet ports or other networking ports to communicate with one or more wired and/or wireless networks (e.g., a local area network (LAN), a wide area network (WAN), the Internet).
In some implementations of the current subject matter, the computing system 500 can be used to execute various interactive computer software applications that can be used for organization, analysis and/or storage of data in various formats. Alternatively, the computing system 500 can be used to execute any type of software applications. These applications can be used to perform various functionalities, e.g., planning functionalities (e.g., generating, managing, editing of spreadsheet documents, word processing documents, and/or any other objects, etc.), computing functionalities, communications functionalities, etc. The applications can include various add-in functionalities (e.g., SAP Integrated Business Planning as an add-in for a spreadsheet and/or other type of program) or can be standalone computing products and/or functionalities. Upon activation within the applications, the functionalities can be used to generate the user interface provided via the input/output device 540. The user interface can be generated and presented to a user by the computing system 500 (e.g., on a computer screen monitor, etc.).
One or more aspects or features of the subject matter described herein can be realized in digital electronic circuitry, integrated circuitry, specially designed ASICs, field programmable gate arrays (FPGAs) computer hardware, firmware, software, and/or combinations thereof. These various aspects or features can include implementation in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device. The programmable system or computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
These computer programs, which can also be referred to as programs, software, software applications, applications, components, or code, include machine instructions for a programmable processor, and can be implemented in a high-level procedural and/or object-oriented programming language, and/or in assembly/machine language. As used herein, the term “machine-readable medium” refers to any computer program product, apparatus and/or device, such as for example magnetic discs, optical disks, memory, and Programmable Logic Devices (PLDs), used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term “machine-readable signal” refers to any signal used to provide machine instructions and/or data to a programmable processor. The machine-readable medium can store such machine instructions non-transitorily, such as for example as would a non-transient solid-state memory or a magnetic hard drive or any equivalent storage medium. The machine-readable medium can alternatively or additionally store such machine instructions in a transient manner, such as for example, as would a processor cache or other random access memory associated with one or more physical processor cores.
To provide for interaction with a user, one or more aspects or features of the subject matter described herein can be implemented on a computer having a display device, such as for example a cathode ray tube (CRT) or a liquid crystal display (LCD) or a light emitting diode (LED) monitor for displaying information to the user and a keyboard and a pointing device, such as for example a mouse or a trackball, by which the user may provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well. For example, feedback provided to the user can be any form of sensory feedback, such as for example visual feedback, auditory feedback, or tactile feedback; and input from the user may be received in any form, including acoustic, speech, or tactile input. Other possible input devices include touch screens or other touch-sensitive devices such as single or multi-point resistive or capacitive track pads, voice recognition hardware and software, optical scanners, optical pointers, digital image capture devices and associated interpretation software, and the like.
In the descriptions above and in the claims, phrases such as “at least one of” or “one or more of” may occur followed by a conjunctive list of elements or features. The term “and/or” may also occur in a list of two or more elements or features. Unless otherwise implicitly or explicitly contradicted by the context in which it used, such a phrase is intended to mean any of the listed elements or features individually or any of the recited elements or features in combination with any of the other recited elements or features. For example, the phrases “at least one of A and B;” “one or more of A and B;” and “A and/or B” are each intended to mean “A alone, B alone, or A and B together.” A similar interpretation is also intended for lists including three or more items. For example, the phrases “at least one of A, B, and C;” “one or more of A, B, and C;” and “A, B, and/or C” are each intended to mean “A alone, B alone, C alone, A and B together, A and C together, B and C together, or A and B and C together.” Use of the term “based on,” above and in the claims is intended to mean, “based at least in part on,” such that an unrecited feature or element is also permissible.
The subject matter described herein can be embodied in systems, apparatus, methods, and/or articles depending on the desired configuration. The implementations set forth in the foregoing description do not represent all implementations consistent with the subject matter described herein. Instead, they are merely some examples consistent with aspects related to the described subject matter. Although a few variations have been described in detail above, other modifications or additions are possible. In particular, further features and/or variations can be provided in addition to those set forth herein. For example, the implementations described above can be directed to various combinations and subcombinations of the disclosed features and/or combinations and subcombinations of several further features disclosed above. In addition, the logic flows depicted in the accompanying figures and/or described herein do not necessarily require the particular order shown, or sequential order, to achieve desirable results. Other implementations may be within the scope of the following claims.
This application claims priority to U.S. Provisional Application No. 62/530,075 entitled MULTI-CLOUD TOPOLOGY AND CONTAINER METADATA MANAGEMENT and filed on Jul. 7, 2017, the disclosure of which is incorporated herein by reference in its entirety.
| Number | Date | Country | |
|---|---|---|---|
| 62530075 | Jul 2017 | US |
