ACM Home Page
Please provide us with feedback. Feedback
Exploring the Number of Register Windows in ASIP Synthesis
Full text Publisher SitePublisher Site PdfPdf (222 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2002 Asia and South Pacific Design Automation Conference table of contents
Page: 233  
Year of Publication: 2002
ISBN:0-7695-1441-3
Authors
Vishal P. Bhatt  Synposys India
M. Balakrishnan  Department of Computer Science & Engineering, Indian Institute of Tec hnology Delhi, New Delhi, India
Anshul Kumar  Department of Computer Science & Engineering, Indian Institute of Tec hnology Delhi, New Delhi, India
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

ASIPs (Application Specific Instruction Set Processors) are one of the key components of many embedded systems which are typically application specific. An ASIP can be defined by a set of architectural features, number of register windows being one of them. The work described here focuses on generating the transfer time penalties for some of the mediabench benchmark applications namely JPEG and MPEG encoder and decoder, for different number of register windows. The problem has been solved in two steps. First the "spills" for different number of windows were counted where a spill refers to the situation where a context switch cannot be accommodated in the register windows thereby adding the overhead of transferring some data to the memory. This part of the problem was solved by mapping it to the "regular language recognition problem". In the next step, actual time penalties for different system configurations, were computed. Here, a system configuration consists of the memory configuration, bus width and speed and processor cycle time. Thus, this work may also drive the design space exploration process. Results and expected performance gains by selecting different number of register windows is presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] Binh N. N., Takeuchi Y., Imai M. A performance maximisation algorithm to design asips under the constraint of chip area including ram and rom sizes. In Proceedingsof the Asia and South Pacific Design Automation Conference 1998 (ASPD A C'98), pages 367-372, February 1998.
 
2
3
 
4
 
5
[5] Preeti Ranjan Panda, Nikil Dutt, and Alexandru Nicolau. Memory Issues in Embedded Systems-On-Chip, Optimisations and Exploration. 1999.
 
6
7
 
8
[8] Vishal P. Bhatt. Register Window Analysis in ASIPs. M. Tech. Thesis, Dept. of Computer Science & Engg., Indian Institute of Technology Delhi, April 2001.

Collaborative Colleagues:
Vishal P. Bhatt: colleagues
M. Balakrishnan: colleagues
Anshul Kumar: colleagues

Peer to Peer - Readers of this Article have also read: