Dynamic task binding for hardware/software reconfigurable networks

In this paper, a new methodology for tolerating link as well as node defects in self-adaptive reconfigurable networks will be presented. Currently, networked embedded systems need a certain level of redundancy for each node and link in order to tolerate defects and failures in a network. Due to monetary constraints as well as space and power limitations, the replication of each node and link is not an option in most embedded systems. Therefore, we will present a hardware/software partitioning algorithm for reconfigurable networks that optimizes the task binding onto resources at runtime such that node/link defects can be handled and data traffic on links between computational nodes will be minimized. This paper presents a new hardware/software partitioning algorithm, an experimental evaluation and for demonstrating the realizability, an implementation on a network of FPGA-based boards.

[1]  Juan Carlos López,et al.  On the hardware-software partitioning problem: System modeling and partitioning techniques , 2003, TODE.

[2]  Jürgen Teich,et al.  System-Level Synthesis Using Evolutionary Algorithms , 1998, Des. Autom. Embed. Syst..

[3]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[5]  Christian Haubelt,et al.  Distributed HW/SW-partitioning for embedded reconfigurable networks , 2005, Design, Automation and Test in Europe.

[6]  Shuvra S. Bhattacharyya,et al.  CHARMED: a multi-objective co-synthesis framework for multi-mode embedded systems , 2004, Proceedings. 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors, 2004..

[7]  Friedhelm Meyer auf der Heide,et al.  Strongly adaptive token distribution , 2005, Algorithmica.

[8]  Christian Haubelt,et al.  An Operating System Infrastructure for Fault-Tolerant Reconfigurable Networks , 2006, ARCS.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Frank Vahid,et al.  A configurable logic architecture for dynamic hardware/software partitioning , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[11]  Frank Vahid,et al.  Dynamic hardware/software partitioning: a first approach , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[12]  J. Teich,et al.  Online hardware/software partitioning in networked embedded systems , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[13]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[14]  Christian Haubelt,et al.  Modeling and Design of Fault-Tolerant and Self-Adaptive Reconfigurable Networked Embedded Systems , 2006, EURASIP J. Embed. Syst..

[15]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[16]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[17]  Christian Haubelt.  Automatic model based design space exploration for embedded systems: a system level approach , 2005 .

[18]  Maurice Herlihy,et al.  Counting networks , 1994, JACM.