Abstract: In one embodiment, a system for placing virtual machines in a virtualization environment receives instructions to place a virtual machine within the virtualization environment, wherein the virtual environment includes a plurality of host machines that include a hypervisor, at least one user virtual machine, and an input/output (I/O) controller and a virtual disk that includes a plurality of storage devices and is accessible by all of the I/O controllers, wherein the I/O controllers conduct I/O transactions with the virtual disk based on I/O requests received from the UVMs. The system determines a predicted resource usage profile for the virtual machine. The system selects, based on the predicted resource usage profile, one of the host machines for placement of the virtual machine. The system places the virtual machine on the selected one of the host machines.

Abstract: In one embodiment, a system for placing virtual machines in a virtualization environment receives instructions to place a virtual machine within the virtualization environment, wherein the virtual environment includes a plurality of host machines that include a hypervisor, at least one user virtual machine, and an input/output (I/O) controller and a virtual disk that includes a plurality of storage devices and is accessible by all of the I/O controllers, wherein the I/O controllers conduct I/O transactions with the virtual disk based on I/O requests received from the UVMs. The system determines a predicted resource usage profile for the virtual machine. The system selects, based on the predicted resource usage profile, one of the host machines for placement of the virtual machine. The system places the virtual machine on the selected one of the host machines.

Abstract: A method and system for automatically and transparently managing a directory in a database system to preferentially use of objects in an in-memory database instead of copies of the objects in disk-based databases, in order to speed up application response times. The methods and systems selectively add or update LDAP entries to leverage advantage of the database objects in the in-memory database, so that the LDAP entries point to the in-memory database instead of disk-based databases.

Abstract: An embodiment of the invention includes a method for managing media files created by a digital camera. More specifically, a content analyzing module tags a media file with one or more location media tags, event media tags, and/or content media tags. The location media tags are indicative of the geographic location where the media file was created. The event media tags are indicative of an event where the media file was created; and, the content media tags are indicative of individual(s) in the media file. A priority analyzing module connected to the content analyzing module determines a priority of the media file based on priority rules and the location media tags, event media tags, and/or the content media tags. A storage management module connected to the priority analyzing module stores the media file based on the determined priority.

Abstract: An embodiment of the invention includes a method for managing media files created by a digital camera. More specifically, a content analyzing module tags a media file with one or more location media tags, event media tags, and/or content media tags. The location media tags are indicative of the geographic location where the media file was created. The event media tags are indicative of an event where the media file was created; and, the content media tags are indicative of individual(s) in the media file. A priority analyzing module connected to the content analyzing module determines a priority of the media file based on priority rules and the location media tags, event media tags, and/or the content media tags. A storage management module connected to the priority analyzing module stores the media file based on the determined priority.

Abstract: Aspects of the present invention reduce a lock wait time in a distributed processing environment. A plurality of wait-for dependencies between a first plurality of transactions and a second plurality of transactions in a distributed processing environment is identified. The first plurality of transactions waits for the second plurality of transactions to release a plurality of locks on a plurality of shared resources. An amount of time the first plurality of transactions will wait for the second plurality of transactions in the distributed processing environment is determined based on the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions. Historical transaction data related to the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions is analyzed.

Abstract: An embodiment of the invention is a program for dynamically managing files to comply with security requirements. In one embodiment, changing security requirements require that the computer system identifies the current storage locations of files along with the files' respective security levels. Files containing changed security levels due to the changed security requirements are relocated to storage locations clustered with storage locations containing files of the same security level. In another embodiment, the computer system receives a file having a certain security level, identifies current storage locations of files with the files' respective security levels, and finally allocates the new file to a storage location clustered with storage locations containing files of the same security level.

Abstract: Aspects of the present invention reduce a lock wait time in a distributed processing environment. A plurality of wait-for dependencies between a first plurality of transactions and a second plurality of transactions in a distributed processing environment is identified. The first plurality of transactions waits for the second plurality of transactions to release a plurality of locks on a plurality of shared resources. An amount of time the first plurality of transactions will wait for the second plurality of transactions in the distributed processing environment is determined based on the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions. Historical transaction data related to the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions is analyzed.

Abstract: An embodiment of the invention is a program for dynamically managing files to comply with security requirements. In one embodiment, changing security requirements require that the computer system identifies the current storage locations of files along with the files' respective security levels. Files containing changed security levels due to the changed security requirements are relocated to storage locations clustered with storage locations containing files of the same security level. In another embodiment, the computer system receives a file having a certain security level, identifies current storage locations of files with the files' respective security levels, and finally allocates the new file to a storage location clustered with storage locations containing files of the same security level.

Abstract: A method, computer program product, and system for rebalancing database table space in a hybrid storage environment of heterogeneous storage units used by a plurality of users to store associated extents. The storage units are ranked according to various performance characteristics such as IOPS rates and power consumption, and the users are ranked according to various characteristics such as whether they have subscribed to standard or premium storage subscriptions. Upon detection of a change in the relative ranking of the users or the storage units, the stored extents are mapped, characterized as standard or priority extents, and redistributed across the storage units if needed to provide higher ranked storage for priority extents and for higher ranked users.

Abstract: A method, computer program product, and system for rebalancing database table space in a hybrid storage environment of heterogeneous storage units used by a plurality of users to store associated extents. The storage units are ranked according to various performance characteristics such as IOPS rates and power consumption, and the users are ranked according to various characteristics such as whether they have subscribed to standard or premium storage subscriptions. Upon detection of a change in the relative ranking of the users or the storage units, the stored extents are mapped, characterized as standard or priority extents, and redistributed across the storage units if needed to provide higher ranked storage for priority extents and for higher ranked users.

Abstract: A method and system for automatically and transparently managing a directory in a database system to preferentially use of objects in an in-memory database instead of copies of the objects in disk-based databases, in order to speed up application response times. The methods and systems selectively add or update LDAP entries to leverage advantage of the database objects in the in-memory database, so that the LDAP entries point to the in-memory database instead of disk-based databases.