Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/6417
Title: Complexity-Effective Rename Table Design for Rapid Speculation Recovery
Authors: Asilioğlu, Goerkem
Kaya, Emine Merve
Ergin, Oğuz
Keywords: Register renaming
branch prediction
rename table
speculation recovery
Issue Date: 2010
Publisher: Springer-Verlag Berlin
Source: 23rd International Conference on Architecture of Computing Systems (ARCS 2010) -- FEB 22-25, 2010 -- Leibniz Univ Hannover, Hannover, GERMANY
Series/Report no.: Lecture Notes in Computer Science
Abstract: Register renaming is a widely used technique to remove false data dependencies in contemporary superscalar microprocessors. The register rename logic includes a mapping table that holds the physical register identifiers assigned to each architectural register. This mapping table needs to be recovered to its correct state when a branch prediction occurs. In this paper we propose a scalable rename table design that allows fast recovery on branch predictions. A FIFO scheme is applied with a distributed rename table structure that holds a variable number of checkpoints specific to each architectural register. Our results show that although the area of the rename table is increased, it is possible to recover from a branch misprediction in at worst 2 cycles.
URI: https://hdl.handle.net/20.500.11851/6417
ISBN: 978-3-642-11949-1
ISSN: 0302-9743
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

16
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.