An algorithm to determine mutually exclusive operations in behavioral descriptions
J. Li, Rajesh K. Gupta · 1998
Scheduling and binding are two major tasks in architectural synthesis from behavioral descriptions. The information about the mutually exclusive pairs of operations is very useful in reducing both the total delay of the schedule and the resource usage in the final circuit implementation. In this paper, we present an algorithm to identify the largest set of 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 the existing methods for identifying mutually exclusive operations. 1 Introduction Architectural (or high-level) synthesis attempts to build a macrolevel circuit consisting of major functional blocks and their interconnection from a given behavioral description. Two of the major tasks in architectural synthesis are operation scheduling and resource binding [1]. Scheduling determines the start time of each operation while binding maps operations to hardware...