{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 23 - Scalable Complexity-Effective Design (2010-04-06)

Lecture 23 - Scalable Complexity-Effective Design (2010-04-06)

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Scalable, Complexity Effective Design School of Electrical Engineering and Computer Science University of Central Florida Checkpoint processing and recovery H. Akkary, R.. Rajwar and S. Srinivasan, MICRO 36, 2003 Motivation Memory wall problem Scalable instruction window Constrains for scalable instruction window ROB, RF, Shadow maps, Issue queue, LSQ In-order retirement at a coarse grain Ch k i t ti i d University of Central Florida 2 Checkpoints retire in-order Register–flow Instructions retire out-of-order between checkpoints Memory-flow instructions (stores) are buffered and retired in order at the time checkpoints retire Skipping intermediate results
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon