In this paper we examine the multi-criteria optimization involved in scheduling for data path synthesis (DPS). The criteria we examine are the area cost of the components and the schedule time. Scheduling for DPS is a well known NP-Complete problem. We present a method to find non-dominated schedules using 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 taken to completion using GABIND and the results are promising.

Keywords: Data Path Synthesis, Design Space Exploration, Scheduling, VLSI.