{"id":7821,"date":"2018-11-05T14:49:54","date_gmt":"2018-11-05T13:49:54","guid":{"rendered":"http:\/\/synthese.univ-annaba.dz\/?p=7821"},"modified":"2018-11-06T13:56:30","modified_gmt":"2018-11-06T12:56:30","slug":"un-algorithme-hybride-pour-la-resolution-du-probleme-de-partitionnement-materiellogiciel","status":"publish","type":"post","link":"https:\/\/synthese.univ-annaba.dz\/?p=7821","title":{"rendered":"Un algorithme hybride pour la r\u00e9solution du probl\u00e8me de partitionnement mat\u00e9riel\/logiciel"},"content":{"rendered":"<p><strong>Num\u00e9ro de la revue<\/strong>: 37<br \/>\n<strong>Auteurs<\/strong>: Mourad Khetatba &amp; Rachid Boudour<\/p>\n<p><em>Laboratoire de syst\u00e8mes embarqu\u00e9s -LASE-, Universit\u00e9 Badji Mokhtar-Annaba. BP 12, Annaba 23000, Alg\u00e9rie.<\/em><\/p>\n<p>&nbsp;<\/p>\n<p><em>Soumis le\u00a0: 16\/07\/2017\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 R\u00e9vis\u00e9 le\u00a0: 19\/06\/2018\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Accept\u00e9 le\u00a0: 20\/06\/2018<\/em><\/p>\n<p style=\"text-align: right;\"><a href=\"http:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2018\/11\/1-32.17.pdf\"><strong>T\u00e9l\u00e9charger l&rsquo;article<img loading=\"lazy\" decoding=\"async\" class=\" wp-image-709 alignright\" style=\"margin-top: -10px; margin-bottom: -10px;\" src=\"\/wp-content\/uploads\/2014\/04\/p2.jpg\" alt=\"p2\" width=\"37\" height=\"35\" srcset=\"https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2.jpg 113w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-24x24.jpg 24w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-48x46.jpg 48w\" sizes=\"auto, (max-width: 37px) 100vw, 37px\" \/><\/strong><\/a><\/p>\n<p><strong>R\u00e9sum\u00e9<\/strong><\/p>\n<p style=\"text-align: justify;\">Pour d\u00e9velopper un syst\u00e8me embarqu\u00e9 avec un rapport co\u00fbt\u00a0\/ performance raisonnable, les concepteurs s\u2019orientent vers la conception conjointe mat\u00e9riel\/logiciel (M\/L) ou codesign. Cette m\u00e9thodologie comporte une suite d\u2019\u00e9tapes dont les r\u00e9sultats de la premi\u00e8re est une sp\u00e9cification ex\u00e9cutable et la derni\u00e8re est un prototype virtuel du syst\u00e8me. Le partitionnement M\/L, une \u00e9tape cruciale du processus de Co design, a pour finalit\u00e9 de diviser le comportement d\u2019un syst\u00e8me en deux sous-ensembles de fonctions, l\u2019un mat\u00e9riel et l\u2019autre logiciel. Le probl\u00e8me de partitionnement M\/L \u00e9tant NP-difficile, la litt\u00e9rature foisonne d\u2019approches compl\u00e9mentaires pour rem\u00e9dier approximativement \u00e0 ce probl\u00e8me. Dans ce papier, nous proposons un nouveau algorithme hybride et fiable de partitionnement M\/L bas\u00e9 sur le principe de l\u2019algorithme Late Acceptance Hill Climbing(LAHC) et de l&rsquo;algorithme g\u00e9n\u00e9tique (AG). LAHC est connue pour sa recherche locale efficace, conjugu\u00e9e \u00e0 la potentialit\u00e9 importante de recherche globale de l\u2019AG. L&rsquo;algorithme hybride, a \u00e9t\u00e9 appliqu\u00e9 et a donn\u00e9 de meilleurs r\u00e9sultats, compar\u00e9s \u00e0 ceux de l\u2019\u00e9tat de l\u2019art.<\/p>\n<p style=\"text-align: justify;\"><strong>Mots cl\u00e9s : <\/strong><em>Partitionnement M\/L-Metaheuristique-Acceptation tardive de Hill Climbing- Algorithme g\u00e9n\u00e9tique- Algorithme hybride<\/em><\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Num\u00e9ro de la revue: 37 Auteurs: Mourad Khetatba &amp; Rachid Boudour Laboratoire de syst\u00e8mes embarqu\u00e9s -LASE-, Universit\u00e9 Badji Mokhtar-Annaba. BP 12, Annaba 23000, Alg\u00e9rie. &nbsp; Soumis le\u00a0: 16\/07\/2017\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 R\u00e9vis\u00e9 le\u00a0: 19\/06\/2018\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Accept\u00e9 le\u00a0: 20\/06\/2018 T\u00e9l\u00e9charger l&rsquo;article R\u00e9sum\u00e9 Pour d\u00e9velopper &hellip; <a href=\"https:\/\/synthese.univ-annaba.dz\/?p=7821\">Lire la suite <span class=\"meta-nav\">&raquo;<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1289],"tags":[],"class_list":["post-7821","post","type-post","status-publish","format-standard","hentry","category-synthese-37"],"_links":{"self":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7821","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7821"}],"version-history":[{"count":2,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7821\/revisions"}],"predecessor-version":[{"id":7825,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7821\/revisions\/7825"}],"wp:attachment":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7821"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7821"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7821"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}