loading...
Address-Value Decoupling for Early Register Deallocation
Columbus, Ohio August 14-August 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2006.202006 International Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deniz Balkan, State University of New York at Binghamton, USA
Joseph Sharkey, State University of New York at Binghamton, USA
Dmitry Ponomarev, State University of New York at Binghamton, USA
Aneesh Aggarwal, State University of New York at Binghamton, USA
We propose a series of aggressive register deallocation mechanisms to reduce the register file pressure and increase the parallelism exploited by superscalar microprocessors. Our techniques are based on a key observation that a register value can be temporarily decoupled from the register identifier. Specifically, even if a physical register is deallocated, the value is still available in the register and can be read by the dependent instructions until the register is overwritten. In these situations, we can effectively overlap the consumption of the produced register value and partial processing of the instruction that gets the same register reassigned to it. In this paper, we propose several realizations of the address-value decoupling idea and discuss their implications on the performance. Our most aggressive scheme achieves an average IPC speedup of 14.6% across simulated SPEC 2000 benchmarks.
Citation:
Deniz Balkan, Joseph Sharkey, Dmitry Ponomarev, Aneesh Aggarwal, "Address-Value Decoupling for Early Register Deallocation," icpp, pp.337-346, 2006 International Conference on Parallel Processing (ICPP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.