loading...
Template Generation and Selection Algorithms
Calgary, Alberta, Canada June 30-July 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IWSOC.2003.1212995The 3rd IEEE International Workshop o ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Yuanqing Guo, Gerard J.M. Smit, Hajo Broersma, Paul M. Heysters, "Template Generation and Selection Algorithms," System-on-Chip for Real-Time Applications, International Workshop on, pp. 2, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IWSOC.2003.1212995,
author = {Yuanqing Guo and Gerard J.M. Smit and Hajo Broersma and Paul M. Heysters},
title = {Template Generation and Selection Algorithms},
journal ={System-on-Chip for Real-Time Applications, International Workshop on},
volume = {0},
year = {2003},
isbn = {0-7695-1944-X},
pages = {2},
doi = {http://doi.ieeecomputersociety.org/10.1109/IWSOC.2003.1212995},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - System-on-Chip for Real-Time Applications, International Workshop on
TI - Template Generation and Selection Algorithms
SN - 0-7695-1944-X
SP
EP
A1 - Yuanqing Guo,
A1 - Gerard J.M. Smit,
A1 - Hajo Broersma,
A1 - Paul M. Heysters,
PY - 2003
KW - null
VL - 0
JA - System-on-Chip for Real-Time Applications, International Workshop on
ER -
 
Yuanqing Guo, University of Twente, Faculty of EEMCS
Gerard J.M. Smit, University of Twente, Faculty of EEMCS
Hajo Broersma, University of Twente, Faculty of EEMCS
Paul M. Heysters, University of Twente, Faculty of EEMCS
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extract functional equivalent structures, i.e. templates, from a control data flow graph. By inspecting the graph the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers the algorithm can find all distinct templates with multiple outputs. The template selection algorithm shows how this information can be used in compilers for reconfigurable systems. The objective of the template selection algorithm is to find an efficient cover for an application graph with a minimal number of distinct templates and minimal number of matches.
Citation:
Yuanqing Guo, Gerard J.M. Smit, Hajo Broersma, Paul M. Heysters, "Template Generation and Selection Algorithms," iwsoc, pp.2, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.