By Topic

Efficient scheduling of conditional behaviors using hierarchical conditional dependency graphs in the CODESIS system

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

2 Author(s)
Kountouris, A.A. ; Mitsubishi Electr. ITE, Rennes, France ; Wolinski, C.

In high-level synthesis (HLS) there is a gap between the quality of the synthesized results between data-flow and control-flow dominated behavioral descriptions. Heuristics destined for the former usually perform poorly on the latter. To close this gap, we advocate for a unifying intermediate design representation and adapted heuristics that have the potential to accommodate both types of designs as well as designs that have a mixed data-flow and control-flow nature. To illustrate our point we focus on the problem of scheduling and describe a list scheduling heuristic which uses a probabilistic priority function that exploits conditional resource sharing and speculative execution possibilities. Experiments show that results are quite insensitive to syntactic variance and that conditional behavior is effectively accounted for. To further validate our approach, the CODESIS interactive synthesis tool based on the proposed internal representation and synthesis techniques has been developed

Published in:

Euromicro Conference, 2000. Proceedings of the 26th  (Volume:1 )

Date of Conference: