Skip to main content
Article thumbnail
Location of Repository

Stanford University Concurrent VLSI Architecture Group Memo 127 Guaranteeing Forward Progress of Unified Register Allocation and Instruction Scheduling

By Jongsoo Park and William J. Dally


Increasingly demanding computation requirements and tighter energy constraints have motivated distributed and/or hierarchical register file (dhrf) organizations as a mean to efficiently sustain a sufficient alu utilization in processors targeting embedded applications with many alus. Compared to conventional centralized register file organizations, dhrfs lead to tighter coupling between register allocation and instruction scheduling: since latencies to register files are non-uniform, register allocation affects access latencies, thus in turn affects instruction scheduling. To avoid this phase order-1 ing problem, researchers have proposed performing instruction scheduling and register allocation simultaneously. While these unified register allocation and instruction scheduling algorithms address the phase ordering problem, they can be susceptible to scheduling deadlocks: the scheduling algorithm cannot make any forward progress due to its previous decisions. Previous unified algorithms either ignore the scheduling deadlock issue or rely on architectural assumptions with respect to connectivity between register files and functiona

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.