DocumentCode
864412
Title
Checkpoint processing and recovery: an efficient, scalable alternative to reorder buffers
Author
Akkary, Haitham ; Rajwar, Ravi ; Srinivasan, Srikanth T.
Author_Institution
Portland State Univ., OR, USA
Volume
23
Issue
6
fYear
2003
Firstpage
11
Lastpage
19
Abstract
Processors require a combination of large instruction windows and high clock frequency to achieve high performance. Traditional processors use reorder buffers, but these structures do not scale efficiently as window size increases. A new technique, checkpoint processing and recovery, offers an efficient means of increasing the instruction window size without requiring large, cycle-critical structures, and provides a promising microarchitecture for future high-performance processors.
Keywords
buffer storage; computer architecture; fault tolerant computing; system recovery; checkpoint processing; checkpoint recovery; high clock frequency; high-performance processors; instruction window size; large instruction windows; microarchitecture; reorder buffers; scalable alternative; Decoding; Delay; Hazards; Microarchitecture; Out of order; Pipelines; Registers; Retirement; Scalability; Tail;
fLanguage
English
Journal_Title
Micro, IEEE
Publisher
ieee
ISSN
0272-1732
Type
jour
DOI
10.1109/MM.2003.1261382
Filename
1261382
Link To Document