By Topic

A scheduling algorithm based on data modality for high-level synthesis

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
$33 $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

1 Author(s)
Jongsoo Kim ; Dept. of Comput. Sci., Ulsan Univ., South Korea

One of the critical steps in high level synthesis is to determine the particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Syntax Oriented Scheduling (SOS) for high level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data modality and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The proposed algorithm identifies a set of conditions which force a state transition in the control circuit. Given this framework, the remaining transitions can be found and the operations are scheduled into appropriate states using focused local processing only

Published in:

System Theory, 1995., Proceedings of the Twenty-Seventh Southeastern Symposium on

Date of Conference:

12-14 Mar 1995