Abstract: Embodiments of the present invention provide a method, system and computer program product for collocating VMs based on memory sharing potential. In an embodiment of the invention, a VM co-location method has been claimed. The method includes selecting a VM from amongst different VMs for server colocation. The method additionally includes computing an individual shared memory factor for each of a set of the VMs with respect to the selected VM. The method yet further includes determining a VM amongst the VMs in the set associated with a highest computed shared memory factor. Finally, the method includes co-locating the determined VM with the selected VM in a single server.

Abstract: Embodiments of the present invention provide a method, system and computer program product for collocating VMs based on memory sharing potential. In an embodiment of the invention, a VM co-location method has been claimed. The method includes selecting a VM from amongst different VMs for server colocation. The method additionally includes computing an individual shared memory factor for each of a set of the VMs with respect to the selected VM. The method yet further includes determining a VM amongst the VMs in the set associated with a highest computed shared memory factor. Finally, the method includes co-locating the determined VM with the selected VM in a single server.

Abstract: Embodiments of the present invention provide a method, system and computer program product for collocating VMs based on memory sharing potential. In an embodiment of the invention, a VM co-location method has been claimed. The method includes selecting a VM from amongst different VMs for server colocation. The method additionally includes computing an individual shared memory factor for each of a set of the VMs with respect to the selected VM. The method yet further includes determining a VM amongst the VMs in the set associated with a highest computed shared memory factor. Finally, the method includes co-locating the determined VM with the selected VM in a single server.

Abstract: Embodiments of the present invention provide a method, system and computer program product for collocating VMs based on memory sharing potential. In an embodiment of the invention, a VM co-location method has been claimed. The method includes selecting a VM from amongst different VMs for server colocation. The method additionally includes computing an individual shared memory factor for each of a set of the VMs with respect to the selected VM. The method yet further includes determining a VM amongst the VMs in the set associated with a highest computed shared memory factor. Finally, the method includes co-locating the determined VM with the selected VM in a single server.

Abstract: A computerized method, program product, and a service that allocates and isolates leaky memory during the execution of an application in a data processing system. A memory controller having several components first identifies a leaky section of memory and delegates to an allocation component to allocate more memory if possible. If, however, the problematic memory section should not be allocated more memory, an isolator component can isolate the memory section and further divide the memory section into subsections and so on. Each section and each subsection may then be tested to determine if more memory can be allocated, tested to determine if memory resources are strained so as to identify the application or its component causing the strain and then binding the memory. Each section and subsection and further divided and isolated until the leaky portion of memory is identified, and as a result, the software component causing the leak can also be identified.

Abstract: A computerized method, program product, and a service that allocates and isolates leaky memory during the execution of an application in a data processing system. A memory controller having several components first identifies a leaky section of memory and delegates to an allocation component to allocate more memory if possible. If, however, the problematic memory section should not be allocated more memory, an isolator component can isolate the memory section and further divide the memory section into subsections and so on. Each section and each subsection may then be tested to determine if more memory can be allocated, tested to determine if memory resources are strained so as to identify the application or its component causing the strain and then binding the memory. Each section and subsection and further divided and isolated until the leaky portion of memory is identified, and as a result, the software component causing the leak can also be identified.

Abstract: A computerized method, program product, and a service that allocates and isolates leaky memory during the execution of an application in a data processing system. A memory controller having several components first identifies a leaky section of memory and delegates to an allocation component to allocate more memory if possible. If, however, the problematic memory section should not be allocated more memory, an isolator component can isolate the memory section and further divide the memory section into subsections and so on. Each section and each subsection may then be tested to determine if more memory can be allocated, tested to determine if memory resources are strained so as to identify the application or its component causing the strain and then binding the memory. Each section and subsection and further divided and isolated until the leaky portion of memory is identified, and as a result, the software component causing the leak can also be identified.

Abstract: A method, system and apparatus for performing selective data processing based upon a static analysis of the code of a compiled object. A compiled object, for example an enterprise bean, can be analyzed to determine how individual methods in the enterprise bean access specific objects. Those specific objects can include, for instance, data members of a class, or class objects passed into one or more individual methods of the enterprise bean. Where the individual methods of the enterprise bean do not mutate or otherwise change the state of the specific objects, those objects can be accessed by reference only. Importantly, where the specific objects are data fields linked to a table in a database as managed by a container managed persistence (CMP) bean, an update to the table will not be required when the static analysis of the enterprise bean otherwise indicates that the data fields are merely accessed, but not updated.

Abstract: A mutability mechanism is provided for parsing an object at loading time. The mutability mechanism inserts a property into the object that indicates whether or not the object is immutable. The mutability mechanism looks at the code for the object and determines whether any other objects can modify the object. If the object cannot be modified after it is created, then the new property is set to indicate that the object is immutable; otherwise, the property is set to indicate that the object is mutable. This property can be inspected at runtime when a call is made to a program object. If an object passed as an argument is marked mutable, a clone of this object must be passed to the callee. However, if an object passed as an argument is marked immutable, a simple reference to the object may be passed as an argument to the callee.

Abstract: A method, system and apparatus for performing selective data processing based upon a static analysis of the code of a compiled object. A compiled object, for example an enterprise bean, can be analyzed to determine how individual methods in the enterprise bean access specific objects. Those specific objects can include, for instance, data members of a class, or class objects passed into one or more individual methods of the enterprise bean. Where the individual methods of the enterprise bean do not mutate or otherwise change the state of the specific objects, those objects can be accessed by reference only. Importantly, where the specific objects are data fields linked to a table in a database as managed by a container managed persistence (CMP) bean, an update to the table will not be required when the static analysis of the enterprise bean otherwise indicates that the data fields are merely accessed, but not updated.

Abstract: A mutability mechanism is provided for parsing an object at loading time. The mutability mechanism inserts a property into the object that indicates whether or not the object is immutable. The mutability mechanism looks at the code for the object and determines whether any other objects can modify the object. If the object cannot be modified after it is created, then the new property is set to indicate that the object is immutable; otherwise, the property is set to indicate that the object is mutable. This property can be inspected at runtime when a call is made to a program object. If an object passed as an argument is marked mutable, a clone of this object must be passed to the callee. However, if an object passed as an argument is marked immutable, a simple reference to the object may be passed as an argument to the callee.

Abstract: A method, apparatus, and computer implemented instructions for enforcing security policies in a data processing system. In response to loading a class, a determination is made as to whether a security policy exists for the class. In the depicted examples, the class is a Java. Code is inserted into the class, wherein the code inserted is based on the policy in response to a determination that a security policy exists for the class.

Abstract: A method, system, and product are disclosed for reordering the processing of HTTP requests. A computer system is included which is executing a Web-based application. A priority is associated with each one of different types of HTTP requests. Multiple HTTP requests are then received by the Web-based application. A priority associated with a type of each of the HTTP requests is determined. The HTTP requests that are associated with a higher priority are processed before processing the HTTP requests that are associated with a lower priority.