@inproceedings{e6c08a8748444188a9c8b3e18aa4f74c,
title = "Complexity-Effective Rename Table Design for Rapid Speculation Recovery",
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.",
author = "G{\"o}rkem Asilioglu and Kaya, {Emine Merve} and Oguz Ergin",
year = "2010",
doi = "10.1007/978-3-642-11950-7_3",
language = "English",
isbn = "978-3-642-11949-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "15--24",
booktitle = "Architecture of Computing Systems - ARCS 2010",
address = "United Kingdom",
}