1978•ComputerRequires access

Sequential Program Prefetching in Memory Hierarchies

Alan Jay Smith

Open publisher page 323 citations

Abstract

Memory transfers due to a cache miss are costly. Prefetching all memory references in very fast computers can increase the effective CPU speed by 10 to 25 percent.

About this research paper

What this paper is about

Memory transfers due to a cache miss are costly. Prefetching all memory references in very fast computers can increase the effective CPU speed by 10 to 25 percent.

Why it matters

OpenAlex reports 323 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Memory transfers due to a cache miss are costly. Prefetching all memory references in very fast computers can increase the effective CPU speed by 10 to 25 percent.

Key concepts: Computer science, Parallel computing, Cache, Cache-only memory architecture, CPU cache, Memory management, Interleaved memory, Cache pollution

Related papers

Back to paper searchBrowse research topicsOriginal source
Sequential Program Prefetching in Memory Hierarchies — Research Paper | ScholarLens