IDEAS home Printed from https://ideas.repec.org/a/igg/jissc0/v12y2021i3p40-57.html
   My bibliography  Save this article

Shortest Path Method for Hardware/Software Partitioning Problems

Author

Listed:
  • Adil Iguider

    (Institut National des Postes et Télécommunications, STRS Lab, Rabat, Morocco)

  • Oussama Elissati

    (Institut National des Postes et Télécommunications, STRS Lab, Rabat, Morocco)

  • Abdeslam En-Nouaary

    (Institut National des Postes et Télécommunications, STRS Lab, Rabat, Morocco)

  • Mouhcine Chami

    (Institut National des Postes et Télécommunications, STRS Lab, Rabat, Morocco)

Abstract

Smart systems are becoming more present in every aspect of our daily lives. The main component of such systems is an embedded system; this latter assures the collection, the treatment, and the transmission of the accurate information in the right time and for the right component. Modern embedded systems are facing several challenges; the objective is to design a system with high performance and to decrease the cost and the development time. Consequently, some robust methodologies like the Codesign were developed to fulfill those requirements. The most important step of the Codesign is the partitioning of the systems' functionalities between a hardware set and a software set. This article deals with this problem and uses a heuristic approach based on shortest path optimizations to solve the problem. The aim is to minimize the total hardware area and to respect a constraint on the overall execution time of the system. Experiments results demonstrate that the proposed method is very fast and gives better results compared to the genetic algorithm.

Suggested Citation

  • Adil Iguider & Oussama Elissati & Abdeslam En-Nouaary & Mouhcine Chami, 2021. "Shortest Path Method for Hardware/Software Partitioning Problems," International Journal of Information Systems and Social Change (IJISSC), IGI Global, vol. 12(3), pages 40-57, July.
    • Handle: RePEc:igg:jissc0:v:12:y:2021:i:3:p:40-57
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSC.2021070104
    Download Restriction: no
    ---><---

    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:igg:jissc0:v:12:y:2021:i:3:p:40-57. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.