Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes uploading, by a first instance of an integrated development environment (IDE), a first source-code change to a change log of a version control system. A second instance of the IDE is used to upload a second source-code change to the change log of the version control system. A determination is made that the second source-code change conflicts with the first source-code change. Based on the determination that the second source-code change conflicts with the first source-code change, generating a notification of the second source-code change is generated in the first instance of the IDE.

Abstract: Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes uploading, by a first instance of an integrated development environment (IDE), a first source-code change to a change log of a version control system. A second instance of the IDE is used to upload a second source-code change to the change log of the version control system. A determination is made that the second source-code change conflicts with the first source-code change. Based on the determination that the second source-code change conflicts with the first source-code change, generating a notification of the second source-code change is generated in the first instance of the IDE.

Abstract: Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Abstract: Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Abstract: Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Abstract: A method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric.

Abstract: Provides control of the workload, flow control, and concurrency control of a computer system through the use of only external performance monitors. Data collected by external performance monitors are used to build a simple, black box model of the computer system, comprising two resources: a virtual bottleneck resource and a delay resource representing all non-bottleneck resources combined. The service times of the two resource types are two parameters of the black box model. The two parameters are evaluated based on historical data collected by the external performance monitors. The workload capacity that avoids saturation of the bottleneck resource is then determined and used as a control variable by a flow controller to limit the workload on the computer system. The workload may include a mix of traffic classes. In such a case, data is collected, parameters are evaluated and control variables are determined for each of the traffic classes.

Abstract: A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer.

Abstract: A method and system for controlling load admission rate of an application server is provided. In the method, actual heap utilization and load admission rate of the application server in current control cycle are detected; based on the detected actual heap utilization and load admission rate, load characteristics variation parameters of the application server are estimated; and control gain of a feedback controller is calculated based on the load characteristics variation parameters; the feedback controller calculates desired load admission rate of the application server in next control cycle by using the calculated control gain. The load admission rate of the application server can be adaptively controlled by tracking changes in workload characteristics of the application server, such that the actual heap utilization of the application server is maintained at or close to target heap utilization.

Abstract: Nodes of the network are organized into a tree structure having a plurality of vertices. Each vertex of the tree structure comprises a group having a plurality of nodes. Membership information is maintained at each node. The membership information for a given node comprises information about a group to which the given node belongs and child groups of the group to which the given node belongs in the tree structure. The steps are performed at least in part by a processor.

Abstract: A method and system for controlling load admission rate of an application server is provided. In the method, actual heap utilization and load admission rate of the application server in current control cycle are detected; based on the detected actual heap utilization and load admission rate, load characteristics variation parameters of the application server are estimated; and control gain of a feedback controller is calculated based on the load characteristics variation parameters; the feedback controller calculates desired load admission rate of the application server in next control cycle by using the calculated control gain. The load admission rate of the application server can be adaptively controlled by tracking changes in workload characteristics of the application server, such that the actual heap utilization of the application server is maintained at or close to target heap utilization.

Abstract: The invention discloses a programming method and system for dynamic client/server network management using proxy servers, by allowing each active proxy server in an arrayed cluster to maintain an updated list of all other operating proxy servers in the cluster. When a client message requesting access to an application server is received by a clustered proxy server, the message may be forwarded to another proxy server (within the cluster) so that message (re)transmissions can pass through the same proxy server as the original message, allowing a proxy server to make consistent routing decisions (and other decisions) pertaining to that message.

Abstract: A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer.

Abstract: The invention discloses a programming method and system for dynamic client/server network management using proxy servers, by allowing each active proxy server in an arrayed cluster to maintain an updated list of all other operating proxy servers in the cluster. When a client message requesting access to an application server is received by a clustered proxy server, the message may be forwarded to another proxy server (within the cluster) so that message (re)transmissions can pass through the same proxy server as the original message, allowing a proxy server to make consistent routing decisions (and other decisions) pertaining to that message.

Abstract: Provides control of the workload, flow control, and concurrency control of a computer system through the use of only external performance monitors. Data collected by external performance monitors are used to build a simple, black box model of the computer system, comprising two resources: a virtual bottleneck resource and a delay resource representing all non-bottleneck resources combined. The service times of the two resource types are two parameters of the black box model. The two parameters are evaluated based on historical data collected by the external performance monitors. The workload capacity that avoids saturation of the bottleneck resource is then determined and used as a control variable by a flow controller to limit the workload on the computer system. The workload may include a mix of traffic classes. In such a case, data is collected, parameters are evaluated and control variables are determined for each of the traffic classes.

Abstract: Techniques are disclosed for determining placements of application instances on computing resources in a computing system such that the application instances can be executed thereon. By way of example, a method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric.

Abstract: Techniques for globally managing systems are provided. One or more measurable effects of at least one hypothetical action to achieve a management goal are determined at a first system manager. The one or more measurable effects are sent from the first system manager to a second system manager. At the second system manager, one or more procedural actions to achieve the management goal are determined in response to the one or more received measurable effects. The one or more procedural actions are executed to achieve the management goal.

Abstract: Techniques for managing membership of a network of nodes are provided. Nodes of the network are organized into a tree structure having a plurality of vertices. Each vertex of the tree structure comprises a group having a plurality of nodes. Membership information is maintained at each node. The membership information for a given node comprises information about a group to which the given node belongs and child groups of the group to which the given node belongs in the tree structure.

Abstract: Techniques are disclosed for determining placements of application instances on computing resources in a computing system such that the application instances can be executed thereon. By way of example, a method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric.