ACM Home Page
Please provide us with feedback. Feedback
Hardware-software bipartitioning for dynamically reconfigurable systems
Full text PdfPdf (609 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the tenth international symposium on Hardware/software codesign table of contents
Estes Park, Colorado
SESSION: System partitioning and timing analysis table of contents
Pages: 145 - 150  
Year of Publication: 2002
ISBN:1-58113-542-4
Authors
Daler N. Rakhmatov  University of Arizona, Tucson, AZ
Sarma B. K. Vrudhula  University of Arizona, Tucson, AZ
Sponsors
IEEE-CS\DATC : IEEE Computer Society
IFIP WG 10.5 : IFIP WG 10.5
SIGSOFT: ACM Special Interest Group on Software Engineering
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 25,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

The main unique feature of dynamically reconfigurable systems is the ability to time-share the same reconfigurable hardware resources. However, the energy-delay cost associated with reconfiguration must be accounted for during hardware-software partitioning. We propose a method for mapping nodes of an application control flow graph either to software or reconfigurable hardware, explicitly targeting minimization of the energy-delay cost due to both computation and configuration. The addressed problems are energy-delay product minimization, delay-constrained energy minimization, and energy-constrained delay minimization. We show how these problems can be tackled by using network flow techniques, after transforming the original control flow graph into an equivalent network. If there are no constraints, as in the case of the energy-delay product minimization, we are able to generate an optimal solution in polynomial time.


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
C. Cheng and T. Hu, "Maximum concurrent flows and minimum cuts," Algorithmica, vol. 8, 1992.
 
2
 
3
S. Hauck and G. Borriello, "An evaluation of bipartitioning techniques," IEEE Trans. CAD, vol. 18, 1997.
4
5
6
 
8
 
9
 
10
 
11
 
12
13
 
14
DJPEG Call Graph, http://www.aisee.com/split/index.htm, 2002.

CITED BY  7

Collaborative Colleagues:
Daler N. Rakhmatov: colleagues
Sarma B. K. Vrudhula: colleagues