Sequential Program Prefetching in Memory Hierarchies

1 December 1978

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer

Vol. 11 (12) , 7-21
https://doi.org/10.1109/c-m.1978.218016

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.

Keywords

This publication has 12 references indexed in Scilit:

A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory
IEEE Transactions on Software Engineering, 1978
On the effectiveness of buffered and multiple arm disks
Published by Association for Computing Machinery (ACM) ,1978
On the Paging Performance of Array Algorithms
IEEE Transactions on Computers, 1977
An instruction timing model of CPU performance
ACM SIGARCH Computer Architecture News, 1977
Prepaging and Applications to Array Algorithms
IEEE Transactions on Computers, 1976
A dynamic clustering strategy in a demand paging environment
ACM SIGSIM Simulation Digest, 1976
Dynamic Improvement of Locality in Virtual Memory Systems
IEEE Transactions on Software Engineering, 1976
A model for masking rotational latency by dynamic disk allocation
Communications of the ACM, 1974
An analysis of paging and program behaviour
The Computer Journal, 1970
The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling
IBM Journal of Research and Development, 1967