Performance Evaluation of a Decoded Instruction Cache for Variable Instruction Length Computers

Authors:
G. D. Intrater;I. Y. Spillinger
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 12
Cited 1

How not to lie with statistics: the correct way to summarize benchmark results

Communications of the ACM - The MIT Press scientific computation series
Reducing the cost of branches

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Line (block) size choice for CPU cache memories

IEEE Transactions on Computers
Branch folding in the CRISP microprocessor: reducing branch delay to zero

ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Series 32000 programmer's reference manual

Series 32000 programmer's reference manual
Reducing the Branch Penalty in Pipelined Processors

Computer
A Case for Direct-Mapped Caches

Computer
Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
Performance comparison of load/store and symmetric instruction set architectures

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Cache Memories

ACM Computing Surveys (CSUR)
Performance Trade-Offs for Microprocessor Cache Memories

IEEE Micro
The 68040 Processor. I. Design and Implementation

IEEE Micro

Variable-sized object packing and its applications to instruction cache design

Computers and Electrical Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

A Decoded INstruction Cache (DINC) is a buffer between the instruction decoder and other instruction pipeline stages. In this paper, we explain how techniques that reduce the branch penalty on a DINC, can improve CPU performance. We also analyze the impact of some of the design parameters of DINC's on variable instruction length computers. Our study indicates that tuning the mapping of the instructions into the cache can improve performance substantially. Tuning must be based on the instruction length distribution for a specific architecture. In addition, the associativity degree has a greater effect on the DINC's performance than on the performance of regular caches. We discuss the difference between the performance of DINC's and other caches, when longer cache lines are used. We present a model to estimate the miss rate based on its characteristics, that are discussed and analyzed throughout this paper. Our conclusions are based on both analytical study and trace driven simulations of several integer UNIX applications.