Resource constrained modulo scheduling with global resource sharing

Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per operation type and process. A new method is proposed in order to overcome these restrictions and to share high-cost or limited resources within a process group. This allows the use of less than one resource per operation type and process, while keeping the mutual independence of the involved processes. The method which represents an extension of general scheduling algorithms is not tied to a specific algorithm. The method is explained by using the common List Scheduling and further on applied to examples