Abstract: Described is a method and system for transparently migrating data between storage systems of a computing environment without disrupting realtime access to the stored data of the storage systems. Specifically, when adding a new storage system to the computing environment, realtime data write operations can be redirected to the new storage system instead of an existing storage system. During the redirection, the data stored on the existing storage system can be accessed for data operations. Concurrently, during the redirection, data stored on the existing storage system can be migrated to the new storage system. When the data migration completes and all the data, stored on the existing storage system prior to the redirection, resides on the new storage system, the new storage system can function as the primary storage system. Thus, storage capacity can increase or be replaced without disrupting data operations.

Abstract: Described is a method and system for transparently migrating data between storage systems of a computing environment without disrupting realtime access to the stored data of the storage systems. Specifically, when adding a new storage system to the computing environment, realtime data write operations can be redirected to the new storage system instead of an existing storage system. During the redirection, the data stored on the existing storage system can be accessed for data operations. Concurrently, during the redirection, data stored on the existing storage system can be migrated to the new storage system. When the data migration completes and all the data, stored on the existing storage system prior to the redirection, resides on the new storage system, the new storage system can function as the primary storage system. Thus, storage capacity can increase or be replaced without disrupting data operations.

Abstract: Described is a method and system for transparently migrating data between storage systems of a computing environment without disrupting realtime access to the stored data of the storage systems. Specifically, when adding a new storage system to the computing environment, realtime data write operations can be redirected to the new storage system instead of an existing storage system. During the redirection, the data stored on the existing storage system can be accessed for data operations. Concurrently, during the redirection, data stored on the existing storage system can be migrated to the new storage system. When the data migration completes and all the data, stored on the existing storage system prior to the redirection, resides on the new storage system, the new storage system can function as the primary storage system. Thus, storage capacity can increase or be replaced without disrupting data operations.

Abstract: Described is a method and system for transparently migrating data between storage systems of a computing environment without disrupting realtime access to the stored data of the storage systems. Specifically, when adding a new storage system to the computing environment, realtime data write operations can be redirected to the new storage system instead of an existing storage system. During the redirection, the data stored on the existing storage system can be accessed for data operations. Concurrently, during the redirection, data stored on the existing storage system can be migrated to the new storage system. When the data migration completes and all the data, stored on the existing storage system prior to the redirection, resides on the new storage system, the new storage system can function as the primary storage system. Thus, storage capacity can increase or be replaced without disrupting data operations.

Abstract: A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time.

Abstract: A method is provided for a data processing system configured to include multiple logical partitions, wherein resources of the system are selectively allocated among respective partitions. In the method, an entity such as a Partition Load Manager or a separate background process is used to manage resources based on locality levels. The method includes the step of evaluating the allocation of resources to each of the partitions at a particular time, in order to select a partition having at least one resource considered to be of low desirability due to its level of locality with respect to the selected partition. The method further comprises identifying each of the other partitions that has a resource matching the resource of low desirability, and determining the overall benefit to the system that would result from trading the resource of low desirability for the matching resource of each of the identified partitions.

Abstract: A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time.

Abstract: A method, system, and program for managing memory page requests in a multi-processor data processing system determines a threshold value of available memory, and dynamically adjusts an allocation time to fulfill a page request if the available memory is below a threshold value. The allocation time to fulfill the page request is based upon a percentage of available memory pages once a page stealer commences a scan for pages. An allocation wait time is inversely proportionally adjusted depending upon the percentage of available memory. The allocation wait time has a duration that increases in time as the percentage of available memory decreases and decreases in time as the percentage of available memory increases. More specifically, an average time per page to allocate a page including a scan time for the scan in computing the average time is determined. Then a tunable value is applied to the average time to determine a wait time.

Abstract: A method is provided for a data processing system configured to include multiple logical partitions, wherein resources of the system are selectively allocated among respective partitions. In the method, an entity such as a Partition Load Manager or a separate background process is used to manage resources based on locality levels. The method includes the step of evaluating the allocation of resources to each of the partitions at a particular time, in order to select a partition having at least one resource considered to be of low desirability due to its level of locality with respect to the selected partition. The method further comprises identifying each of the other partitions that has a resource matching the resource of low desirability, and determining the overall benefit to the system that would result from trading the resource of low desirability for the matching resource of each of the identified partitions.