Bin Selection
Key Idea: Use look-ahead measure to correlate the implementation bin of the tagged node with the hardware area required for the freeh nodes. It selects most responsive bin in this respect as the implementation bin for the tagged node.
Assume that freeh nodes can be either L or H bins. Initially, say H bins.
Now, for each bin j of tagged node T, compute the fraction of freeh nodes that need to be moved from H bins to L bins in order to meet timing constraints (BFTj).
The bin fraction curve BFCT is the collection of the all bin fraction values of the tagged node T.