Binary partitioning problem
Given a DAG, area and time estimates for hw and sw mapping of all nodes, and communication cost, subject to resource capacity constraints and deadline D, determine for each node i, the hw or sw mapping(Mi) and the start time for the execution of the node (schedule ti), such that the total area occupied by the nodes mapped to hardware is minimum.