ACM Home Page
Please provide us with feedback. Feedback
Efficiently scheduling runtime reconfigurations
Full text PdfPdf (374 KB)
Source
ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 13 ,  Issue 4  (September 2008) table of contents
Article No. 58  
Year of Publication: 2008
ISSN:1084-4309
Authors
Javier Resano  Universidad Complutense de Madrid, Spain
Juan Antonio Clemente  Universidad Complutense de Madrid, Spain
Carlos Gonzalez  Universidad Complutense de Madrid, Spain
Daniel Mozos  Universidad Complutense de Madrid, Spain
Francky Catthoor  IMEC vzw and Katholieke Universiteit Leuven, Heverlee, Belgium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 158,   Citation Count: 0
Additional Information:

abstract   references   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/1391962.1391966
What is a DOI?

ABSTRACT

Due to the emergence of portable devices that must run complex dynamic applications there is a need for flexible platforms for embedded systems. Runtime reconfigurable hardware can provide this flexibility but the reconfiguration latency can significantly decrease the performance. When dealing with task graphs, runtime support that schedules the reconfigurations in advance can drastically reduce this overhead. However, executing complex scheduling heuristics at runtime may generate an excessive penalty. Hence, we have developed a hybrid design-time/runtime reconfiguration scheduling heuristic that generates its final schedule at runtime but carries out most computations at design-time. We have tested our approach in a PowerPC 405 processor embedded on a FPGA demonstrating that it generates a very small runtime penalty while providing almost as good schedules as a full runtime 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
Belady, L. A. 1966. A study of replacement algorithms for virtual storage computers. IBM Syst. J., 5, 78--101.
 
2
EDK. 2007. Embedded System Tools Manual. http://www.xilinx.com/ise/embedded/edk91i_docs/est_rm.pdf.
 
3
ISE. 2007. http://www.xilinx.com/publications/prod_mktg/pn0010867.pdf.
4
 
5
Lysaght, P., Blodget, B., Mason, J., Young, J., and Bridgford B. 2006. Enhanced architectures, design methodologies and CAD tools for dynamic reconfiguration of Xilinx FPGAs. In Proceedings of the 2006 International Conference on Field Programmable Logic and Applications. Madrid, Spain, 1--6.
 
6
7
8
 
9
 
10
Pocket G. L. 2007. http:/www.sundialsoft.freeserve.co.uk/pgl.htm.
 
11
 
12
Resano, J., Mozos D., Verkest, D. Vernalde, S., and Catthoor, F. 2004. A hybrid design-time/run-time scheduling flow to minimize the reconfiguration overhead of FPGAs. J. Microproc. Microarchi. 28, 5--6, 291--301.
 
13
 
14
 
15
 
16
Walder, H. and Platzner, M. 2004. A runtime environment for reconfigurable operating systems. In Proceedings of the 14th International Conference on Field-Programmable Logic and Applications, Leuven, Belgium, 831--835.
17
 
18
Xilinx. 2007. http://www.xilinx.com/univ/xupv2p.html.
 
19
Yang, P. and Catthoor, F. 2004. Dynamic mapping and ordering tasks of embedded real-time systems on multiprocessor platforms. In Proceedings of Software and Compilers for Embedded Systems 8th International Workshop. 167--181.

Collaborative Colleagues:
Javier Resano: colleagues
Juan Antonio Clemente: colleagues
Carlos Gonzalez: colleagues
Daniel Mozos: colleagues
Francky Catthoor: colleagues