scispace - formally typeset
Journal ArticleDOI

An analytical access time model for on-chip cache memories

T. Wada, +2 more
- 01 Aug 1992 - 
- Vol. 27, Iss: 8, pp 1147-1156
Reads0
Chats0
TLDR
An analytical access time model for on-chip cache memories that shows the dependence of the cache access time on the cache parameters is described and it is shown that for given C, B, and A, optimum array configuration parameters can be used to minimize the access time.
Abstract
An analytical access time model for on-chip cache memories that shows the dependence of the cache access time on the cache parameters is described. The model includes general cache parameters, such as cache size (C), block size (B), and associativity (A), and array configuration parameters that are responsible for determining the subarray aspect ratio and the number of subarrays. With this model, a large cache design space can be covered, which cannot be done using only SPICE circuit simulation within a limited time. Using the model, it is shown that for given C, B, and A, optimum array configuration parameters can be used to minimize the access time; if the optimum array parameters are used, then the optimum access time is roughly proportional to the log (cache size), and when the optimum array parameters are used, larger block size gives smaller access time, but larger associativity does not give smaller access time because of the increase of the data-bus capacitances. >

read more

Citations
More filters
Proceedings ArticleDOI

Complexity-effective superscalar processors

TL;DR: A microarchitecture that simplifies wakeup and selection logic is proposed and discussed, which will help minimize performance degradation due to slow bypasses in future wide-issue machines.
Journal ArticleDOI

CACTI: an enhanced cache access and cycle time model

TL;DR: In this paper, an analytical model for the access and cycle times of on-chip direct-mapped and set-associative caches is presented, where the inputs to the model are the cache size, block size, and associativity, as well as array organization and process parameters.
Proceedings ArticleDOI

Selective cache ways: on-demand cache resource allocation

TL;DR: In this paper, a tradeoff between performance and energy is made between a small performance degradation for energy savings, and the tradeoff can produce a significant reduction in cache energy dissipation.
Proceedings ArticleDOI

Cache design trade-offs for power and performance optimization: a case study

TL;DR: This paper examines performance and power trade-offs in cache designs and the effectiveness of energy reduction for several novel cache design techniques targeted for low power.
Journal ArticleDOI

Trace-driven memory simulation: a survey

TL;DR: A survey and analysis of trace-driven memory simulation tools can be found in this article, where the authors discuss the strengths and weaknesses of different approaches and show that no single method is best when all criteria, including accuracy, speed, memory, flexibility, portability, expense, and ease of use are considered.
References
More filters
Journal ArticleDOI

A case for direct-mapped caches

TL;DR: Direct-mapped caches are defined, and it is shown that trends toward larger cache sizes and faster hit times favor their use.
Journal ArticleDOI

Delay analysis of series-connected MOSFET circuits

TL;DR: In this paper, the authors derived analytical delay expressions for CMOS gates in the sub-micrometer region, and derived closed-form delay formulas for both inverters and series-connected MOSFET structures.
Journal ArticleDOI

An optimized output stage for MOS integrated circuits

TL;DR: An optimum exists which can be considered the best compromise between further decreasing propagation delay and increasing chip area which allows a designer to determine the minimum chip area once the capacitive load and the maximum allowable delay are known.
Journal ArticleDOI

A 14-ns 1-Mbit CMOS SRAM with variable bit organization

TL;DR: The authors describe a 14-ns 1-Mb CMOS SRAM (static random-access memory) with both 1M word*1-b and 256 K word*4-b organizations that has a fast access time and a variable bit-organization function that reduces the testing time while keeping the measurement accuracy of the access times.
Book

Mips-X RISC Microprocessor

Paul Chow
TL;DR: The MIPS-X Revision 1 and 2 Pin Numbers and Revision 2 Differences are presented in this article, as well as the MIPSX Revision 3 and 4 Pin Numbers for 144 Pin PGA.