By Topic

Trade-offs in mapping high-level dataflow graphs onto ASIPs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guzma, V. ; Dept. of Comput. Syst., Tampere Univ. of Technol., Tampere ; Bhattacharyya, S.S. ; Kellomaki, P. ; Takala, J.

Data-flow based design environments bring advantages of specification, validation and synthesis to embedded systems design by decoupling computation from transfer of data. The former is performed by actors, and data transfer between actors and an execution order of actors is determined by scheduling and buffering strategies. In this work, we examine code sizes and cycle counts resulting from combinations of scheduling and buffering techniques. The experiments were carried out by designing an application specific instruction-set processor streamlined for each of the benchmarks, using a codesign environment called TCE. We also show what additional overhead is introduced when an architecture implemented using our approach is employed for an application outside its targeted domain.

Published in:

System-on-Chip, 2008. SOC 2008. International Symposium on

Date of Conference:

5-6 Nov. 2008