Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures
Recent development methodologies from the industry and the academia for complex real-time systems define a stage in which system functions are deployed onto an execution platform. The deployment consists of the placement of functions on a distributed network of nodes, the partitioning of functions i...
Gespeichert in:
Veröffentlicht in: | Automated software engineering 2019-03, Vol.26 (1), p.1-57 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 57 |
---|---|
container_issue | 1 |
container_start_page | 1 |
container_title | Automated software engineering |
container_volume | 26 |
creator | Mehiaoui, Asma Wozniak, Ernest Babau, Jean-Philippe Tucci-Piergiovanni, Sara Mraidha, Chokri |
description | Recent development methodologies from the industry and the academia for complex real-time systems define a stage in which system functions are deployed onto an execution platform. The deployment consists of the placement of functions on a distributed network of nodes, the partitioning of functions in tasks and the scheduling of tasks and messages. In this paper, we present two approaches towards the efficient deployment of realistic and complex real-time systems by considering tree-shaped functional models. A formal approach to compute optimal deployment and a heuristic approach to scale to industry-size systems. The approaches consider placement, partitioning and scheduling, and are based on mixed integer linear programming (MILP) technique. Furthermore, we present a deep evaluation of the proposed deployment approaches to show the benefits and limits of a MILP-based deployment approach. A set of synthetic use-cases as well as a real-life automotive system are used to assess the quality and scalability of our deployment approaches. Considering use-cases, we show an added value with respect to end-to-end latencies optimization when solving the three stages of the deployment problem at the same time. This is done by comparing the quality of the solutions obtained with our techniques to those returned by the existing approaches. |
doi_str_mv | 10.1007/s10515-018-0244-7 |
format | Article |
fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02060027v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918203487</sourcerecordid><originalsourceid>FETCH-LOGICAL-c350t-7999e71ae4af767d4b8b85a9e07466cefd5b471c0f41db76755176b9b3e046353</originalsourceid><addsrcrecordid>eNp1kM1KxDAURoMoOP48gLuAKxfRmzZpmqWIOsKAG12HtL2dRjttTVJhfHpbKrpyFbiccyAfIRccrjmAugkcJJcMeM4gEYKpA7LiUqVMyVQekhXoJGe55nBMTkJ4AwCdab0i789DdDv35botjQ3SCoe23--wi7SvafSILDR2wIrWY1dG13e2pVtvhybMgEfbsimANOxDxB3tO1q5EL0rxjhJ1peNi1jG0WM4I0e1bQOe_7yn5PXh_uVuzTbPj093txtWphIiU1prVNyisLXKVCWKvMil1QhKZFmJdSULoXgJteBVMRFScpUVukgRRJbK9JRcLd3Gtmbwbmf93vTWmfXtxsw3SCADSNQnn9jLhR18_zFiiOatH_30yWASzfMEUpGrieILVfo-BI_1b5aDmfc3y_5m2t_M-5vZSRYnTGy3Rf9X_l_6BlzniME</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918203487</pqid></control><display><type>article</type><title>Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>Mehiaoui, Asma ; Wozniak, Ernest ; Babau, Jean-Philippe ; Tucci-Piergiovanni, Sara ; Mraidha, Chokri</creator><creatorcontrib>Mehiaoui, Asma ; Wozniak, Ernest ; Babau, Jean-Philippe ; Tucci-Piergiovanni, Sara ; Mraidha, Chokri</creatorcontrib><description>Recent development methodologies from the industry and the academia for complex real-time systems define a stage in which system functions are deployed onto an execution platform. The deployment consists of the placement of functions on a distributed network of nodes, the partitioning of functions in tasks and the scheduling of tasks and messages. In this paper, we present two approaches towards the efficient deployment of realistic and complex real-time systems by considering tree-shaped functional models. A formal approach to compute optimal deployment and a heuristic approach to scale to industry-size systems. The approaches consider placement, partitioning and scheduling, and are based on mixed integer linear programming (MILP) technique. Furthermore, we present a deep evaluation of the proposed deployment approaches to show the benefits and limits of a MILP-based deployment approach. A set of synthetic use-cases as well as a real-life automotive system are used to assess the quality and scalability of our deployment approaches. Considering use-cases, we show an added value with respect to end-to-end latencies optimization when solving the three stages of the deployment problem at the same time. This is done by comparing the quality of the solutions obtained with our techniques to those returned by the existing approaches.</description><identifier>ISSN: 0928-8910</identifier><identifier>EISSN: 1573-7535</identifier><identifier>DOI: 10.1007/s10515-018-0244-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Artificial Intelligence ; Computer networks ; Computer Science ; Embedded Systems ; Heuristic methods ; Integer programming ; Linear programming ; Mixed integer ; Optimization ; Partitioning ; Placement ; Quality assessment ; Real time ; Software Engineering/Programming and Operating Systems ; Task scheduling</subject><ispartof>Automated software engineering, 2019-03, Vol.26 (1), p.1-57</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c350t-7999e71ae4af767d4b8b85a9e07466cefd5b471c0f41db76755176b9b3e046353</citedby><cites>FETCH-LOGICAL-c350t-7999e71ae4af767d4b8b85a9e07466cefd5b471c0f41db76755176b9b3e046353</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10515-018-0244-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918203487?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>230,314,780,784,885,21388,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids><backlink>$$Uhttps://hal.science/hal-02060027$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Mehiaoui, Asma</creatorcontrib><creatorcontrib>Wozniak, Ernest</creatorcontrib><creatorcontrib>Babau, Jean-Philippe</creatorcontrib><creatorcontrib>Tucci-Piergiovanni, Sara</creatorcontrib><creatorcontrib>Mraidha, Chokri</creatorcontrib><title>Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures</title><title>Automated software engineering</title><addtitle>Autom Softw Eng</addtitle><description>Recent development methodologies from the industry and the academia for complex real-time systems define a stage in which system functions are deployed onto an execution platform. The deployment consists of the placement of functions on a distributed network of nodes, the partitioning of functions in tasks and the scheduling of tasks and messages. In this paper, we present two approaches towards the efficient deployment of realistic and complex real-time systems by considering tree-shaped functional models. A formal approach to compute optimal deployment and a heuristic approach to scale to industry-size systems. The approaches consider placement, partitioning and scheduling, and are based on mixed integer linear programming (MILP) technique. Furthermore, we present a deep evaluation of the proposed deployment approaches to show the benefits and limits of a MILP-based deployment approach. A set of synthetic use-cases as well as a real-life automotive system are used to assess the quality and scalability of our deployment approaches. Considering use-cases, we show an added value with respect to end-to-end latencies optimization when solving the three stages of the deployment problem at the same time. This is done by comparing the quality of the solutions obtained with our techniques to those returned by the existing approaches.</description><subject>Artificial Intelligence</subject><subject>Computer networks</subject><subject>Computer Science</subject><subject>Embedded Systems</subject><subject>Heuristic methods</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Mixed integer</subject><subject>Optimization</subject><subject>Partitioning</subject><subject>Placement</subject><subject>Quality assessment</subject><subject>Real time</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Task scheduling</subject><issn>0928-8910</issn><issn>1573-7535</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kM1KxDAURoMoOP48gLuAKxfRmzZpmqWIOsKAG12HtL2dRjttTVJhfHpbKrpyFbiccyAfIRccrjmAugkcJJcMeM4gEYKpA7LiUqVMyVQekhXoJGe55nBMTkJ4AwCdab0i789DdDv35botjQ3SCoe23--wi7SvafSILDR2wIrWY1dG13e2pVtvhybMgEfbsimANOxDxB3tO1q5EL0rxjhJ1peNi1jG0WM4I0e1bQOe_7yn5PXh_uVuzTbPj093txtWphIiU1prVNyisLXKVCWKvMil1QhKZFmJdSULoXgJteBVMRFScpUVukgRRJbK9JRcLd3Gtmbwbmf93vTWmfXtxsw3SCADSNQnn9jLhR18_zFiiOatH_30yWASzfMEUpGrieILVfo-BI_1b5aDmfc3y_5m2t_M-5vZSRYnTGy3Rf9X_l_6BlzniME</recordid><startdate>20190301</startdate><enddate>20190301</enddate><creator>Mehiaoui, Asma</creator><creator>Wozniak, Ernest</creator><creator>Babau, Jean-Philippe</creator><creator>Tucci-Piergiovanni, Sara</creator><creator>Mraidha, Chokri</creator><general>Springer US</general><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>1XC</scope></search><sort><creationdate>20190301</creationdate><title>Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures</title><author>Mehiaoui, Asma ; Wozniak, Ernest ; Babau, Jean-Philippe ; Tucci-Piergiovanni, Sara ; Mraidha, Chokri</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c350t-7999e71ae4af767d4b8b85a9e07466cefd5b471c0f41db76755176b9b3e046353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Artificial Intelligence</topic><topic>Computer networks</topic><topic>Computer Science</topic><topic>Embedded Systems</topic><topic>Heuristic methods</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Mixed integer</topic><topic>Optimization</topic><topic>Partitioning</topic><topic>Placement</topic><topic>Quality assessment</topic><topic>Real time</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Task scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mehiaoui, Asma</creatorcontrib><creatorcontrib>Wozniak, Ernest</creatorcontrib><creatorcontrib>Babau, Jean-Philippe</creatorcontrib><creatorcontrib>Tucci-Piergiovanni, Sara</creatorcontrib><creatorcontrib>Mraidha, Chokri</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Automated software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mehiaoui, Asma</au><au>Wozniak, Ernest</au><au>Babau, Jean-Philippe</au><au>Tucci-Piergiovanni, Sara</au><au>Mraidha, Chokri</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures</atitle><jtitle>Automated software engineering</jtitle><stitle>Autom Softw Eng</stitle><date>2019-03-01</date><risdate>2019</risdate><volume>26</volume><issue>1</issue><spage>1</spage><epage>57</epage><pages>1-57</pages><issn>0928-8910</issn><eissn>1573-7535</eissn><abstract>Recent development methodologies from the industry and the academia for complex real-time systems define a stage in which system functions are deployed onto an execution platform. The deployment consists of the placement of functions on a distributed network of nodes, the partitioning of functions in tasks and the scheduling of tasks and messages. In this paper, we present two approaches towards the efficient deployment of realistic and complex real-time systems by considering tree-shaped functional models. A formal approach to compute optimal deployment and a heuristic approach to scale to industry-size systems. The approaches consider placement, partitioning and scheduling, and are based on mixed integer linear programming (MILP) technique. Furthermore, we present a deep evaluation of the proposed deployment approaches to show the benefits and limits of a MILP-based deployment approach. A set of synthetic use-cases as well as a real-life automotive system are used to assess the quality and scalability of our deployment approaches. Considering use-cases, we show an added value with respect to end-to-end latencies optimization when solving the three stages of the deployment problem at the same time. This is done by comparing the quality of the solutions obtained with our techniques to those returned by the existing approaches.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10515-018-0244-7</doi><tpages>57</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0928-8910 |
ispartof | Automated software engineering, 2019-03, Vol.26 (1), p.1-57 |
issn | 0928-8910 1573-7535 |
language | eng |
recordid | cdi_hal_primary_oai_HAL_hal_02060027v1 |
source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
subjects | Artificial Intelligence Computer networks Computer Science Embedded Systems Heuristic methods Integer programming Linear programming Mixed integer Optimization Partitioning Placement Quality assessment Real time Software Engineering/Programming and Operating Systems Task scheduling |
title | Optimizing the deployment of tree-shaped functional graphs of real-time system on distributed architectures |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T17%3A03%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimizing%20the%20deployment%20of%20tree-shaped%20functional%20graphs%20of%20real-time%20system%20on%20distributed%20architectures&rft.jtitle=Automated%20software%20engineering&rft.au=Mehiaoui,%20Asma&rft.date=2019-03-01&rft.volume=26&rft.issue=1&rft.spage=1&rft.epage=57&rft.pages=1-57&rft.issn=0928-8910&rft.eissn=1573-7535&rft_id=info:doi/10.1007/s10515-018-0244-7&rft_dat=%3Cproquest_hal_p%3E2918203487%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918203487&rft_id=info:pmid/&rfr_iscdi=true |