Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Range-Driven Prefetching of Cache Lines

IP.com Disclosure Number: IPCOM000041688D
Original Publication Date: 1984-Mar-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
Hoevel, LW Voldman, J [+details]

Abstract

It has been established that misses in a cache memory are clustered in so-called bursts. These bursts are the results of transitions between operating system modules (changes of locality). It has also been found that most of the bursts are made up of a small range of consecutive lines (unit of paging in the cache). The number of misses in the cache and the finite cache penalty are reduced by the following algorithm: at the first miss in the range, prefetch the remaining lines in the range. It is proposed that the table be initialized by a software module, triggered by an operator command.