Method for improving performance in online routing of reconfigurable nano architectures
Mahtab Niknahad, Michael Hübner, Jürgen Becker · 2009
Online routing is the method, for connecting hardware resources on reconfigurable hardware while run-time. In this paper we show how to use the bipartite graph presentation of nano architectures to improve their performance during the online routing. We define the performance optimization problem in online routing and then, by defining a cost function based on the graph presentation, apply a semi simulated annealing to solve this optimization problem. The running order of the cost function computation algorithm is linear and easily applicable in runtime.