Addressing patterns and memory handling algorithms

Authors:
Sherry S. Sisson;Michael J. Flynn
Affiliations:
Northwestern University, Evanston, Illinois;Northwestern University, Evanston, Illinois
Venue:
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Year:
1968

Citing 3
Cited 4

Derivation of a Waiting-Time Factor for a Multiple-Bank Memory

Journal of the ACM (JACM)
Planning a computer system: Project Stretch

Planning a computer system: Project Stretch
Considerations in block-oriented systems design

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference

Shared Cache for Multiple-Stream Computer Systems

IEEE Transactions on Computers
A Massive Memory Machine

IEEE Transactions on Computers
On memory system design

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Virtual storage and virtual machine concepts

IBM Systems Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

One of the principal problems facing the designer of a high performance computer system is the efficient handling of memory. In arranging a memory system the designer, lacking knowledge of the programs to be run, usually selects "worst case" assumptions concerning addressing patterns. This paper is an attempt to compare a set of selected disparate programs and analyze their actual addressing traces with respect to the various memory algorithms.