Method for improving performance in online routing of reconfigurable nano architectures

Author

Niknahad, Mahtab ; Hübner, Michael ; Becker, Jürgen

Author_Institution

Univ. Karlsruhe (TH), Karlsruhe, Germany

fYear

2009

fDate

9-11 Sept. 2009

Firstpage

65

Lastpage

68

Abstract

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.

Keywords

network routing; reconfigurable architectures; simulated annealing; bipartite graph presentation; cost function; cost function computation algorithm; nano architectures; online routing; performance optimization problem; reconfigurable hardware; reconfigurable nano architectures; semisimulated annealing; Bipartite graph; Computational modeling; Computer architecture; Cost function; Hardware; Joining processes; Optimization; Routing; Runtime; Simulated annealing; Nano architectures; Online routing; Performance optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

SOC Conference, 2009. SOCC 2009. IEEE International

Conference_Location

Belfast

Print_ISBN

978-1-4244-4940-8

Electronic_ISBN

978-1-4244-4941-5

Type

conf

DOI

10.1109/SOCCON.2009.5398093

Filename

5398093