Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 103059, 15 pages
http://dx.doi.org/10.1155/2014/103059
Research Article

A Tabu Search-Based Memetic Algorithm for Hardware/Software Partitioning

1Department of Mathematics, Minjiang University, Fuzhou 350108, China
2Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou 350108, China
3School of Computational and Applied Mathematics, Faculty of Science, University of the Witwatersrand, (Wits), Johannesburg 2050, South Africa
4TCSE, Faculty of Engineering and Build Environment, University of the Witwatersrand, (Wits), Johannesburg 2050, South Africa

Received 24 March 2014; Revised 16 June 2014; Accepted 16 June 2014; Published 13 July 2014

Academic Editor: Jiaji Wu

Copyright © 2014 Geng Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. I. Hidalgo and J. Lanchares, “Functional partitioning for hardware-software codesign using genetic algorithms,” in Proceedings of the 23rd EUROMICRO Conference, pp. 631–638, September 1997. View at Scopus
  2. M. O’Nils, A. Jantsch, A. Hemani, and H. Tenhunen, “Interactive hardware-software partitioning and memory allocation based on data transfer profiling,” in Proceedings of the International Conference on Recent Advances in Mechantronics (ICRAM ’95), pp. 447–452, Istanbul, Turkey, August 1995.
  3. J. Madsen, J. Grode, P. V. Knudsen, M. E. Petersen, and A. Haxthausen, “Lycos: the lyngby cosynthesis system,” Design Automation for Embedded Systems, vol. 2, no. 2, pp. 195–235, 1997. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Niemann and P. Marwedel, “An algorithm for hardware/software partitioning using mixed integer linear programming,” Automation for Embedded Systems, vol. 2, no. 2, pp. 165–193, 1997. View at Publisher · View at Google Scholar · View at Scopus
  5. K. S. Chatha and R. Vemuri, “Hardware-software partitioning and pipelined scheduling of transformative applications,” IEEE Transactions on Very Large Scale Integration Systems, vol. 10, no. 3, pp. 193–208, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Kalavade, System-level codesign of mixed hardware-software systems, [Ph.D. dissertation], EECS Department, University of California, Berkeley, Calif, USA, 1995.
  7. J. Henkel and R. Ernst, “An approach to automated hardware/software partitioning using a flexible granularity that is driven by high-level estimation techniques,” IEEE Transactions on Very Large Scale Integration Systems, vol. 9, no. 2, pp. 273–289, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Eles, Z. Peng, K. Kuchcinski, and A. Doboli, “Systems level hardware/software partitioning based on simulated annealing and tabu search,” Design Automation for Embedded Systems, vol. 2, no. 1, pp. 5–32, 1997. View at Publisher · View at Google Scholar · View at Scopus
  9. R. Ernst, J. Henkel, and T. Benner, “Hardware-software cosynthesis for microcontrollers,” IEEE Design and Test of Computers, vol. 10, no. 4, pp. 425–449, 2002. View at Google Scholar
  10. R. P. Dick and N. K. Jha, “MOGAC: a multiobjective genetic algorithm for hardware-software cosynthesis of distributed embedded systems,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 10, pp. 920–935, 1998. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Purnaprajna, M. Reformat, and W. Pedrycz, “Genetic algorithms for hardware-software partitioning and optimal resource allocation,” Journal of Systems Architecture, vol. 53, no. 7, pp. 339–354, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. P. K. Nath and D. Datta, “Multi-objective hardware-software partitioning of embedded systems: a case study of JPEG encoder,” Applied Soft Computing, vol. 15, pp. 30–41, 2014. View at Google Scholar
  13. T. Wiangtong, P. K. Cheung, and W. Luk, “Comparing three heuristic search methods for functional partitioning in hardware-software codesign,” Design Automation for Embedded Systems, vol. 6, no. 4, pp. 425–449, 2002. View at Publisher · View at Google Scholar · View at Scopus
  14. J. C. Wu, Q. Q. Sun, and T. Srikanthan, “Algorithmic aspects for multiple-choice hardware/software partitioning,” Computers and Operations Research, vol. 39, no. 12, pp. 3281–3292, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Liu, J. Wu, and Y. Wang, “Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices,” Mathematical and Computer Modelling, vol. 58, no. 1-2, pp. 409–420, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. G. Zhang, W. J. Luo, Z. M. Zhang, B. Li, and X. F. Wang, “A hardware/software partitioning algorithm based on artificial immune principles,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 383–391, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. M. López-Vallejo and J. C. López, “On the hardware-software partitioning problem: System modeling and partitioning techniques,” ACM Transactions on Design Automation of Electronic Systems, vol. 8, no. 3, pp. 269–297, 2003. View at Publisher · View at Google Scholar · View at Scopus
  18. P. Arató, Z. Á. Mann, and A. Orbán, “Algorithmic aspects of hardware/software partitioning,” ACM Transactions on Design Automation of Electronic Systems, vol. 10, no. 1, pp. 136–156, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. W. Jigang, T. Srikanthan, and G. Chen, “Algorithmic aspects of hardware/software partitioning: 1D search algorithms,” IEEE Transactions on Computers, vol. 59, no. 4, pp. 532–544, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. A. Kalavade and P. A. Subrahmanyam, “Hardware/software partitioning for multifunction systems,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 9, pp. 819–837, 1998. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Peng, M. Lin, and J. Yang, “Hardware-software partitioning research based on resource constraint,” Journal of Circuits and Systems, vol. 10, no. 3, pp. 80–84, 2005 (Chinese). View at Google Scholar
  22. D. Gajski, N. Dutt, A. We, and S. Lin, High-Level Synthesis Introduction to Chip and System Design, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
  23. M. Sinclair, “An exact penalty function approach for nonlinear integer programming problems,” European Journal of Operational Research, vol. 27, no. 1, pp. 50–56, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. A. Homaifar, S. H. Y. Lai, and C. X. Qi, “Constrained optimization via genetic algorithms,” Simulation, vol. 62, no. 4, pp. 242–254, 1994. View at Publisher · View at Google Scholar · View at Scopus
  25. R. Sarker and C. Newton, “A genetic algorithm for solving economic lot size scheduling problem,” Computers & Industrial Engineering, vol. 42, no. 2–4, pp. 189–198, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. T. P. Runarsson and X. Yao, “Stochastic ranking for constrained evolutionary optimization,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 3, pp. 284–294, 2000. View at Publisher · View at Google Scholar · View at Scopus
  27. D. W. Coit, A. E. Smith, and D. M. Tate, “Adaptive penalty methods for genetic optimization of constrained combinatorial problems,” INFORMS Journal on Computing, vol. 8, no. 2, pp. 173–182, 1996. View at Publisher · View at Google Scholar · View at Scopus
  28. R. Farmani and J. A. Wright, “Self-adaptive fitness formulation for constrained optimization,” IEEE Transactions on Evolutionary Computation, vol. 7, no. 5, pp. 445–455, 2003. View at Publisher · View at Google Scholar · View at Scopus
  29. B. Tessema and G. G. Yen, “An adaptive penalty formulation for constrained evolutionary optimization,” IEEE Transactions on Systems, Man, and Cybernetics A, vol. 39, no. 3, pp. 565–578, 2009. View at Publisher · View at Google Scholar · View at Scopus
  30. M. M. Ali and W. X. Zhu, “A penalty function-based differential evolution algorithm for constrained global optimization,” Computational Optimization and Applications, vol. 54, no. 3, pp. 707–739, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. H. J. C. Barbosa and A. C. C. Lemonge, “A new adaptive penalty scheme for genetic algorithms,” Information Sciences, vol. 156, no. 3-4, pp. 215–251, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. R. Dawkins, The Selfish Gene, Oxford University, Oxford, UK, 1989.
  33. P. Moscato, “Memetic algorithms: a short introduction,” in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., pp. 219–234, McGraw-Hill, New York, NY, USA, 1999. View at Google Scholar
  34. A. R. Buck, J. M. Keller, and M. Skubic, “A memetic algorithm for matching spatial configurations with the histograms of forces,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 4, pp. 588–604, 2013. View at Publisher · View at Google Scholar · View at Scopus
  35. G. Lin and W. X. Zhu, “An efficient mememtic algorithm for the max-bisection problem,” IEEE Transactions on Computers, vol. 63, no. 6, pp. 1365–1376, 2014. View at Google Scholar
  36. M. Urselmann, S. Barkmann, G. Sand, and S. Engell, “A memetic algorithm for global optimization in chemical process synthesis problems,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 5, pp. 659–683, 2011. View at Publisher · View at Google Scholar · View at Scopus
  37. G. Iacca, F. Caraffini, and F. Neri, “Memory-saving memetic computing for path-following mobile robots,” Applied Soft Computing, vol. 13, no. 4, pp. 2003–2016, 2013. View at Publisher · View at Google Scholar · View at Scopus
  38. Z. Lü and J.-K. Hao, “A memetic algorithm for graph coloring,” European Journal of Operational Research, vol. 203, no. 1, pp. 241–250, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. Z. Z. Zhang, O. Che, B. Cheang, A. Lim, and H. Qin, “A memetic algorithm for the multiperiod vehicle routing problem with profit,” European Journal of Operational Research, vol. 229, no. 3, pp. 573–584, 2013. View at Publisher · View at Google Scholar · View at Scopus
  40. T. C. E. Cheng, B. Peng, and Z. Lü, “A hybrid evolutionary algorithm to solve the job shop scheduling problem,” Annals of Operations Research, 2013. View at Publisher · View at Google Scholar · View at Scopus
  41. P. Chardaire, M. Barake, and G. P. McKeown, “A {PROBE}-based heuristic for graph partitioning,” IEEE Transactions on Computers, vol. 56, no. 12, pp. 1707–1720, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. Y. Q. Cai, J. H. Wang, J. Yin, and Y. L. Zhou, “Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems,” Expert Systems with Applications, vol. 38, no. 6, pp. 7817–7827, 2011. View at Publisher · View at Google Scholar · View at Scopus
  43. N. F. Unver and M. M. Kokar, “Self controlling tabu search algorithm for the quadratic assignment problem,” Computers & Industrial Engineering, vol. 60, no. 2, pp. 310–319, 2011. View at Publisher · View at Google Scholar · View at Scopus
  44. T. James, C. Rego, and F. Glover, “Multistart tabu search and diversification strategies for the quadratic assignment problem,” IEEE Transactions on Systems, Man, and Cybernetics A, vol. 39, no. 3, pp. 579–596, 2009. View at Publisher · View at Google Scholar · View at Scopus
  45. S. Kulturel-Konak, “A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays,” European Journal of Operational Research, vol. 223, no. 3, pp. 614–625, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. F. Glover and M. Laguna, Tabu Search, Springer, New York, NY, USA, 1997.
  47. F. Glover, M. Laguna, and R. Martí, “Fundamentals of scatter search and path relinking,” Control and Cybernetics, vol. 29, no. 3, pp. 653–684, 2000. View at Google Scholar · View at MathSciNet · View at Scopus
  48. H. Barbalho, I. Rosseti, S. L. Martins, and A. Plastino, “A hybrid data mining GRASP with path-relinking,” Computers & Operations Research, vol. 40, no. 12, pp. 3159–3173, 2013. View at Publisher · View at Google Scholar · View at Scopus
  49. Y. Wang, Z. Lü, F. Glover, and J. Hao, “Path relinking for unconstrained binary quadratic programming,” European Journal of Operational Research, vol. 223, no. 3, pp. 595–604, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  50. Y. M. Deng and J. F. Bard, “A reactive GRASP with path relinking for capacitated clustering,” Journal of Heuristics, vol. 17, no. 2, pp. 119–152, 2011. View at Publisher · View at Google Scholar · View at Scopus
  51. R. P. Beausoleil, G. Baldoquin, and R. A. Montejo, “Multi-start and path relinking methods to deal with multiobjective knapsack problems,” Annals of Operations Research, vol. 157, no. 1, pp. 105–133, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  52. L. Y. Tseng and S. C. Chen, “Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 4, pp. 848–857, 2009. View at Publisher · View at Google Scholar · View at Scopus
  53. K. Sörensen and M. Sevaux, “MA|PM: memetic algorithms with population management,” Computers & Operations Research, vol. 33, no. 5, pp. 1214–1225, 2006. View at Publisher · View at Google Scholar · View at Scopus
  54. R. P. Dick, D. L. Rhodes, and W. Wolf, “TGFF: task graphs for free,” in Proceedings of the 6th International Workshop on Hardware/Software Codesign, pp. 97–101, March 1998. View at Scopus