Donald Bren School of Information and Computer Sciences

Scheduling and binding are two major tasks in architectural synthesis. The information about mutually exclusive pairs of operations is very useful in reducing both the total delay of the schedule and the resource usage in the final implementation. In this paper, we present an efficient scheme which identifies all the mutually exclusive operation pairs in behavioral descriptions. Our algorithm uses data-flow analysis on a tabular model of system functionality, and is shown to work better than existing methods for identifying mutually exclusive operations.