Fast Precise Interrupt Handling without Associative Searching in Multiple Out-Of-Order Issue Processors

Sang-Joon NAM  In-Cheol PARK  Chong-Min KYUNG  

IEICE TRANSACTIONS on Information and Systems   Vol.E82-D   No.3   pp.645-653
Publication Date: 1999/03/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Hardware and Design
computer architecture,  precise interrupt,  multiple out-of-order issue processors,  

Full Text: PDF>>
Buy this Article

This paper presents a new approach to the precise interrupt handling problem in modern processors with multiple out-of-order issues. It is difficult to implement a precise interrupt scheme in the processors because later instructions may change the process states before their preceding instructions have completed. We propose a fast precise interrupt handling scheme which can recover the precise state in one cycle if an interrupt occurs. In addition, the scheme removes all the associative searching operations which are inevitable in the previous approaches. To deal with the renaming of destination registers, we present a new bank-based register file which is indexed by bank index tables containing the bank identifiers of renamed register entries. Simulation results based on the superscalar MIPS architecture show that the register file with 3 banks is a good trade-off between high performance and low complexity.