the combination of scheduling, allocation, and mapping in a single algorithm
We present a single high level synthesis algorithm that schedules the operations of a data dependence graph, allocates the necessary hardware, and maps the operations to specific functional units. This is achieved by extending the global analysis approach developed for force-directed scheduling to include individual module instances. This new algorithm should be applicable to any behavioral synthesis system that schedules operations from a data dependence graph.
combinational scheduling allocation maps maps algorithm high level synthesis operability data dependence graph hardware functional global analysis module behavioral synthesis systems direct map