International Business Machines Corporation

Joseph H Robichaux

Sujatha Kashyap

Lisa B Maurice

Robert H Bell, Jr

Venkat Rajeev Indukuru

Rajendra D Panda

Donald R DeSota

Steven Paul Hartman

Sameh Sherif Sharkawi

Donald R Desota

In a data storage system with a number of replicas of a file set to one or more replicas, a timer is set to track a time since a last access to the file. Responsive to the timer matching a first timer window threshold, the timer is reset to count to a second timer window threshold and a number of replicas of the file are automatically reduced within the data storage system, wherein the probability that the file will be accessed prior to the first timer window threshold is greater than the probability that the file will be accessed after the first timer window threshold. Responsive to the timer matching the second timer window threshold, the timer is reset to count to a third timer window threshold. Responsive to receiving a read access prior to the timer reaching the third timer window threshold, the number of replicas of the file is increased and the timer reset to count to the second timer window threshold.

Dynamically adjusting the number of replicas of a file according to the probability that the file will be accessed within a distributed file system

In a data storage system with a number of replicas of a file set to one or more replicas, a timer is set to track a time since a last access to the file. Responsive to the timer matching a first timer window threshold, a number of replicas of the file are automatically reduced within the data storage system, wherein the probability that the file will be accessed prior to the first timer window threshold is greater than the probability that the file will be accessed after the first timer window threshold.

In a distributed file system with a number of replicas of a file set to two or more replicas, a computer sets a timer to track a time since a last access to the file, wherein the replicas of the file are distributed across two or more nodes within the distributed file system. Responsive to an access to the file prior to the timer reaching a first timer window threshold, the computer resets the timer. Responsive to the timer matching a first timer window threshold, the computer automatically reduces a number of replicas of the file within the distributed file system, wherein the probability that the file will be accessed prior to the first timer window threshold is greater than the probability that the file will be accessed after the first timer window threshold.

Dynamically adjusting the number of replicas of a file according the probability that the file will be accessed within a distributed file system

According to one aspect of the present disclosure a method and technique for managing memory access is disclosed. The method includes setting a memory databus utilization threshold for each of a plurality of processors of a data processing system to maintain memory databus utilization of the data processing system at or below a system threshold. The method also includes monitoring memory databus utilization for the plurality of processors and, in response to determining that memory databus utilization for at least one of the processors is below its threshold, reallocating at least a portion of unused databus utilization from the at least one processor to at least one of the other processors.

Reallocating unused memory databus utilization to another processor when utilization is below a threshold

According to one aspect of the present disclosure a system and computer program product for managing memory access is disclosed. The system includes a plurality of memory controllers each configured to maintain memory databus utilization by a corresponding processor at or below a threshold to maintain memory databus utilization of the system at or below a system threshold. The system also includes a service processor configured to receive memory databus utilization data from the memory controllers and programmed to, in response to determining that memory databus utilization for at least one of the processors is below its threshold, reallocate at least a portion of unused databus utilization from the at least one processor to at least one of the other processors.

Memory databus utilization management system and computer program product

The projected power consumption for an application program running on a future IHS is determined by generating a power proxy for the application program, and power proxies for a plurality of standard benchmarks. An algorithm correlates the power proxy for the application program, and the power proxies for the standard benchmarks to generate weighted surrogates that are combined with power proxies derived from running the benchmark surrogates on the future IHS to generate the projected power consumption.

Growing community of inventors

Round Rock, TX, United States of America

Joseph H Robichaux