Performance through memory

Two of the most important parameters of a computer are its processor speed and physical memory size. We study the relationship between these two parameters by experimentally evaluating the intrinsic memory and processor requirements of various applications. We also explore how hardware prices are changing the cost effectiveness of these two resources. Our results indicate that several important applications are “memory-bound,” i.e., can benefit more from increased memory than from a faster processor.

[1]  Allen Newell,et al.  Computer Structures: Principles and Examples , 1983 .

[2]  Richard J. Lipton,et al.  ALI: A Procedural Language to Describe VLSI Layouts , 1982, 19th Design Automation Conference.

[3]  Douglas W. Clark Measurements of Dynamic List Structure Use in Lisp , 1979, IEEE Transactions on Software Engineering.

[4]  Richard J. Lipton,et al.  A Massive Memory Machine , 1984, IEEE Transactions on Computers.

[5]  Peter J. Denning,et al.  Experiments with program locality , 1899, AFIPS '72 (Fall, part I).

[6]  Michael J. Flynn,et al.  Addressing patterns and memory handling algorithms , 1968, AFIPS '68 (Fall, part II).

[7]  Alan Jay Smith Cache Evaluation and the Impact of Workload Choice , 1985, ISCA.

[8]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[9]  Ulf Grenander,et al.  Patterns in Program References , 1975, IBM J. Res. Dev..

[10]  George W. Gorsline Computer Organization: Hardware/Software , 1980 .