Monitoring and managing of complex multi-role applications

Information

  • Patent Grant
  • 11556361
  • Patent Number
    11,556,361
  • Date Filed
    Wednesday, December 9, 2020
    4 years ago
  • Date Issued
    Tuesday, January 17, 2023
    2 years ago
Abstract
A bundled application includes a plurality of entities such as logical storage volumes, application instances, pods, clusters, and computing nodes that are dependent on one another. Dependencies of the bundled application on individual entities is determined and quantified. Impact of failure of an entity may be determined using the dependencies. Dependency may be determined with reference to redundancy among entities. Usage of an entity by other entities and potential redistribution may be determined.
Description
BACKGROUND
Field of the Invention

This invention relates to orchestration of a multi-role application.


Background of the Invention

A multi-role application may include many objects providing different roles of the application. These objects may be application implementing services, storage volumes, databases, web servers, and the like. One environment that facilitates deployment of such applications is KUBERNETES, which was originally developed by GOOGLE.


It would be an advancement in the art to facilitate the deployment and management of multi-role applications, including those orchestrated using KUBERNETES.





BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through use of the accompanying drawings, in which:



FIG. 1 is a schematic block diagram of a network environment for implementing methods in accordance with an embodiment of the present invention;



FIG. 2 is a schematic block diagram of components of a bundled application in accordance with an embodiment of the present invention;



FIG. 3 is a process flow diagram of a method for determining and quantifying dependency of a bundled application on an entity in accordance with an embodiment of the present invention;



FIG. 4 is a process flow diagram of a method for determining impact of a failure in accordance with an embodiment of the present invention;



FIG. 5 is a process flow diagram of a method for accounting for replication and redundancy in accordance with an embodiment of the present invention;



FIG. 6 is a schematic block diagram of a dependency hierarchy in accordance with an embodiment of the present invention;



FIG. 7 is a process flow diagram of a method for managing usage of a bundled application in accordance with an embodiment of the present invention; and



FIG. 8 is a schematic block diagram of an example computing device suitable for implementing methods in accordance with embodiments of the invention.





DETAILED DESCRIPTION

Referring to FIG. 1, the methods disclosed herein may be performed using the illustrated network environment 100. The network environment 100 includes a storage manager 102 that coordinates the creation of snapshots of storage volumes and maintains records of where snapshots are stored within the network environment 100. In particular, the storage manager 102 may be connected by way of a network 104 to one or more storage nodes 106, each storage node having one or more storage devices 108, e.g. hard disk drives, flash memory, or other persistent or transitory memory. The network 104 may be a local area network (LAN), wide area network (WAN), or any other type of network including wired, fireless, fiber optic, or any other type of network connections.


One or more compute nodes 110 are also coupled to the network 104 and host user applications that generate read and write requests with respect to storage volumes managed by the storage manager 102 and stored within the memory devices 108 of the storage nodes 106.


The methods disclosed herein ascribe certain functions to the storage manager 102, storage nodes 106, and compute node 110. The methods disclosed herein are particularly useful for large scale deployment including large amounts of data distributed over many storage nodes 106 and accessed by many compute nodes 110. However, the methods disclosed herein may also be implemented using a single computer implementing the functions ascribed herein to some or all of the storage manager 102, storage nodes 106, and compute node 110.


A cloud computing platform 112 may be coupled to the network 104 and include cloud computing resources 114 and storage resources 116. The storage resources 116 may include various types of storage including object storage 118 in which data is stored as unstructured data and which is generally less expensive and has higher latency. The storage resources may include file system storage 120 that is implemented as a virtual disk in which data is stored in a structured format, such as within a hierarchical file system or according to an append-only storage system.


The cloud computing platform 112 and corresponding resources 114, 116 may be implemented using any cloud computing platform known in the art such as AMAZON WEB SERVICES (AWS), MICROSOFT AZURE, GOOGLE CLOUD, or the like.


The methods disclosed herein may be of particular advantage when used in an environment with one or more orchestrators. For example, one orchestration layer may be an orchestrator 122 that instantiates a set of applications, such as an application bundle or pipeline of network services, according to a manifest, which may include instantiating various containers, role instances executing within containers. The orchestrator 122 may further request allocation of logical storage volumes by a storage manager 102 that implements storage volumes that are mounted to containers.


Another orchestrator may be a KUBERNETES (hereinafter “Kubernetes”) installation. As known in the art, a Kubernetes installation may include a Kubernetes master 124 that receives instructions in the form of a helm chart, StatefulSet, or operators received from a user or script. The instructions may instruct the Kubernetes master 124 to allocate a Kubernetes node, which is a computer or virtual (e.g., cloud) computing resource that is allocated for providing a service. The Kubernetes master may invoke installation of a Kubelet on the node, which is an agent that implements instructions from the master 124 as well as reports the status of components executing on the node. A node may execute one or more pods, which is a group of one or more containers with shared resources, such as storage resources, network resources, or the like. The pod may further define a virtual machine in which all containers of the pod execute. The pod may define a common name space that is accessible by all of the containers of the pod. A pod may have storage resources associated therewith such as in the form of one or more PVCs (persistent volume claim) that associated with the pod.


The container may implement one or more services, such as a database (MONGO DB, SQL, POSTGRE SQL ORACLE, etc.), webserver, CASSANDRA server, HADOOP component, or any other service known in the art. The service may be configured to provide services to another service of the Kubernetes installation or role instances instantiated and managed by the orchestrator 122 or use another service of the Kubernetes installation or role instance orchestrator 122. The configuration of a service to use or provide a service may be in response to instructions from the Kubernetes master 124 interpreting instructions from the helm chart, StatefulSet, or user operators. The Kubernetes master 124 may instruct the Kubelet to implement these instructions to configure the services.


Referring to FIG. 2, an orchestrator, e.g., one or both of the orchestrator 122 and the Kubernetes master 124, may take as input an application bundle 200. The application bundle 200 refers to scripts, individual instructions, and other programming input to the orchestrator to invoke the instantiation and configuration of application instances in a network environment 100 in order to implement a bundled application, network service pipeline, or other type of installation.


The application bundle 200 may include storage provisioning 202 defining an amount of storage resources to be allocated to a particular entity (container, pod, cluster, application instance, etc.). The storage provisioning 202 may define the creation of logical storage volumes that provide virtualization of storage residing on a storage node 108 or the cloud storage resources 116. Accordingly, storage provisioning 202 may be processed by the storage manager 102 to implement the logical storage volumes on a storage node 108 or in cloud storage resources 116.


The application bundle 200 may include compute provisioning 204 defining provisioning of computing resources such as processing cores on compute nodes 110 or cloud computing resources 114 (e.g., elastic compute cloud (EC2) on AWS). The provisioning 204 may define an amount of computing resources to allocate to a particular container or application instance.


One or both of the storage provisioning 202 and compute provisioning 204 may define provisioning constraints for an entity (logical storage volume or computing resource) with respect to another entity. This may include an affinity constraints (required degree of proximity (same node, same server rack, or same data center)) or anti-affinity constraints (a forbidden degree of proximity (different node, different server rack, or different data center)).


The application bundle 200 may include application instance definitions 206. The application instance definitions 206 may reference executables for clusters, pods, containers, applications, or other programs and define where the executables are to be instantiated (which compute node 110, in which container, which cloud computing resource 114). The definitions 206 may further include configuration information in the form of variables, configurations files, scripts, or the like.


The application bundle 200 may include network and/or topology data 208. The network/topology data 208 may include network addresses of entities instantiated according to the application instance definitions 206, network domains in which the entities are grouped, or other information. The network/topology data 208 may further define relationships between entities. Example relationships may include:

    • one entity using a service provided by another entity.
    • one entity executing on or within another entity (e.g., application instance in a container, entity executing on a node or cloud computing resource 114)
    • one entity being managed by another entity (e.g., container in a pod, pod in a cluster).


That the network/topology data 208 may be incorporated into the application instance definitions 206, i.e. the application instance definitions 206 may include configuration data that configures entities to use network addresses and have required relationships to one or more other entities.


The application bundle 200 may include operation scripts 210. Operation scripts 210 may include scripts that are executed for entities instantiated according to the application bundle or for an entire instance of a bundled application created according to the application bundle 200. The scripts 210 may be executed by the orchestrator 122, Kubernetes master 124, or other entity. Scripts 210 may be defined for performing before, during, or after, an operation with respect to an entity such as creating, backing up, restoring, moving, cloning, performing a health check, or other operations.


The application bundle 200 may be processed by one or both of the orchestrator 122 and Kubernetes master 124 to instantiate and configure various entities on one or more nodes 110. Entities may be instantiated and configured on a cloud computing resource 114 in a like manner.


In the illustrated example, a pod 212 may be instantiated on a node 110. One or more containers 214 may be instantiated on the node 110 and managed by the pod 212. Each container may host one or more application instances 216 and have one or more storage volumes 218 mounted thereto. One or more storage volumes 220 may store the application bundle 200 and may be required to be accessible in order for a bundled application to be created and managed. In particular, application instances 206 and operation scripts 210 may be used throughout a lifespan of a bundled application.



FIG. 2 illustrates elements of a topology that may be present in the bundled application created according to the application bundle 200. An application instance 206 is dependent on the container 214 executing it. A container 214 and its application instances 206 may be dependent on a pod 212 managing it. In addition, pods 212 may belong to a cluster defined according to the application bundle 200. Accordingly, pods 212 and possibly the compute nodes 110 executing them may be managed by a cluster instance.


The application instance 216 may have a dependency on another application instance 222 (use a service provide by it or provide a service to it). The application instance 216 may have one or more users accounts 224 of users that use that application instance. Storage volumes 218, 220 may be hosted by one or more storage nodes 226, 228 or on cloud storage resources 116. The components illustrated in FIG. 2 are exemplary only and a typical bundled application could include many hundreds of entities having any of the illustrated relationships.



FIG. 3 illustrates a method 300 that may be executed with respect to a bundled application in order to characterize dependencies and therefore potential vulnerabilities, of a bundled application, such as one having entities with the relationships shown in FIG. 3. The method 300 may be executed by a computer system executing one or both of the orchestrator 122 and the Kubernetes master 124 or by a different computer system in the network environment 100.


The method 300 may include inspecting 302 compute nodes 110 (or equivalently cloud computing resources 114) and identifying entities hosted thereon, such as identifying 304 pods, identifying 306 application instances, and identifying 308 storage volumes mounted to the compute nodes. Steps 304 and 306 may further include recording relationships: application instances managed by containers of an identified pod, and/or containers managed by an identified pod.


The method 300 may further include identifying other entities that may be part of a bundled application. For example, the method 300 may include identifying clusters and identifying the compute nodes 110 managed by each cluster. In another example, disks 108 within a storage node 106 may be identified and objects within a storage volume implemented on a disk may be identified.


The method 300 may further include identifying storage nodes 106 (or equivalently cloud storage) resources 116 hosting the storage volumes identified at step 308.


The method 300 may include determining 312 dependencies. This may include identifying application instance dependencies. This may include evaluating network/topology data 208 and may also include evaluating application logs to identify references to a first application instance by second application instance, such as the second application instance receiving a request from the first application instance or the second application instance generating a request to the second application instance.


Determining 312 dependencies may include determining dependency on a particular disk 108, i.e. identifying storage volumes having at least a portion hosted on a disk. This information may be obtained from the storage manager 102. Identifying dependencies may include associating application instances with containers hosting them, identifying pods managing containers. This information may likewise be obtained from application logs, logs of the Kubernetes master 124 that created the pods and/or containers, or a listing of such information in the network/topology data 208


The method 300 may include identifying 314 user accounts for the application instances identified at step 306. This may include evaluating application logs for records of access by user accounts or creation of user accounts. Step 314 may include evaluating configuration files or running a script in order to discover user accounts. As used herein, “user accounts” may additionally or alternatively be understood to include “tenant accounts,” i.e. an enterprise that utilizes services provided by the bundled application and that can include a plurality of user accounts associated with it.


The method 300 may further include identifying 316 redundancy. In particular, storage volume may be replicated such that each write to one storage volume is executed with respect to one or more replica storage volumes. An application instance may be a backup of another application instances or multiple application instances may function as a redundancy pool such that a request may be handled by any application instance in the pool. Identifying replication and redundancy may be performed by evaluating the network/topology data 208, which may identify redundancy relationships between entities. Replication and redundancy may also be inferred by evaluating application logs to identify entries recording configuration of an application to function as a replica of another to use another instance as a backup.


The method 300 may then include processing 318 each entity of at least a portion of the entities identified at steps 302, 304, 306, 308 to identify and quantify 320 dependency of the bundled application on that entity.


For example, for a node 106, 110, step 320 may include identifying directly hosted entities (storage volumes, application instances, file objects) using information gathered at steps 306 and/or 310. For hosted, entities, first order entities may be identified as having first order dependencies on the directly hosted entities. For example, this may include containers having a hosted storage volume mounted thereto. A first order dependency may be a pod being dependent on a container managed by the pod. A hosted dependency may include an application hosted by a container. For a first application instance, a first order dependency may include a second application instance that is dependent on the first application instance due to using a service provide by the first application instance. Another example of a first order dependency is a storage volume storing data required for functioning of another entity, such as file objects or a storage volume 220 storing operation scripts or other executables for implementing the application bundle 200.


In a like manner, second, third, fourth, and higher order entities may be identified. For example, second order entities may be entities having a first order dependency on the first order entities, third order entities may be entities having a first order dependency on the second order entities, and so on. As is apparent, the dependencies may be understood as a hierarchy with a root being a node 108, 110 and the directly hosted entities, first order entities, second order entities, etc. being descendants of the node in the hierarchy.


Step 320 may further include generating a metric characterizing dependency on an entity based on the identified dependencies. For example, a “blast radius” may be calculated for each entity processed. In some embodiments, a blast radius is a total number of dependent entities identified (directly hosted, first order, second order, third order, or any number of higher order entities). Note that this metric may account for replication and redundancy. For example, suppose a first order entity has a replica or redundant entity, the first order entity may be either ignored (not counted) or counted as a fraction (e.g., ⅓ if one of 3 replicas or members of a redundancy pool).


In some embodiments, only a particular type of entity is counted for the metric. For example, the number of user accounts having a dependency (first order, second order, third order, etc.) on an entity may be counted as part of the blast radius of that entity.



FIG. 4 illustrates a method 400 that may be executed in order to proactively detect failures and determine their impact on a bundled application. The method 400 may be executed by a computer system executing one or both of the orchestrator 122 and the Kubernetes master 124 or by a different computer system in the network environment 100.


The method 400 may include inspecting hardware devices in the network environment 100 hosting entities of the bundled application. This may include inspecting 402 disks 108 (or equivalently cloud storage resources 116), inspecting 404 compute nodes and storage nodes 106 (or equivalently cloud computing resources 114). The method may further include inspecting 406 pods and inspecting 408 application instances of a bundled application. Other entities that may be inspected may include clusters (e.g., executable implementing a cluster), storage volumes, file objects, and containers of a bundled application. Inspection as used herein may include performing a health check, generating a test transmission (ping, TCP connection, etc.) to determine response time, evaluating an error log, or performing other actions to evaluate a state of the entity being inspected.


If failure of an entity inspected is found 410 to have been detected (“the failed entity”), the method 400 may include propagating 412 the failure to entities implicated by the failure using the failure impact data. In particular, this may include identifying the entities listed in the blast radius of the failed entity, such as the blast radius obtained as described above with respect to the method 300. Step 412 may include transmitting an error message to the entities in the blast radius. Propagation 412 may be performed with reference to a dependency hierarchy of an entity. The failed entity may propagate errors to either its ancestors in a dependency hierarchy of another entity or descendants of the failed entity in the dependency hierarchy of the failed entity or that of another entity that includes the failed entity.


The method 400 may further include quantifying and reporting 414 an impact of the failure detected at step 410. For example, this may include reporting the failure with respect to the dependency metric of the failed entity, e.g., a number of user accounts, impacted by the failure and/or a listing of the user accounts. Step 414 may include reporting the failure to the users associated with the user accounts, e.g., reporting information describing the failure of the failed entity, such as an error message. Quantifying and reporting 414 may further include calculating and reporting counts or listings of other entities dependent on the failed entity, e.g., application instances, pods, storage volumes, etc. The report 414 may indicate a proposed solution to the failure: e.g., replacement of the failed entity, migration of an entity to a different node, perform backup. This action may be reported or may be implemented automatically.


In some embodiments, reports may be generated in the absence of a detected failure and indicate data such as performance, detailed status of an entity (e.g., results of a health check or statuses of sub-components of an entity), a state of replication (e.g., number of operational replicas or other operational entities in a redundancy pool), a state of a task (start up, backup, snapshot creation, rollback), or other information.


Referring to FIG. 5, in some embodiments, quantifying 320 dependency and propagating 412 failure may take into account replication and redundancy. For example, the method 500 may include evaluating 502 whether the failed entity had dependent entities (see definition of first order dependency above). If not, the method 500 ends. If so, the method 500 may include, processing 504 each dependent entity by evaluating 506 whether that dependent entity has an operational replica or redundant entity, i.e., is at least one (or some other minimum number) other replica storage volume current and operational, is there at least one (or some other minimum number) other entity in a redundancy pool including the dependent entity that is operational. Note that “operational” may include not being dependent on the failed entity directly or by way of another intermediate entity. If so, the method 500 ends with respect to that dependent entity and that dependent entity and its dependents are not counted as implicated by the failed entity. If not, then the method 500 may be repeated from step 502 with the dependent entity, i.e. its dependents are identified and their replication status is evaluated according to the method 500.


Accordingly, at step 412 and 414, only those dependent entities that are not replicated or otherwise redundant or dependent on an entity that is not replicated or redundant may be processed, i.e. receive a report of failure or be quantified at step 414. For example, the blast radius of step 414 may be calculated while ignoring those dependent entities that are replicated or redundant as defined above with respect to FIG. 5.


Likewise, when identifying implicated user accounts, those user accounts that are dependent on a replicated or redundant entity may be omitted from a count or listing of implicated user accounts.



FIG. 6 illustrates an example hierarchy 600 of entities that may be evaluated using the method 500. A node 602 (e.g. storage node 106) may host storage volumes 604, 606. Storage volume 604 is replicated and has a sufficient number of operational replicas and therefore the method 500 ends with respect to it and its dependents and storage volume 604 is not part of the blast radius of node 602. In contrast, storage volume 606 does not have a sufficient number of operational replicas. Accordingly, a pod 608 to which the storage volume 606 is mounted is evaluated. The pod 608 hosts two applications instances 610, 612. Application instance 612 is part of redundancy pool with a sufficient number of operational members and is therefore not further considered according to the method 500 and is not part of the blast radius of node 602. Application instance 610 is not part of a redundancy pool with sufficient operational members and is therefore further processed. This may include identifying a dependent application instance 614 and user accounts 616 of that application instance as part of the blast radius of the node 602.



FIG. 7 illustrates a method 700 for using dependency information to improve performance of a bundled application. The method 700 may be executed by a computer system executing one or both of the orchestrator 122 and the Kubernetes master 124 or by a different computer system in the network environment 100.


The method 700 may include monitoring 702 disk reads received by each storage node 106 and updating 704 usage by a source of the reads (or equivalently reads received by a cloud storage resource 116). In particular, a read request may originate from a source entity (user account of an application). The read request may traverse one or more intermediate entities (container hosting the application, pod managing container, other applications or routing components) before being received by the storage node 106. Accordingly, usage of the storage node 106 by these entities and the source entity may be updated in response to each read request. The source and intermediate entities may be identified according to the dependency hierarchy of the storage node or may be specified in the read request itself. For example, the source entity may be identified in the read request and intermediate entities may be identified as being ancestors of the source entity in the dependency hierarchy of the storage node 106. Updating usage may include updating a counter, frequency (reads per unit time), or other statistic for the source entity and intermediate entities in response to the read request.


The method 700 may include monitoring 706 disk writes and updating 708 write usage for the source entity and intermediate entities of the writes. The source and intermediate entities may be identified as described above with respect to step 704. For example, by using an identifier of the source entity included in a write request and the dependency hierarchy of the storage node 106 (or equivalently the cloud storage resource 116) that received the write request as described above. Likewise, updating the write usage of these entities may include updating a counter, frequency (reads per unit time), or other statistic for the source entity and the intermediate entities in response to the write request.


The method 700 may include monitoring 710 network activity and updating 712 network usage for the source entity and intermediate entities of the network activity. Network usage may include usage of a network service, network routing components, or the like. The source entity may be identified as based on a source address of the network activity (e.g., and IP address of an originating application). For example, by using an identifier of the source entity included in network activity, the intermediate entities may be determined from the dependency hierarchy of the entity that processed the network activity. Updating 712 the network usage of these entities may include updating a counter, frequency (transmissions per unit time), or other statistic for the source entity and the intermediate entities in response to the network activity.


The method 700 may further include characterizing 714 some or all of read activity, write activity, and network activity of source entities and generating 716 a proposed redistribution of node assignments according to the characterization. Characterizing 714 may include determining, for a given destination entity (destination of a write request, read request, or network activity) usage by source entities, such as the top N source entities with highest usage (write, read, and or network usage) of the destination entity. A proposed redistribution may include offloading the source entity with the highest usage to a different destination, e.g., host the storage volume used by the source entity with highest read usage, write usage, or combination of read and write usage, on a different storage node 106. The proposed redistribution may be transmitted to an administrator of the bundled application or automatically implemented by the orchestrator 122 or KUBERNETES master 124.



FIG. 8 is a block diagram illustrating an example computing device 800. Computing device 800 may be used to perform various procedures, such as those discussed herein. The storage manager 102, storage nodes 106, compute nodes 110, and cloud computing platform 112, may have some or all of the attributes of the computing device 800.


Computing device 800 includes one or more processor(s) 802, one or more memory device(s) 804, one or more interface(s) 806, one or more mass storage device(s) 808, one or more Input/output (I/O) device(s) 810, and a display device 830 all of which are coupled to a bus 812. Processor(s) 802 include one or more processors or controllers that execute instructions stored in memory device(s) 804 and/or mass storage device(s) 808. Processor(s) 802 may also include various types of computer-readable media, such as cache memory.


Memory device(s) 804 include various computer-readable media, such as volatile memory (e.g., random access memory (RAM) 814) and/or nonvolatile memory (e.g., read-only memory (ROM) 816). Memory device(s) 804 may also include rewritable ROM, such as Flash memory.


Mass storage device(s) 808 include various computer readable media, such as magnetic tapes, magnetic disks, optical disks, solid-state memory (e.g., Flash memory), and so forth. As shown in FIG. 8, a particular mass storage device is a hard disk drive 824. Various drives may also be included in mass storage device(s) 808 to enable reading from and/or writing to the various computer readable media. Mass storage device(s) 808 include removable media 826 and/or non-removable media.


I/O device(s) 810 include various devices that allow data and/or other information to be input to or retrieved from computing device 800. Example I/O device(s) 810 include cursor control devices, keyboards, keypads, microphones, monitors or other display devices, speakers, printers, network interface cards, modems, lenses, CCDs or other image capture devices, and the like.


Display device 830 includes any type of device capable of displaying information to one or more users of computing device 800. Examples of display device 830 include a monitor, display terminal, video projection device, and the like.


Interface(s) 806 include various interfaces that allow computing device 800 to interact with other systems, devices, or computing environments. Example interface(s) 806 include any number of different network interfaces 820, such as interfaces to local area networks (LANs), wide area networks (WANs), wireless networks, and the Internet. Other interface(s) include user interface 818 and peripheral device interface 822. The interface(s) 806 may also include one or more peripheral interfaces such as interfaces for printers, pointing devices (mice, track pad, etc.), keyboards, and the like.


Bus 812 allows processor(s) 802, memory device(s) 804, interface(s) 806, mass storage device(s) 808, I/O device(s) 810, and display device 830 to communicate with one another, as well as other devices or components coupled to bus 812. Bus 812 represents one or more of several types of bus structures, such as a system bus, PCI bus, IEEE 1394 bus, USB bus, and so forth.


For purposes of illustration, programs and other executable program components are shown herein as discrete blocks, although it is understood that such programs and components may reside at various times in different storage components of computing device 800, and are executed by processor(s) 802. Alternatively, the systems and procedures described herein can be implemented in hardware, or a combination of hardware, software, and/or firmware. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein.


In the above disclosure, reference has been made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration specific implementations in which the disclosure may be practiced. It is understood that other implementations may be utilized and structural changes may be made without departing from the scope of the present disclosure. References in the specification to “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.


Implementations of the systems, devices, and methods disclosed herein may comprise or utilize a special purpose or general-purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed herein. Implementations within the scope of the present disclosure may also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are computer storage media (devices). Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, implementations of the disclosure can comprise at least two distinctly different kinds of computer-readable media: computer storage media (devices) and transmission media.


Computer storage media (devices) includes RAM, ROM, EEPROM, CD-ROM, solid state drives (“SSDs”) (e.g., based on RAM), Flash memory, phase-change memory (“PCM”), other types of memory, other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.


An implementation of the devices, systems, and methods disclosed herein may communicate over a computer network. A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links, which can be used to carry desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above should also be included within the scope of computer-readable media.


Computer-executable instructions comprise, for example, instructions and data which, when executed at a processor, cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.


Those skilled in the art will appreciate that the disclosure may be practiced in network computing environments with many types of computer system configurations, including, an in-dash vehicle computer, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, tablets, pagers, routers, switches, various storage devices, and the like. The disclosure may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices.


Further, where appropriate, functions described herein can be performed in one or more of: hardware, software, firmware, digital components, or analog components. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein. Certain terms are used throughout the description and claims to refer to particular system components. As one skilled in the art will appreciate, components may be referred to by different names. This document does not intend to distinguish between components that differ in name, but not function.


It should be noted that the sensor embodiments discussed above may comprise computer hardware, software, firmware, or any combination thereof to perform at least a portion of their functions. For example, a sensor may include computer code configured to be executed in one or more processors, and may include hardware logic/electrical circuitry controlled by the computer code. These example devices are provided herein purposes of illustration, and are not intended to be limiting. Embodiments of the present disclosure may be implemented in further types of devices, as would be known to persons skilled in the relevant art(s).


At least some embodiments of the disclosure have been directed to computer program products comprising such logic (e.g., in the form of software) stored on any computer useable medium. Such software, when executed in one or more data processing devices, causes a device to operate as described herein.


While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the disclosure. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents. The foregoing description has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. Further, it should be noted that any or all of the aforementioned alternate implementations may be used in any combination desired to form additional hybrid implementations of the disclosure.

Claims
  • 1. A method comprising: providing a network environment including a plurality of computing nodes and a plurality of storage nodes;instantiating a bundled application in the network environment resulting in instantiation of a plurality of application instances in the network environment; anddetermining a dependency of the bundled application on a subject entity of a plurality of entities, the plurality of entities including the plurality of computing nodes, the plurality of storage nodes, and the plurality of application instances, determining the dependency of the bundled application on the subject entity including identifying a group of the plurality of entities that are dependent on the subject entity either directly or indirectly and that are not redundant with respect to another entity of the plurality of entities that is not dependent on the subject entity;further comprising, generating a dependency metric for the subject entity according to dependency of the bundled application on the subject entity;wherein the dependency metric is a number of user accounts associated with a portion of the plurality of application instances that are in the group.
  • 2. The method of claim 1, wherein the plurality of entities include a plurality of storage volumes hosted by the plurality of storage nodes and the group does not include storage volumes that are replicated independently of the subject entity.
  • 3. The method of claim 1, wherein the plurality of entities further include containers hosting the plurality of application instances.
  • 4. The method of claim 3, wherein the plurality of entities further include pods managing the containers.
  • 5. The method of claim 1, wherein the network environment is a cloud computing environment.
  • 6. The method of claim 1, further comprising: monitoring usage of the subject entity by other entities of the plurality of entities; andgenerating a proposed redistribution of other entities of the plurality of entities according to the usage.
  • 7. The method of claim 1, wherein the plurality of application instances implement a pipeline of network services.
  • 8. The method of claim 1, wherein instantiating the bundled application comprises instantiating the bundled application using KUBERNETES.
  • 9. A system comprising: a network environment including a plurality of nodes coupled to one another by a network, each node of the plurality of nodes including one or more processing devices and one or more memory devices;wherein one or more nodes of the plurality of nodes are programmed to: instantiate a bundled application in the network environment resulting in instantiation of a plurality of application instances in the network environment; anddetermine a dependency of the bundled application on a subject entity of a plurality of entities by identifying a group of the plurality of entities that are dependent on the subject entity either directly or indirectly and that are not redundant with respect to another entity of the plurality of entities that is not dependent on the subject entity, the plurality of entities including the plurality of nodes, and the plurality of application instances;wherein the one or more nodes are further configured to generate a dependency metric for the subject entity according to dependency of the bundled application on the subject entity;wherein the dependency metric is a number of user accounts associated with a portion of the plurality of application instances that are in the group.
  • 10. The system of claim 9, wherein the plurality of entities include a plurality of storage volumes hosted by a portion of the plurality of nodes and the group does not include storage volumes that are replicated independently of the subject entity.
  • 11. The system of claim 9, wherein the plurality of entities further include containers hosting the plurality of application instances.
  • 12. The system of claim 11, wherein the plurality of entities further include pods managing the containers.
  • 13. The system of claim 9, wherein the network environment is a cloud computing environment.
  • 14. The system of claim 9, wherein the one or more nodes are further programmed to: monitor usage of the subject entity by other entities of the plurality of entities; andgenerate a proposed redistribution of other entities of the plurality of entities according to the usage.
  • 15. The system of claim 9, wherein the plurality of application instances implement a pipeline of network services.
  • 16. The system of claim 9, wherein the one or more nodes execute a KUBERNETES master.
US Referenced Citations (346)
Number Name Date Kind
3715573 Vogelsberg Feb 1973 A
4310883 Clifton Jan 1982 A
5602993 Stromberg Feb 1997 A
5680513 Hyland Oct 1997 A
5796290 Takahashi Aug 1998 A
6014669 Slaughter Jan 2000 A
6052797 Ofek Apr 2000 A
6119214 Dirks Sep 2000 A
6157963 Courtright, II Dec 2000 A
6161191 Slaughter Dec 2000 A
6298478 Nally Oct 2001 B1
6301707 Carroll Oct 2001 B1
6311193 Sekido Oct 2001 B1
6851034 Challenger Feb 2005 B2
6886160 Lee Apr 2005 B1
6895485 Dekoning May 2005 B1
6957221 Hart Oct 2005 B1
7096465 Dardinski Aug 2006 B1
7111055 Falkner Sep 2006 B2
7171659 Becker Jan 2007 B2
7246351 Bloch Jul 2007 B2
7305671 Davidov Dec 2007 B2
7386752 Rakic Jun 2008 B1
7461374 Balint Dec 2008 B1
7467268 Lindemann Dec 2008 B2
7535854 Luo May 2009 B2
7590620 Pike Sep 2009 B1
7698698 Skan Apr 2010 B2
7721283 Kovachka May 2010 B2
7734859 Daniel Jun 2010 B2
7738457 Nordmark Jun 2010 B2
7779091 Wilkinson Aug 2010 B2
7797693 Gustafson Sep 2010 B1
7984485 Rao Jul 2011 B1
8037471 Keller Oct 2011 B2
8046450 Schloss Oct 2011 B1
8060522 Birdwell Nov 2011 B2
8121874 Guheen Feb 2012 B1
8171141 Offer May 2012 B1
8219821 Zimmels Jul 2012 B2
8250033 De Souter Aug 2012 B1
8261295 Risbood Sep 2012 B1
8326883 Pizzorni Dec 2012 B2
8392498 Berg Mar 2013 B2
8429346 Chen Apr 2013 B1
8464241 Hayton Jun 2013 B2
8505003 Bowen Aug 2013 B2
8527544 Colgrove Sep 2013 B1
8589447 Grunwald et al. Nov 2013 B1
8601467 Hofhansl Dec 2013 B2
8620973 Veeraswamy Dec 2013 B1
8666933 Pizzorni Mar 2014 B2
8745003 Patterson Jun 2014 B1
8775751 Pendharkar Jul 2014 B1
8782632 Chigurapati Jul 2014 B1
8788634 Krig Jul 2014 B2
8832324 Hodges Sep 2014 B1
8886806 Tung Nov 2014 B2
8909885 Corbett Dec 2014 B2
8954383 Vempati Feb 2015 B1
8954568 Krishnan Feb 2015 B2
8966198 Harris Feb 2015 B1
9009542 Marr Apr 2015 B1
9134992 Wong Sep 2015 B2
9146769 Shankar Sep 2015 B1
9148465 Gambardella Sep 2015 B2
9152337 Kono Oct 2015 B2
9167028 Bansal Oct 2015 B1
9280591 Kharatishvili Mar 2016 B1
9330155 Bono May 2016 B1
9336060 Nori May 2016 B2
9342444 Minckler May 2016 B2
9367301 Serrano Jun 2016 B1
9390128 Seetala Jul 2016 B1
9436693 Lockhart Sep 2016 B1
9514160 Song Dec 2016 B2
9521198 Agarwala Dec 2016 B1
9569274 Tarta Feb 2017 B2
9569480 Provencher Feb 2017 B2
9590872 Jagtap Mar 2017 B1
9600193 Ahrens Mar 2017 B2
9613119 Aron Apr 2017 B1
9619389 Roug Apr 2017 B1
9635132 Lin Apr 2017 B1
9667470 Prathipati May 2017 B2
9733992 Poeluev Aug 2017 B1
9747096 Searle Aug 2017 B2
9870366 Duan Jan 2018 B1
9880933 Gupta Jan 2018 B1
9892265 Tripathy Feb 2018 B1
9898471 Liu Feb 2018 B1
9929916 Subramanian Mar 2018 B1
9998955 MacCarthaigh Jun 2018 B1
10019459 Agarwala Jul 2018 B1
10042628 Thompson Aug 2018 B2
10061520 Zhao Aug 2018 B1
10133619 Nagpal Nov 2018 B1
10169169 Shaikh Jan 2019 B1
10191778 Yang Jan 2019 B1
10241774 Spivak Mar 2019 B2
10282229 Wagner May 2019 B2
10339112 Ranade Jul 2019 B1
10346001 Greenberg Jul 2019 B2
10353634 Greenwood Jul 2019 B1
10430434 Sun Oct 2019 B2
10496653 Epshteyn Dec 2019 B1
10564850 Gud Feb 2020 B1
10657119 Acheson May 2020 B1
10705878 Liu Jul 2020 B2
10922303 Bruck Feb 2021 B1
10956246 Bagde Mar 2021 B1
11082333 Lam Aug 2021 B1
11093387 Chinthekindi Aug 2021 B1
20020141390 Fangman Oct 2002 A1
20030126426 Frye Jul 2003 A1
20040010716 Childress Jan 2004 A1
20040153703 Vigue Aug 2004 A1
20040221125 Ananthanarayanan Nov 2004 A1
20050065986 Bixby Mar 2005 A1
20050216895 Tran Sep 2005 A1
20050256948 Hu Nov 2005 A1
20060025908 Rachlin Feb 2006 A1
20060053357 Rajski Mar 2006 A1
20060085674 Ananthamurthy Apr 2006 A1
20060259686 Sonobe Nov 2006 A1
20070006015 Rao Jan 2007 A1
20070016786 Waltermann Jan 2007 A1
20070033356 Erlikhman Feb 2007 A1
20070067583 Zohar Mar 2007 A1
20070165625 Eisner Jul 2007 A1
20070169113 Moore Jul 2007 A1
20070260842 Faibish Nov 2007 A1
20070277056 Varadarajan Nov 2007 A1
20070288791 Allen Dec 2007 A1
20080010421 Chen Jan 2008 A1
20080068899 Ogihara Mar 2008 A1
20080083012 Yu Apr 2008 A1
20080189468 Schmidt Aug 2008 A1
20080235544 Lai Sep 2008 A1
20080256141 Wayda Oct 2008 A1
20080256143 Reddy Oct 2008 A1
20080256167 Branson Oct 2008 A1
20080263400 Waters Oct 2008 A1
20080270592 Choudhary Oct 2008 A1
20090144497 Withers Jun 2009 A1
20090172335 Kulkarni Jul 2009 A1
20090240809 La Frese Sep 2009 A1
20090254701 Kurokawa Oct 2009 A1
20090307249 Koifman Dec 2009 A1
20100100251 Chao Apr 2010 A1
20100161941 Vyshetsky Jun 2010 A1
20100162233 Ku Jun 2010 A1
20100211815 Mankovskii Aug 2010 A1
20100274984 Inomata Oct 2010 A1
20100299309 Maki Nov 2010 A1
20100306495 Kumano Dec 2010 A1
20100332730 Royer Dec 2010 A1
20110083126 Bhakta Apr 2011 A1
20110119664 Kimura May 2011 A1
20110161291 Taleck Jun 2011 A1
20110188506 Arribas Aug 2011 A1
20110208928 Chandra Aug 2011 A1
20110239227 Schaefer Sep 2011 A1
20110246420 Wang Oct 2011 A1
20110276951 Jain Nov 2011 A1
20120005557 Mardiks Jan 2012 A1
20120016845 Bates Jan 2012 A1
20120066449 Colgrove Mar 2012 A1
20120102369 Hiltunen Apr 2012 A1
20120137059 Yang May 2012 A1
20120159519 Matsuda Jun 2012 A1
20120216052 Dunn Aug 2012 A1
20120226667 Volvovski Sep 2012 A1
20120240012 Weathers Sep 2012 A1
20120259819 Patwardhan Oct 2012 A1
20120265976 Spiers Oct 2012 A1
20120303348 Lu Nov 2012 A1
20120311671 Wood Dec 2012 A1
20120331113 Jain Dec 2012 A1
20130054552 Hawkins Feb 2013 A1
20130054932 Acharya Feb 2013 A1
20130080723 Sawa Mar 2013 A1
20130179208 Chung Jul 2013 A1
20130254521 Bealkowski Sep 2013 A1
20130282662 Kumarasamy Oct 2013 A1
20130332688 Corbett Dec 2013 A1
20130339659 Bybell Dec 2013 A1
20130346618 Holkkola Dec 2013 A1
20130346709 Wang Dec 2013 A1
20140006465 Davis Jan 2014 A1
20140047263 Coatney Feb 2014 A1
20140047341 Breternitz Feb 2014 A1
20140047342 Breternitz Feb 2014 A1
20140058871 Marr Feb 2014 A1
20140059527 Gagliardi Feb 2014 A1
20140059528 Gagliardi Feb 2014 A1
20140089265 Talagala Mar 2014 A1
20140108483 Tarta Apr 2014 A1
20140130040 Lemanski May 2014 A1
20140149696 Frenkel May 2014 A1
20140181676 Samborskyy Jun 2014 A1
20140195847 Webman Jul 2014 A1
20140245319 Fellows Aug 2014 A1
20140281449 Christopher Sep 2014 A1
20140282596 Bourbonnais Sep 2014 A1
20150007171 Blake Jan 2015 A1
20150019495 Siden Jan 2015 A1
20150046644 Karp Feb 2015 A1
20150067031 Acharya Mar 2015 A1
20150074358 Flinsbaugh Mar 2015 A1
20150106549 Brown Apr 2015 A1
20150112951 Narayanamurthy et al. Apr 2015 A1
20150134857 Hahn May 2015 A1
20150149605 De La Iglesia May 2015 A1
20150186217 Eslami Jul 2015 A1
20150278333 Hirose Oct 2015 A1
20150317169 Sinha Nov 2015 A1
20150317212 Lee Nov 2015 A1
20150319160 Ferguson Nov 2015 A1
20150326481 Rector Nov 2015 A1
20150379287 Mathur Dec 2015 A1
20160011816 Aizman Jan 2016 A1
20160026667 Mukherjee Jan 2016 A1
20160042005 Liu Feb 2016 A1
20160124775 Ashtiani May 2016 A1
20160150047 O'Hare May 2016 A1
20160191308 Berry Jun 2016 A1
20160197995 Lu Jul 2016 A1
20160239412 Wada Aug 2016 A1
20160259597 Worley Sep 2016 A1
20160283261 Nakatsu Sep 2016 A1
20160357456 Iwasaki Dec 2016 A1
20160357548 Stanton Dec 2016 A1
20160373327 Degioanni Dec 2016 A1
20170034023 Nickolov Feb 2017 A1
20170060710 Ramani Mar 2017 A1
20170060975 Akyureklier Mar 2017 A1
20170075749 Ambichl Mar 2017 A1
20170139645 Byun May 2017 A1
20170149843 Amulothu May 2017 A1
20170168903 Dornemann Jun 2017 A1
20170192889 Sato Jul 2017 A1
20170201419 Garcia Jul 2017 A1
20170206017 Sun Jul 2017 A1
20170214550 Kumar Jul 2017 A1
20170235649 Shah Aug 2017 A1
20170242617 Walsh Aug 2017 A1
20170242719 Tsirkin Aug 2017 A1
20170244557 Riel Aug 2017 A1
20170244787 Rangasamy Aug 2017 A1
20170293450 Battaje Oct 2017 A1
20170322954 Horowitz Nov 2017 A1
20170337492 Chen Nov 2017 A1
20170344354 Schiefelbein Nov 2017 A1
20170371551 Sachdev Dec 2017 A1
20180006896 MacNamara Jan 2018 A1
20180024889 Verma Jan 2018 A1
20180046553 Okamoto Feb 2018 A1
20180082053 Brown Mar 2018 A1
20180107419 Sachdev Apr 2018 A1
20180113625 Sancheti Apr 2018 A1
20180113770 Hasanov Apr 2018 A1
20180136931 Hendrich May 2018 A1
20180137306 Brady May 2018 A1
20180150306 Govindaraju May 2018 A1
20180159745 Byers Jun 2018 A1
20180165170 Hegdal Jun 2018 A1
20180218000 Setty Aug 2018 A1
20180225140 Titus Aug 2018 A1
20180225216 Filippo Aug 2018 A1
20180246670 Baptist Aug 2018 A1
20180246745 Aronovich Aug 2018 A1
20180247064 Aronovich Aug 2018 A1
20180267820 Jang Sep 2018 A1
20180276215 Chiba Sep 2018 A1
20180285164 Hu Oct 2018 A1
20180285223 McBride Oct 2018 A1
20180285353 Ramohalli Oct 2018 A1
20180287883 Joshi Oct 2018 A1
20180288129 Joshi Oct 2018 A1
20180300653 Srinivasan Oct 2018 A1
20180302335 Gao Oct 2018 A1
20180329981 Gupte Nov 2018 A1
20180364917 Ki Dec 2018 A1
20180365092 Linetskiy Dec 2018 A1
20180375728 Gangil Dec 2018 A1
20190004704 Rathi Jan 2019 A1
20190065061 Kim Feb 2019 A1
20190065323 Dhamdhere Feb 2019 A1
20190073132 Zhou Mar 2019 A1
20190073372 Venkatesan Mar 2019 A1
20190079928 Kumar Mar 2019 A1
20190089651 Pignatari Mar 2019 A1
20190102226 Caldato Apr 2019 A1
20190109756 Abu Lebdeh Apr 2019 A1
20190116690 Chen Apr 2019 A1
20190132203 Wince May 2019 A1
20190148932 Benesch May 2019 A1
20190156023 Gerebe May 2019 A1
20190163460 Kludy May 2019 A1
20190188094 Ramamoorthi Jun 2019 A1
20190190803 Joshi Jun 2019 A1
20190199601 Lynar Jun 2019 A1
20190213080 Alluboyina Jul 2019 A1
20190213085 Alluboyina Jul 2019 A1
20190215313 Doshi Jul 2019 A1
20190220266 Doshi Jul 2019 A1
20190220315 Vallala Jul 2019 A1
20190220527 Sarda Jul 2019 A1
20190235895 Ovesea Aug 2019 A1
20190250849 Compton Aug 2019 A1
20190272205 Jiang Sep 2019 A1
20190278624 Bade Sep 2019 A1
20190324666 Kusters Oct 2019 A1
20190334727 Kaufman Oct 2019 A1
20190335551 Williams Oct 2019 A1
20190361748 Walters Nov 2019 A1
20190369273 Liu Dec 2019 A1
20190370018 Kirkpatrick Dec 2019 A1
20200019414 Byard Jan 2020 A1
20200026635 Gaber Jan 2020 A1
20200034193 Jayaram Jan 2020 A1
20200034254 Natanzon Jan 2020 A1
20200065406 Lppatapu Feb 2020 A1
20200073586 Kurata Mar 2020 A1
20200083909 Kusters Mar 2020 A1
20200150977 Wang May 2020 A1
20200162330 Vadapalli May 2020 A1
20200257519 Shen Aug 2020 A1
20200310774 Zhu Oct 2020 A1
20200310915 Alluboyina Oct 2020 A1
20200344326 Ghosh Oct 2020 A1
20200356537 Sun Nov 2020 A1
20200412625 Bagarolo Dec 2020 A1
20210011775 Baxter Jan 2021 A1
20210029000 Mordani Jan 2021 A1
20210042151 Muller Feb 2021 A1
20210064536 Palmer Mar 2021 A1
20210067607 Gardner Mar 2021 A1
20210126839 Rudrachar Apr 2021 A1
20210141655 Gamage May 2021 A1
20210157622 Ananthapur May 2021 A1
20210168034 Qian Jun 2021 A1
20210271506 Ganguly Sep 2021 A1
20210406079 Atur Dec 2021 A1
20220107842 Jiang Apr 2022 A1
Foreign Referenced Citations (1)
Number Date Country
WO2017008675 Jan 2017 WO
Non-Patent Literature Citations (15)
Entry
Segment map, GOOGLE, Feb. 4, 2019.
Fast and Secure Append-Only storage with Infinite Capacity, ZHENG, Aug. 27, 2003.
User Mode and Kernel Mode, MICROSOFT, Apr. 19, 2017.
Precise memory leak detection for java software using container profiling, XU, Jul. 2013.
Mogi et al., “Dynamic Parity Stripe Reorganizations for RAID5 Disk Arrays,” 1994, IEEE, pp. 17-26.
Syed et al, “The Container Manager Pattern”, ACM, pp. 1-9 (Year 2017).
Rehmann et al., “Performance of Containerized Database Management Systems”, ACM, pp. 1-6 (Year 2018).
Awada et al, “Improving Resource Efficiency of Container-instance Clusters on Clouds”, IEEE, pp. 929-934 (Year 2017).
Stankovski et al, “Implementing Time—Critical Functionalities with a Distributed Adaptive Container Architecture”, ACM, pp. 1-5 (Year 2016).
Dhakate et al, “Distributed Cloud Monitoring Using Docker as Next Generation Container Virtualization Technology” IEEE, pp. 1-5 (Year 2015).
Crameri et al, “Staged Deployment in Mirage, an Integrated Software Upgrade Testing and Distribution System”, ACM, pp. 221-236 (Year: 2007).
Cosmo et al, “Packages Upgrades in FOSS Distributions: Details and Challenges”, ACM pp. 1-5 (Year: 2008).
Burg et al, “Atomic Upgrading of Distributed Systems”, ACM, pp. 1-5 (Year: 2008).
Souer et al, “Component Based Architecture forWeb Content Management: Runtime Deployable Web Manager Component Bundles”, IEEE, pp. 366-369 (Year: 2008).
Weingartner et al, “A distributed autonomic management framework for cloud computing orchestration.” In 2016 IEEE World Congress on Services (Year: 2016).
Related Publications (1)
Number Date Country
20220179671 A1 Jun 2022 US