Abstract: Using a metadata of a layer, a prediction factor including a level of participation of the layer in a set of container images is computed. Each container image includes a corresponding set of layers and is usable to configure a container in a container-based virtualized data processing environment. Using a set of levels of participation corresponding to a set of layers, and using a condition in a prediction algorithm, a subset of layers that have to be pre-provisioned at a node is predicted. The subset of layers is adjusted, to form an adjusted subset of layers, by looking ahead at a container requirement of a workload that is planned for processing at a future time. The adjusted subset of layers is caused to be provisioned on the node prior to the future time.

Abstract: Using a metadata of a layer, a prediction factor including a level of participation of the layer in a set of container images is computed. Each container image includes a corresponding set of layers and is usable to configure a container in a container-based virtualized data processing environment. Using a set of levels of participation corresponding to a set of layers, and using a condition in a prediction algorithm, a subset of layers that have to be pre-provisioned at a node is predicted. The subset of layers is adjusted, to form an adjusted subset of layers, by looking ahead at a container requirement of a workload that is planned for processing at a future time. The adjusted subset of layers is caused to be provisioned on the node prior to the future time.

Abstract: A technique is provided for creating virtual units in a computing environment. A virtual system definition is received by a processor that is utilized to create the virtual units for a virtual system. Relationship constraints between the virtual units in the virtual system are received by the processor. The relationship constraints between the virtual units include a communication link requirement between the virtual units and/or a location requirement between the virtual units. The virtual units in the virtual system are deployed by the processor according to the relationship constraints between virtual units.

Abstract: A system for managing inbound messages in a server complex including one or more message consumers. The system includes a server configured to receive the inbound messages from a first peripheral device and to transmit messages to one or more of the plurality of message consumers. The system also includes an inbound message queue coupled to the server, the inbound message queue configured to store inbound message until an age of any message stored on the inbound message queue exceeds a predetermined threshold.

Abstract: The invention relates to memory overload management for Java virtual machines (JVMs) in Web application sever systems. Disclosed is a method and system of memory overload management for a Web application sever system, wherein the Web application sever system comprises multiple JVMs, the method comprising: determining one or more replica shards for which replacement shall be performed; determining one or more target JVMs for storing a corresponding replica shard set including at least one replica shard from the one or more replica shards; and for each target JVM, performing the following: judging whether the free memory of the target JVM is adequate for storing the corresponding replica shard set; if the judging result is negative, performing the following: causing the target JVM to suspend the creation of session until the free memory of the target JVM becomes adequate for storing the corresponding replica shard set.

Abstract: A method and structure for processing an application program on a computer. In a memory of the computer executing the application, an in-memory cache structure is provided for normally temporarily storing data produced in the processing. An in-memory storage outside the in-memory cache structure is provided in the memory, for by-passing the in-memory cache structure for temporarily storing data under a predetermined condition. A sensor detects an amount of usage of the in-memory cache structure used to store data during the processing. When it is detected that the amount of usage exceeds the predetermined threshold, the processing is controlled so that the data produced in the processing is stored in the in-memory storage rather than in the in-memory cache structure.

Abstract: A method, system and computer program product for storing data in memory. An example system includes at least one multistage application configured to generate intermediate data in a generating stage of the application and consume the intermediate data in a subsequent consuming stage of the application. A runtime profiler is configured to monitor the application's execution and dynamically allocate memory to the application from an in-memory data grid.

Abstract: A technique is provided for creating virtual units in a computing environment. A virtual system definition is received by a processor that is utilized to create the virtual units for a virtual system. Relationship constraints between the virtual units in the virtual system are received by the processor. The relationship constraints between the virtual units include a communication link requirement between the virtual units and/or a location requirement between the virtual units. The virtual units in the virtual system are deployed by the processor according to the relationship constraints between virtual units.

Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. A weight for a message is determined at a message management computing device based upon a number of hops and a latency of networks passed through by the message. A hop latency target for a current hop segment is evaluated relative to an overall latency target and the determined weight for the message. A priority of the message is adjusted in response to determining that the overall latency target, relative to the weight for the message and the hop latency target for the current hop segment, exceeds a configured allowable hop latency deviation for the current hop segment.

Abstract: A method and structure for processing an application program on a computer. In a memory of the computer executing the application, an in-memory cache structure is provided for normally temporarily storing data produced in the processing. An in-memory storage outside the in-memory cache structure is provided in the memory, for by-passing the in-memory cache structure for temporarily storing data under a predetermined condition. A sensor detects an amount of usage of the in-memory cache structure used to store data during the processing. When it is detected that the amount of usage exceeds the predetermined threshold, the processing is controlled so that the data produced in the processing is stored in the in-memory storage rather than in the in-memory cache structure.

Abstract: A system, computer program and method for transmitting requested data from a data source in response to data transmission requests from at least one electronic device according to differential rates of throughput. Data transmission requests are classified into one of a plurality of throughput classes, with each throughput class having an assigned rate of throughput. A proportion of data transmission requests to be processed from each throughput class is selected such that each data transmission request has a rate of throughput approximating the assigned rate of throughput of its class. The requested data is then sent from the data source to the electronic device.

Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. A weight for a message is determined at a message management computing device based upon a number of hops and a latency of networks passed through by the message. A hop latency target for a current hop segment is evaluated relative to an overall latency target and the determined weight for the message. A priority of the message is adjusted in response to determining that the overall latency target, relative to the weight for the message and the hop latency target for the current hop segment, exceeds a configured allowable hop latency deviation for the current hop segment.

Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. In an embodiment of the invention, a method of managing a message being conveyed through a request response protocol network via a path includes: receiving the message; determining for the message at least one of: an incoming portion of the path or an outgoing portion of the path; and adjusting a priority of the message based on a latency target for the determined portion of the path.

Abstract: The invention relates to memory overload management for Java virtual machines (JVMs) in Web application sever systems. Disclosed is a method and system of memory overload management for a Web application sever system, wherein the Web application sever system comprises multiple JVMs, the method comprising: determining one or more replica shards for which replacement shall be performed; determining one or more target JVMs for storing a corresponding replica shard set including at least one replica shard from the one or more replica shards; and for each target JVM, performing the following: judging whether the free memory of the target JVM is adequate for storing the corresponding replica shard set; if the judging result is negative, performing the following: causing the target JVM to suspend the creation of session until the free memory of the target JVM becomes adequate for storing the corresponding replica shard set.

Abstract: A decentralized process to ensure the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible.

Abstract: A method, system and program product for controlling memory overload for a computer system. The invention determines heap utilization of a server; determines a maximum session lifetime a configured percentile of at least one session; determines a traffic rate (comprised of an average traffic rate received from a proxy server and a variance of traffic rate received from a proxy server); and calculates a maximum traffic rate, wherein the maximum traffic rate determines the heap utilization at a maximum heap percentage.

Abstract: A method, system and computer program product for distributing intermediate data of a multistage computer application to a plurality of computers. In one embodiment, a data manager calculates data usage demand of generated intermediate data. A computer manager calculates a computer usage, which is the sum of all data usage demand of each stored intermediate data at the computer. A scheduler selects a target computer from the plurality of computers for storage of the generated intermediate data at such that a variance of the computer usage demand across the plurality of computers is minimized.

Abstract: A method, system and computer program product for storing data in memory. An example system includes at least one multistage application configured to generate intermediate data in a generating stage of the application and consume the intermediate data in a subsequent consuming stage of the application. A runtime profiler is configured to monitor the application's execution and dynamically allocate memory to the application from an in-memory data grid.

Abstract: A method, system and program product for controlling memory overload for a computer system. The invention determines heap utilization of a server; determines a maximum session lifetime a configured percentile of at least one session; determines a traffic rate (comprised of an average traffic rate received from a proxy server and a variance of traffic rate received from a proxy server); and calculates a maximum traffic rate, wherein the maximum traffic rate determines the heap utilization at a maximum heap percentage.

Abstract: A system for managing inbound messages in a server complex including one or more message consumers. The system includes a server configured to receive the inbound messages from a first peripheral device and to transmit messages to one or more of the plurality of message consumers. The system also includes an inbound message queue coupled to the server, the inbound message queue configured to store inbound message and discard at least one message when an age of the message exceeds an expiration time.