By Topic

A recursive technique for computing lower-bound performance of schedules

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)
Langevin, M. ; Dep. d''IRO, Montreal Univ., Que., Canada ; Cerny, E.

Presents a fast recursive technique for estimating a lower-bound performance of data path schedules. The method relies on the determination of an ASAPUC (as soon as possible under constraint) time-step value for the root of the DFG (data flow graph) that is based on the ASAPUC values of its predecessor nodes, etc., until the leaf nodes are reached where this value becomes the regular ASAP value. The method computes a tighter lower-bound than the greedy technique and is only two times slower on the same benchmarks. Synthesis methods that depend on the exploration of the solution space directed by a lower-bound estimation, such a local microcode generation and behavioral synthesis, can benefit from our method. This is because bad solutions can be pruned earlier. We illustrate this dramatic effect on the reduction of the search space during the synthesis of an optimal microcode sequence for the elliptic wave filter benchmark and a fixed data path (containing a multiport RAM and a ROM)

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993