Meta-heuristics: For the problem of partitioning hardware/software

In recent years, several meta-heuristics have proved their effectiveness in solving combinatorial problems such as hardware / software partitioning. In this paper, we present a synthesis of main meta-heuristics: local search methods and evolutionary algorithms. We offer an analysis of these meta-heuristics by identifying the fundamental ideas guiding the choice of a meta-heuristic in practice.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[3]  Vangelis Th. Paschos,et al.  Applications of combinatorial optimization , 2010 .

[4]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[5]  Richard T. Wong,et al.  Combinatorial Optimization: Algorithms and Complexity (Christos H. Papadimitriou and Kenneth Steiglitz) , 1983 .

[6]  Wu Jigang,et al.  Low-complex dynamic programming algorithm for hardware/software partitioning , 2006, Inf. Process. Lett..

[7]  Abdellatif Mtibaa,et al.  Optimal placement of modules on partially reconfigurable device for reconfiguration time improvement , 2012 .

[8]  Abdellatif Mtibaa,et al.  A partitioning methodology that optimizes the communication cost for reconfigurable computing systems , 2012, International Journal of Automation and Computing.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Abdellatif Mtibaa,et al.  Temporal partitioning of data flow graph for dynamically reconfigurable architecture , 2011, J. Syst. Archit..

[11]  Nikil D. Dutt,et al.  Integrating Physical Constraints in HW-SW Partitioning for Architectures With Partial Dynamic Reconfiguration , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[12]  José Alí Moreno,et al.  An Efficient Heuristic for the Traveling Salesman Problem Based on a Growing SOM-like Algorithm , 2005 .

[13]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[14]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[15]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[16]  Gilbert Laporte,et al.  Metaheuristics in combinatorial optimization , 1996 .

[17]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[18]  Abdellatif Mtibaa,et al.  Combining temporal partitioning and temporal placement techniques for communication cost improvement , 2011, Adv. Eng. Softw..

[19]  Mehdi Jemai,et al.  Optimization of logic area for System on Programmable Chip based on hardware-software partitioning , 2014 .

[20]  Ranga Vemuri,et al.  Hardware-software partitioning and pipelined scheduling of transformative applications , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .