Research Article
Timing-Driven Nonuniform Depopulation-Based Clustering
Algorithm 1
The pseudocode for T-NDPack.
| Compute the criticality of each block | | Sort the blocks with criticality | | While unclustered blocks available | | Find a seed with maximum criticality | | Determine the maximum utilization level in the cluster based on the ranking of the seed's criticality | | through looking up “maximum utilization table" (MUT) | | While maximum utilization level is not reached | | Build the candidate block list that criticality > “candidate block threshold" (CBT) (CBT is | | determined by the current utilization level) | | If candidate block list is empty | | Break | | End if | | If the related blocks available | | Choose a related block with highest gain from the candidate block list | | Else if (current utilization level < “unrelated block threshold" (UBT)) | | Choose a unrelated block with the highest gain from the candidate block list //unrelated | | block Clustering | | Else | | Break | | End if | | Remove block from unclusered block list | | Add block to current cluster | | Current clustered block number | | End while | | End while |
|
