An efficient technique for exploring register file size in ASIP synthesis

  • Authors:
  • Manoj Kumar Jain;M. Balakrishnan;Anshul Kumar

  • Affiliations:
  • Indian Institute of Technology Delhi, India;Indian Institute of Technology Delhi, India;Indian Institute of Technology Delhi, India

  • Venue:
  • CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Performance estimation is a crucial operation which drives the design space exploration in Application Specific Instruction Set Processors (ASIP) synthesis. The usual approach to estimate performance is to do simulation. With increasing dimensions of the design space, simulator based approaches become too time consuming. This problem can be solved by scheduler based approaches, which are much faster. However existing scheduler based approaches do not help in exploring storage organization. This paper presents a scheduler based technique for exploring register file size in ASIP synthesis.The performance is estimated by estimating the number of spills for a particular register file size. The concept of register reuse chains is used for local register allocation. Live variable analysis is done across all the blocks to estimate global register needs. The technique is fast, accurate and retargetable and does not require code generation.Performance estimates for register file sizes between 1 to 8 for ARM (ARM7TDMI) and 1 to 128 for Trimedia (TM-1000) were generated for selected benchmarks to validate the proposed technique. Results show that our estimates are within 9.6% for ARM7T- DMI and 3.3% for TM-1000 compared to the actual performance produced by standard tool sets. Further, this technique is nearly 77 times faster compared to the simulator based technique encc.