A Coarse-Grained Reconfigurable Architecture with Compilation for High Performance

Algorithm 2

ripup_reroute.

Input: &routingPathLst // routingPathLst stores routing requirements

Output: a new less congested routing solution stored in routingPathLst

1  for (𝑖=0; 𝑖<𝑖Max; 𝑖++) {

2  regDuplicatorLst.clear(); // clear regDuplicatorLst before new iteration

3  newRoutingPathLst.clear();

4   for each path 𝑝 in routingPathLst {

5  src = p.origin; // get start_point of p

6  dest = p.destination; // get end_point of p

7  //step 1: ripup

8  ripup_path(p);  // ripup 𝑝 by release all resources used by p

9  end_step = getReadyStep(dest);

10  //step 2: reroute

11  cost_grid = route_path(src, end_step, &regDuplicatorLst);

12  //step 3: backtrace

13  new_𝑝 = backtrace(dest, &src, cost_grid);

14  add(new_𝑝, newRoutingPathLst);

15  update(regDuplicatorLst, new_𝑝);

16 }

17  routingPathLst = newRoutingPathLst;

18 }