# US 2012/0254544 A1 · Systems and methods for managing destage conflicts

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254544 A1
- Document ID: US20120254544A1
- Status: Published application
- Kind: A1
- Application number: 13/493,794
- Filed: 2012-06-11
- Published: 2012-10-04
- Earliest claimed: 2010-12-10
- Assignees: International Business Machines Corporation
- Inventors: Brent C. BEARDSLEY; Michael T. BENHASE; Binny S. GILL; Lokesh M. GUPTA; Sonny E. WILLIAMS
- Web page: https://patentgrep.com/patent/US20120254544A1

## CPC

- G06F 12/0891: using clearing, invalidating or resetting means
- G06F 12/023: {Free address space management}
- G06F 12/0804: with main memory updating (G06F12/0806 takes precedence)
- G06F 12/0866: for peripheral storage systems, e.g. disk cache
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system includes a cache partitioned into multiple ranks configured to store multiple storage tracks and a processor coupled to the cache. The processor is configured to perform the following method. One method includes allocating an amount of storage space in the cache to each rank and monitoring a current amount of storage space used by each rank with respect to the amount of storage space allocated to each respective rank. The method further includes destaging storage tracks from each rank until the current amount of storage space used by each respective rank is equal to a predetermined minimum amount of storage space with respect to the amount of storage space allocated to each rank.

## Claims

### Claim 1

A method for managing destage conflicts in a cache partitioned into a plurality of ranks configured to store a plurality of storage tracks, the method comprising:
allocating, by a processor coupled to the cache, an amount of storage space in the cache to each rank;
monitoring a current amount of storage space used by each rank with respect to the amount of storage space allocated to each respective rank; and
destaging storage tracks from each rank until the current amount of storage space used by each respective rank is equal to a predetermined minimum amount of storage space with respect to the amount of storage space allocated to each rank.

### Claim 2 (depends on 1)

The method of claim 1, further comprising ceasing to destage storage tracks from each rank that includes the predetermined minimum amount of storage space.

### Claim 3 (depends on 2)

The method of claim 2, wherein allocating the amount of storage space in the cache comprises allocating no more that twenty five percent (25%) of a total amount of storage space in the cache to any one rank.

### Claim 4 (depends on 3)

The method of claim 3, wherein ceasing to destage storage tracks from each rank comprises ceasing to destage storage tracks from each rank that includes less than or equal to thirty percent (30%) of its respective allocated storage space.

### Claim 5 (depends on 3)

The method of claim 3, wherein ceasing to destage storage tracks from each rank comprises ceasing to destage storage tracks from each rank that includes less than or equal to a predetermined number of storage tracks.

### Claim 6 (depends on 2)

The method of claim 2, wherein destaging storage tracks from each rank comprises:
determining a current amount of storage tracks in the cache;
utilizing a formula to determine a current number of destage tasks to utilize to destage storage tracks from the cache, the current number of destage storage tasks based on the current amount of storage tracks in the cache; and
utilizing the current number of destage storage tasks to destage the plurality of storage tracks.

### Claim 7 (depends on 6)

The method of claim 6, wherein ceasing to destage storage tracks comprises reducing the current number of destage tasks to zero on each rank that includes less than or equal to the predetermined minimum amount of storage space.
