CAVA: Hiding L2 Misses with Checkpoint-Assisted Value Prediction

Ceze, Luis H.; Strauss, Karin; Tuck, James M.; Renau, Jose; Torrellas, Josep

Permalink

https://hdl.handle.net/2142/11037 Copy

Description

Title

CAVA: Hiding L2 Misses with Checkpoint-Assisted Value Prediction

Author(s)

• Ceze, Luis H.
• Strauss, Karin
• Tuck, James M.
• Renau, Jose
• Torrellas, Josep

Issue Date

2004-06

Keyword(s)

Computer architecture

Abstract

Modern superscalar processors often suffer long stalls due to load misses in on-chip L2 caches. To address this problem, we propose hiding L2 misses with Checkpoint-Assisted VAlue prediction (CAVA). On an L2 cache miss, a predicted value is returned to the processor. When the missing load finally reaches the head of the ROB, the processor checkpoints its state, retires the load, and speculatively continues executing using the predicted value. When the value in memory arrives at the L2 cache, it is compared to the predicted value. If the prediction was correct, speculation has succeeded and execution continues; otherwise, execution is rolled back and restarted from the checkpoint. CAVA uses fast checkpointing, speculative buffering, and a modest-sized value prediction structure that has over 50\% accuracy. Compared to an aggressive superscalar processor, CAVA speeds up execution by up to 1.45 for SPECint applications and 1.58 for SPECfp applications, with a geometric mean of 1.14 for SPECint and 1.34 for SPECfp applications. We also evaluate an implementation of Runahead execution --- a previously-proposed scheme that does not perform value prediction and discards all work done between checkpoint and data reception from memory. Runahead execution speeds up execution by a geometric mean of 1.07 for SPECint and 1.18 for SPECfp applications, compared to the same baseline. We also evaluate Runahead with value prediction.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11037

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections