About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Cost-Performance Evaluation of Memory Hierarchies
Abstract
The stack processing method is used to com- pare the cost-performance (/access) as the two-level hierarchy unless the access time ratio exceeds about fifty. Also, random access devices are advantageous over serial access devices for backing store applications only when the memory capacity is less than 1 Mbyte. For capacities of 4 Mbyte and 16 Mbyte serial access stores with shift register lengths of 256 bit and 1024 bit, respectively, look favorable. Copyright © 1973 by The Institute of Electrical and Electronics Engineers, Inc.