IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/138037.html
   My bibliography  Save this article

An Effective Heuristic-Based Approach for Partitioning

Author

Listed:
  • Xibin Zhao
  • Hehua Zhang
  • Yu Jiang
  • Songzheng Song
  • Xun Jiao
  • Ming Gu

Abstract

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.

Suggested Citation

  • Xibin Zhao & Hehua Zhang & Yu Jiang & Songzheng Song & Xun Jiao & Ming Gu, 2013. "An Effective Heuristic-Based Approach for Partitioning," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-8, April.
    • Handle: RePEc:hin:jnljam:138037
    DOI: 10.1155/2013/138037
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/138037.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2013/138037.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/138037?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:138037. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.