Binary partitioning
Goal: Map each node of a directed acyclic graph (DAG) to hardware or software (binary choice) and to determine the schedule for each node.
DAG: The task level description of an application is specified as SDF (synchronous data flow) graph, then SDF is translated to DAG representing precedence relationship among the nodes. A DAG is input to partitioning tool.
Note: For a given mapping of a node (hw or sw), it is possible that the node can be implemented using various algorithms and synthesis mechanisms and they vary by area and delay outcomes. Call this “implementation bins”.