Research Article
Modelling and Assertion-Based Verification of Run-Time Reconfigurable Designs Using Functional Programming Abstractions
Algorithm 1
The proposed clustering algorithm.
| input: and of the assertion-set | | output: Clusters for RRs | | 1 // The main loop for creating clusters | | 2 ; | | 3 while (!EdgesAllMarked) do | | 4 // Find a non-marked Edge with maximum weight | | 5 = FindMaxW (); | | 6 if | | then | | 7 //Merge the strongly-connected pair | | 8 MergeNodes (, , ); | | 9 // Update the weights in the’ | | 10 UpdateW (); | | 11 end | | 12 else | | 13 MarkEdge (); | | 14 end | | 15 end | | 16 // A Best-Fit bin-packing on still-mergable clusters | | 17 BFPacking (); | | 18 // ’ contains the final set of clusters | | 19 WriteOutput (); |
|