A design space exploration scheme for data-path synthesis

In this paper, we examine the multicriteria optimization involved in schedu ling for data-path synthesis (DPS), The criteria we examine are the area co st of the components and schedule time. Scheduling for DPS is a well-known NP-complete problem. We present a method to find nondominated schedules usi ng a combination of restricted search and heuristic scheduling techniques. Our method supports design with architectural constraints such as the total number of functional units, buses, etc. The schedules produced have been t aken to completion using GABIND as written by Mandal et al., and the result s are promising.