Abstract: A mechanism is provided for managing a high speed memory. An index entry indicates a storage unit in the high speed memory. A corresponding non-free index is set for a different type of low speed memory. The indicated storage unit in the high speed memory is assigned to a corresponding low speed memory by including the index entry in the non-free index. The storage unit in the high speed memory is recovered by demoting the index entry from the non-free index. The mechanism acquires a margin performance loss corresponding to a respective non-free index in response to receipt of a demotion request. The margin performance loss represents a change in a processor read operation time caused by performing a demotion operation in a corresponding non-free index. The mechanism compares the margin performance losses of the respective non-free indexes and selecting a non-free index whose margin performance loss satisfies a demotion condition as a demotion index.

Abstract: Systems and methods are provided for managing storage cache resources among all servers within the cluster storage environment. A method includes partitioning a main cache of a corresponding node into a global cache and a local cache, sharing each global cache of each node with other ones of the nodes of the multiple nodes, and dynamically adjusting a ratio of an amount of space of the main cache making up the global cache and an amount of space of the main cache making up the local cache, based on access latency and cache hit over a predetermined period of time of each of the global cache and the local cache.

Abstract: Systems and methods are provided for managing storage cache resources among all servers within the cluster storage environment. A method includes partitioning a main cache of a corresponding node into a global cache and a local cache, sharing each global cache of each node with other ones of the nodes of the multiple nodes, and dynamically adjusting a ratio of an amount of space of the main cache making up the global cache and an amount of space of the main cache making up the local cache, based on access latency and cache hit over a predetermined period of time of each of the global cache and the local cache.

Abstract: A mechanism is provided for managing a high speed memory. An index entry indicates a storage unit in the high speed memory. A corresponding non-free index is set for a different type of low speed memory. The indicated storage unit in the high speed memory is assigned to a corresponding low speed memory by including the index entry in the non-free index. The storage unit in the high speed memory is recovered by demoting the index entry from the non-free index. The mechanism acquires a margin performance loss corresponding to a respective non-free index in response to receipt of a demotion request. The mechanism compares the margin performance losses of the respective non-free indexes and selecting a non-free index whose margin performance loss satisfies a demotion condition as a demotion index and selects an index entry from the demotion index to perform the demotion operation.

Abstract: A mechanism is for managing a high speed memory. An index entry indicates a storage unit in the high speed memory. A corresponding non-free index is set for a different type of low speed memory. The indicated storage unit in the high speed memory is assigned to a corresponding low speed memory by including the index entry in the non-free index. The storage unit in the high speed memory is recovered by demoting the index entry from the non-free index. The mechanism acquires a margin performance loss corresponding to a respective non-free index in response to receipt of a demotion request. The margin performance loss represents a change in a processor read operation time caused by performing a demotion operation in a corresponding non-free index. The mechanism compares the margin performance losses of the respective non-free indexes and selecting a non-free index whose margin performance loss satisfies a demotion condition as a demotion index.

Abstract: For optimizing data placement in a multi-tiered storage system, system configuration data and system performance data is collected. A plurality of data movement plans are generated, based in part on the system configuration data and the system performance data. A conflict between the plurality of data movement plans are arbitrated to form an execution plan. The data movement plans are performed according to the execution plan.

Abstract: A system includes a data collector, a plurality of data placement optimizers, a data placement arbitrator, and a data mover. The data collector is configured to collect system configuration data and system performance data. The plurality of data placement optimizers are each configured to analyze the system configuration data and the system performance data for developing a corresponding data movement plan. The data placement arbitrator is configured to arbitrate conflicts between at least two data movement plans of generated by the plurality of data placement optimizers to form an execution plan. The data mover is configured to perform the data movement plans according to the execution plan.

Abstract: A mechanism is provided for managing a high speed memory. An index entry indicates a storage unit in the high speed memory. A corresponding non-free index is set for a different type of low speed memory. The indicated storage unit in the high speed memory is assigned to a corresponding tow speed memory by including the index entry in the non-free index. The storage unit in the high speed memory is recovered by demoting the index entry from the non-free index. The mechanism acquires a margin performance loss corresponding to a respective non-free index in response to receipt of a demotion request. The mechanism compares the margin performance losses of the respective non-free indexes and selecting a non-free index whose margin performance loss satisfies a demotion condition as a demotion index and selects an index entry from the demotion index to perform the demotion operation.

Abstract: For optimizing data placement in a multi-tiered storage system, system configuration data and system performance data is collected. A plurality of data movement plans are generated, based in part on the system configuration data and the system performance data. A conflict between the plurality of data movement plans are arbitrated to form an execution plan. The data movement plans are performed according to the execution plan.

Abstract: A system includes a data collector, a plurality of data placement optimizers, a data placement arbitrator, and a data mover. The data collector is configured to collect system configuration data and system performance data. The plurality of data placement optimizers are each configured to analyze the system configuration data and the system performance data for developing a corresponding data movement plan. The data placement arbitrator is configured to arbitrate conflicts between at least two data movement plans of generated by the plurality of data placement optimizers to form an execution plan. The data mover is configured to perform the data movement plans according to the execution plan.