ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Energy-aware variable partitioning and instruction scheduling for multibank memory architectures
Full text PdfPdf (327 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 10 ,  Issue 2  (April 2005) table of contents
Pages: 369 - 388  
Year of Publication: 2005
ISSN:1084-4309
Authors
Zhong Wang  University of Notre Dame, Notre Dame, IN
Xiaobo Sharon Hu  University of Notre Dame, Notre Dame, IN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 37,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1059876.1059885
What is a DOI?

ABSTRACT

Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures presents a great challenge to compiler design. In this article, we present an approach for variable partitioning and instruction scheduling to maximally exploit the benefits provided by such architectures. Our approach is built on a novel graph model which strives to capture both performance and power demands. We propose an algorithm to iteratively find the variable partition such that the maximum energy saving is achieved while satisfying the given performance constraint. Experimental results demonstrate the effectiveness of our approach.


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
2
 
3
4
 
5
6
 
7
Desoli, G. 1998. Instruction assignment for clustered VLIW DSP compilers: A new approach. Tech. Rep. HPL-98-13. Hewlett-Packard Company, Palo alto, CA.
 
8
Goldschmidt, O. and Hochbaum, D. S. 1998. Polynomial algorithm for the k-cut problem. In Proceedings of the 29th Annual Symposium on the Foundations of Computer Science. 444--451.
9
 
10
Leupers, R. and Kotte, D. 2001. Variable partitioning for dual memory bank DSPS. In Proceedings of ICASSP.
11
12
13
 
14
Micron. 1999. 1mb syncburst SRAM data sheet. Micron Technology Inc., Boise, ID. Website: www.micron.com.
 
15
Prim, R. 1957. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 6.
 
16
Rambus. 1999. 128/144-mbit direct RDRAM data sheet. Rambus Inc., Losaltos, CA. Website: www.rambus.com.
17
18
 
19
Wang, Z. and Hu, X. S. 2004. Variable partitioning and scheduling for multiple memory banks. Tech. rep. CSE Dept., University of Notre Dame, Notre Dame, IN.
 
20
 
21
Zeithofer, T. and Wess, B. 2001. Integrated scheduling and register assignment for VLIW--DSP architectures. In Proceedings of the 14th Annual IEEE International ASIC/SOC Conference. 339--343.
 
22
Zhuge, Q., Xiao, B., and Sha, E. H.-M. 2001. Exploring variable partitioning in dual data-memory bank processors. In Proceedings of the 34th International Symposium on Micro-Architecture (MICRO-34), the 3rd Workshop on Media and Streaming Processors (MSP-3 Workshop). 42--55.
 
23
Zivoljnovic, V., Velarde, J., Schager, C., and Meyr, H. 1994. Dspstone---a DSP oriented benchmarking methodology. In Proceedings of the International Conference on Signal Processing Applications and Technology.


Collaborative Colleagues:
Zhong Wang: colleagues
Xiaobo Sharon Hu: colleagues