By Topic

Optimal operation scheduling using resource lower bound estimations

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)
Dalkilic, M.E. ; Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA ; Pitchumani, V.

Presents an accurate resource lower bound estimation technique which leads to an efficient, and optimal solution of time-constrained as well as hardware resource-constrained scheduling problems in high-level synthesis. A given time or hardware constrained scheduling problem is transformed into a cost ordered sequence of feasible scheduling problems where a solution to this new problem is guaranteed to be an optimal solution to the original problem. Efficiency of the approach is demonstrated on large high-level synthesis benchmarks like the elliptical wave filter and the discrete cosine transform

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994