Browse Prior Art Database

Spatial-Temporal Cache Pairs

IP.com Disclosure Number: IPCOM000120727D
Original Publication Date: 1991-Jun-01
Included in the Prior Art Database: 2005-Apr-02
Document File: 1 page(s) / 33K

Publishing Venue

IBM

Related People

Roberson, K: AUTHOR [+2]

Abstract

Provided is a cache system organization where ordered cache pairs are provided to overcome deficiencies with use of conventional techniques.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 100% of the total text.

Spatial-Temporal Cache Pairs

      Provided is a cache system organization where ordered
cache pairs are provided to overcome deficiencies with use of
conventional techniques.

      When applied to program execution, the principle of spatial
locality dictates that a cache keep blocks of instructions and data
close to what is currently being used. Similarly, the principle of
temporal locality dictates that a cache keep blocks of instructions
or data that have been used recently.  When combined, the principles
of temporal and spatial locality lead designers to keep in the cache
program instructions and data that are close to the current execution
point and that have been recently used.  The solution is to provide
an ordered pair of caches, where one cache is based on Temporal
Algorithms and another cache is based on Spatial Algorithms.  The
Spatial Cache keeps blocks close to the current execution point.  The
Temporal Cache keeps blocks that have been used recently but are not
close to the current execution point.  In addition, the Temporal
Cache receives blocks from the Spatial Cache via "block shift"
operations.  The concept can be extended to use multiple cache pairs
of this type.

      The benefits of this type of cache system is improved internal
performance and improved end-user response times.