Resource Estimation Algorithm Under Impreciseness Using Inclusion Scheduling

Abstract

In this paper, we propose a resource estimation algorithm which considers imprecise system characteristics and multiple design attributes. The algorithm is based on a polynomial-time process called inclusion scheduling. Inclusion scheduling takes imprecise system information and generates an averagely good schedule with respect to a design goal. The schedule is associated with various properties. These information are used to determine the initial resource bounds subject to the design goal. Experimental results showing the effectiveness of the approach by comparing the design configuration generated by the traditional algorithm and the approach are presented. Int. J. Found. Comput. Sci. 2001.12:581-598. Downloaded from www.worldscientific.com by QUEEN'S UNIVERSITY on 02/03/15. For personal use only.

Register-constrained inclusion scheduling for imprecise specification

“…In [1], the inclusion scheduling which takes the imprecise system characteristic was proposed. The algorithm was expanded and used in design exploration under imprecise system requirement as well as the estimation of resource bounds [2][3][4]. However, it does not take register criteria in creating a schedule.…”

“…An acceptability function is used to represent both fuzzy and fixed constraints [4]. Besides the constraints, the model exhibits the optimization goal with multiple conflicting criteria, which in this case is, latency and register count.…”