Increased cache performance with multi-level queues of complete tracks

US9665493B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9665493-B2
Application numberUS-201414505702-A
CountryUS
Kind codeB2
Filing dateOct 3, 2014
Priority dateOct 3, 2014
Publication dateMay 30, 2017
Grant dateMay 30, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Exemplary method, system, and computer program product embodiments for increased cache performance using multi-level queues by a processor device. The method includes distributing to each one of a plurality of central processing units (CPUs) workload operations for creating complete tracks from partial tracks, creating sub-queues of the complete tracks for distributing to each one of the CPUs, and creating demote scan tasks based on workload of the CPUs. Additional system and computer program product embodiments are disclosed and provide related advantages.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method for increased cache performance efficiency by a processor device in a computing environment, the method comprising: distributing to each one of a plurality of central processing units (CPUs) workload operations for creating complete cache tracks from partial cache tracks by creating a complete cache track queue and a partial cache track pointer without a lock by each one of the CPUs; using, by each one of the CPUs, an assembler queue to accumulate each of the complete cache tracks from the partial cache tracks including using a pointer copy of a partial cache track to assemble a complete cache track, the assembler queue sending each of the complete cache tracks to the complete cache track queue; creating sub-queues in front of each of the assembler queues accumulating the complete cache tracks, the sub-queues including both an append queue and a build queue, wherein the build queue fills the append queue using segments from the partial cache track pointer copy combined with a partial cache track and the append queue fills the assembler queue; and creating and throttling a plurality of demote scan tasks to continuously maintain pace with the filling of the complete cache track queue, the assembler queue, and the sub-queues. 2. The method of claim 1 , further including using a reclaim task to fill the build queue. 3. The method of claim 1 , further including maintaining the plurality of demote scan tasks by adding or removing task control blocks (TCB) according to a number of allocation requests. 4. A system for increased creased cache performance efficiency in a computing environment, the system comprising: at least one processor device operable in the computing storage environment, wherein the at least one processor device: distributes to each one of a plurality of central processing units (CPUs) workload operations for creating complete cache tracks from partial cache tracks by creating a complete cache track queue and a partial cache track pointer without a lock by each one of the CPUs, uses, by each one of the CPUs, an assembler queue to accumulate each of the complete cache tracks from the partial cache tracks including using a pointer copy of a partial cache track to assemble a complete cache track, the assembler queue sending each of the complete cache tracks to the complete cache track queue, creates sub-queues in front of each of the assembler queues accumulating the complete cache tracks, the sub-queues including both an append queue and a build queue, wherein the build queue fills the append queue using segments from the partial cache track pointer copy combined with a partial cache track and the append queue fills the assembler queue, and creates and throttles a plurality of demote scan tasks to continuously maintain pace with the filling of the complete cache track queue, the assembler queue, and the sub-queues. 5. The system of claim 4 , wherein the at least one processor device uses a reclaim task to fill the build queue. 6. The system of claim 4 , wherein the at least one processor device maintains the plurality of demote scan tasks by adding or removing task control blocks (TCB) according to a number of allocation requests. 7. A computer program product for increased cache performance efficiency in a computing environment by a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: a first executable portion that distributes to each one of a plurality of central processing units (CPUs) workload operations for creating complete cache tracks from partial cache tracks by creating a complete cache track queue and a partial cache track pointer without a lock by each one of the CPUs; a second executable portion that uses, by each one of the CPUs, an assembler queue to accumulate each of the complete cache tracks from the partial cache tracks including using a pointer copy of a partial cache track to assemble a complete cache track, the assembler queue sending each of the complete cache tracks to the complete cache track queue; a third executable portion that creates sub-queues in front of each of the assembler queues accumulating the complete cache tracks, the sub-queues including both an append queue and a build queue, wherein the build queue fills the append queue using segments from the partial cache track pointer copy combined with a partial cache track and the append queue fills the assembler queue; and a fourth executable portion that creates and throttles a plurality of demote scan tasks to continuously maintain pace with the filling of the complete cache track queue, the assembler queue, and the sub-queues. 8. The computer program product of claim 7 , further including a sixth executable portion that uses a reclaim task to fill the build queue. 9. The computer program product of claim 7 , further including a fifth executable portion that maintains the plurality of demote scan tasks by adding or removing task control blocks (TCB) according to a number of allocation requests.

Assignees

Inventors

Classifications

  • Caching of specific data in cache memory · CPC title

  • with dedicated cache, e.g. instruction or stack · CPC title

  • Program synchronisation; Mutual exclusion, e.g. by means of semaphores · CPC title

  • Digital input from, or digital output to, record carriers {, e.g. RAID, emulated record carriers or networked record carriers} · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9665493B2 cover?
Exemplary method, system, and computer program product embodiments for increased cache performance using multi-level queues by a processor device. The method includes distributing to each one of a plurality of central processing units (CPUs) workload operations for creating complete tracks from partial tracks, creating sub-queues of the complete tracks for distributing to each one of the CPUs, …
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F12/0875. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 30 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).