A study of storage partitioning using a mathematical model of locality
Communications of the ACM
The working set model for program behavior
Communications of the ACM
A Mathematical Theory of Communication
A Mathematical Theory of Communication
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Instruction entropy, a possible measure of program/architecture compatibility
ACM SIGMETRICS Performance Evaluation Review
Execution Architecture: The DELtran Experiment
IEEE Transactions on Computers
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
| Hi-index | 0.00 |
Squeezing more information into memory is a familiar problem to everyone who has written a program which was too large to fit into memory. Program compaction is also important to those who work on machines with virtual memory (such as the B5500); despite the almost unlimited amount of storage, one wants to keep program working-sets (collections of segments needed in core at the same time) as small as possible to reduce both the number and duration of segment swaps. In general, one seeks to raise the information content (or reduce the redundancy) of the blocks of information which one is using. In this discussion, "information content" will suffice as an intuitive notion.