Invoking input/output (I/O) threads and demote threads on processors to demote tracks from a cache

• US 9,971,689 B2
• Filed: 06/06/2016
• Issued: 05/15/2018
• Est. Priority Date: 06/06/2016
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ash, Kevin J., Borlick, Matthew G., Gupta, Lokesh M., Nguyen, Trung N.
• Primary Examiner(s): Gu, Shawn X
• Application Number:
  US15/174,692
• Publication Number:
  US 20170351611A1
• Time in Patent Office: 708 Days
• CPC Class Codes: G06F 12/0817 using directory methods
• CPC Class Codes: G06F 12/084 with a shared cache
• CPC Class Codes: G06F 12/0891 using clearing, invalidating or resetting means
• CPC Class Codes: G06F 12/12 Replacement control
• CPC Class Codes: G06F 12/123 with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
• CPC Class Codes: G06F 2212/1024 Latency reduction
• CPC Class Codes: G06F 2212/60 Details of cache memory
• CPC Class Codes: G06F 2212/621 Coherency control relating to peripheral accessing, e.g. from DMA or I/O device
• CPC Class Codes: G06F 2212/70 Details relating to dynamic memory management

Abstract

Provided are a computer program product, system, and method for invoking Input/Output (I/O) threads and demote threads on processors to demote tracks from a cache. An Input/Output (I/O) thread, executed by a processor, processes I/O requests directed to tracks from the storage stored in the cache. A demote thread, executed by the processor, processes a demote ready list, indicating tracks eligible to demote from cache, to select tracks to demote from the cache to free cache segments in the cache. After processing a number of I/O requests, the I/O thread processes the demote ready list to demote tracks from the cache in response to determining that a number of free cache segments in the cache is below a free cache segment threshold.

Claims

1. A computer program product for managing tracks in a storage in a cache, the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that when executed performs operations, the operations comprising:

processing, by an Input/Output (I/O) thread, executed by a processor, I/O requests directed to tracks from the storage stored in the cache;

processing, by a demote thread, executed by the processor, a demote ready list, indicating tracks eligible to demote from cache, to select tracks to demote from the cache to free cache segments in the cache; and

after processing a number of I/O requests, processing by the I/O thread, the demote ready list to demote tracks from the cache in response to determining that a number of free cache segments in the cache is below a free cache segment threshold.

2. The computer program product of claim 1, wherein there is a lock for the demote ready list to serialize access to the demote ready list, wherein the demote thread and the I/O thread must obtain the lock to separately process the demote ready list.

3. The computer program product of claim 2, wherein the processing by the I/O thread of the demote ready list comprises:

determining whether the lock is available, wherein the lock is unavailable if the demote thread is processing the demote ready list to demote tracks from the cache;

in response to determining that the lock is unavailable, determining whether to wait for the lock to become available based on the number of free cache segments in the cache;

waiting for the lock to become available to obtain the lock to process the demote ready list to demote tracks in response to determining to wait for the lock to become available; and

returning to processing, by the I/O thread, the number of I/O requests to tracks in the cache in response to determining not to wait for the lock.

4. The computer program product of claim 3, wherein the determining by the I/O thread whether to wait for the lock comprises:

determining to wait for the lock in response to determining that the number of free cache segments is below a wait threshold less than the free cache segment threshold; and

determining to not wait for the lock in response to determining that the number of free cache segments is greater than the wait threshold and less than the free cache segment threshold.

5. The computer program product of claim 2, wherein there are a plurality of processors, wherein for each of the processors there is an active cache list and a demote ready list, and wherein each of the processors execute at least one I/O thread to process I/O requests with respect to tracks in the cache and an instance of the demote thread to process the demote ready list associated with the processor, and wherein there is one lock for each of a plurality of demote ready lists associated with the processors.

6. The computer program product of claim 5, wherein each of the processors comprises a processor core including a plurality of central processing units (CPUs), wherein the CPUs on the processor core execute I/O threads and the demote thread to process the demote ready list and active cache list associated with the processor core.

7. The computer program product of claim 5, wherein the operations further comprise:

executing, by one of the processors, a demote scheduler task to determine whether a number of free cache segments in the cache is below the free cache segment threshold;

determining a number of demote threads to invoke based on whether the number of free cache segments is below the free cache segment threshold; and

invoking the determined number of demote threads on the processors to demote tracks in the cache indicated in the demote ready lists.

8. The computer program product of claim 7, wherein the free cache segment threshold comprises a first threshold, wherein the determining the number of demote threads to invoke based on the free cache segment threshold comprises:

determining to invoke one demote thread on all of the processors to process all of the demote ready lists in response to determining that the number of free cache segments in the cache is below the first threshold; and

determining to invoke a plurality of demote threads for a plurality of demote ready lists less than all of the demote ready lists in response to determining that the number of free cache segments is greater than the first threshold and less than a second threshold.

9. A system for managing tracks in a storage, comprising:

a plurality of processors; and

a memory including a cache for storing tracks in the storage,

wherein at least one of the processors performs;

executing an Input/Output (I/O) thread to process I/O requests directed to tracks from the storage stored in the cache;

executing a demote thread to process a demote ready list, indicating tracks eligible to demote from cache, to select tracks to demote from the cache to free cache segments in the cache; and

after processing a number of I/O requests, executing the I/O thread to process the demote ready list to demote tracks from the cache in response to determining that a number of free cache segments in the cache is below a free cache segment threshold.

10. The system of claim 9, wherein there is a lock for the demote ready list to serialize access to the demote ready list, wherein the demote thread and the I/O thread must obtain the lock to separately process the demote ready list.

11. The system of claim 10, wherein the processing by the I/O thread of the demote ready list comprises:

determining whether the lock is available, wherein the lock is unavailable if the demote thread is processing the demote ready list to demote tracks from the cache;

in response to determining that the lock is unavailable, determining whether to wait for the lock to become available based on the number of free cache segments in the cache;

waiting for the lock to become available to obtain the lock to process the demote ready list to demote tracks in response to determining to wait for the lock to become available; and

returning to processing, by the I/O thread, the number of I/O requests to tracks in the cache in response to determining not to wait for the lock.

12. The system of claim 11, wherein the determining by the I/O thread whether to wait for the lock comprises:

determining to wait for the lock in response to determining that the number of free cache segments is below a wait threshold less than the free cache segment threshold; and

determining to not wait for the lock in response to determining that the number of free cache segments is greater than the wait threshold and less than the free cache segment threshold.

13. The system of claim 10, wherein for each of the processors there is an active cache list and a demote ready list, and wherein each of the processors execute at least one I/O thread to process I/O requests with respect to tracks in the cache and an instance of the demote thread to process the demote ready list associated with the processor, and wherein there is one lock for each of a plurality of demote ready lists associated with the processors.

14. The system of claim 13, wherein each of the processors comprises a processor core including a plurality of central processing units (CPUs), wherein the CPUs on the processor core execute I/O threads and the demote thread to process the demote ready list and active cache list associated with the processor core.

15. The system of claim 13, wherein at least one of the processors further performs:

executing a demote scheduler task to determine whether a number of free cache segments in the cache is below the free cache segment threshold;

determining a number of demote threads to invoke based on whether the number of free cache segments is below the free cache segment threshold; and

invoking the determined number of demote threads on the processors to demote tracks in the cache indicated in the demote ready lists.

16. The system of claim 15, wherein the free cache segment threshold comprises a first threshold, wherein the determining the number of demote threads to invoke based on the free cache segment threshold comprises:

determining to invoke one demote thread on all of the processors to process all of the demote ready lists in response to determining that the number of free cache segments in the cache is below the first threshold; and

determining to invoke a plurality of demote thread for a plurality of demote ready lists less than all of the demote ready lists in response to determining that the number of free cache segments is greater than the first threshold and less than a second threshold.

17. A method for managing tracks in a storage in a cache, comprising:

processing, by an Input/Output (I/O) thread, executed by a processor, I/O requests directed to tracks from the storage stored in the cache;

processing, by a demote thread, executed by the processor, a demote ready list, indicating tracks eligible to demote from cache, to select tracks to demote from the cache to free cache segments in the cache; and

after processing a number of I/O requests, processing by the I/O thread, the demote ready list to demote tracks from the cache in response to determining that a number of free cache segments in the cache is below a free cache segment threshold.

18. The method of claim 17, wherein there is a lock for the demote ready list to serialize access to the demote ready list, wherein the demote thread and the I/O thread must obtain the lock to separately process the demote ready list.

19. The method of claim 18, wherein the processing by the I/O thread of the demote ready list comprises:

determining whether the lock is available, wherein the lock is unavailable if the demote thread is processing the demote ready list to demote tracks from the cache;

in response to determining that the lock is unavailable, determining whether to wait for the lock to become available based on the number of free cache segments in the cache;

waiting for the lock to become available to obtain the lock to process the demote ready list to demote tracks in response to determining to wait for the lock to become available; and

returning to processing, by the I/O thread, the number of I/O requests to tracks in the cache in response to determining not to wait for the lock.

20. The method of claim 19, wherein the determining by the I/O thread whether to wait for the lock comprises:

determining to wait for the lock in response to determining that the number of free cache segments is below a wait threshold less than the free cache segment threshold; and

determining to not wait for the lock in response to determining that the number of free cache segments is greater than the wait threshold and less than the free cache segment threshold.

21. The method of claim 18, wherein there are a plurality of processors, wherein for each of the processors there is an active cache list and a demote ready list, and wherein each of the processors execute at least one I/O thread to process I/O requests with respect to tracks in the cache and an instance of the demote thread to process the demote ready list associated with the processor, and wherein there is one lock for each of a plurality of demote ready lists associated with the processors.

22. The method of claim 21, further comprising:

executing, by one of the processors, a demote scheduler task to determine whether a number of free cache segments in the cache is below the free cache segment threshold;

determining a number of demote threads to invoke based on whether the number of free cache segments is below the free cache segment threshold; and

invoking the determined number of demote threads on the processors to demote tracks in the cache indicated in the demote ready lists.

23. The method of claim 22, wherein the free cache segment threshold comprises a first threshold, wherein the determining the number of demote threads to invoke based on the free cache segment threshold comprises:

determining to invoke one demote thread on all of the processors to process all of the demote ready lists in response to determining that the number of free cache segments in the cache is below the first threshold; and

determining to invoke a plurality of demote thread for a plurality of demote ready lists less than all of the demote ready lists in response to determining that the number of free cache segments is greater than the first threshold and less than a second threshold.