Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems

Car manufacturers provide a growing variety of models and configuration options for customers. In the highly competitive and cost-driven automotive industry, managing these variants and increasing the reuse of functionality in different variants has therefore become one of the key challenges. This p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 2016-04, Vol.35 (4), p.637-650
Hauptverfasser: Sagstetter, Florian, Waszecki, Peter, Steinhorst, Sebastian, Lukasiewycz, Martin, Chakraborty, Samarjit
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 650
container_issue 4
container_start_page 637
container_title IEEE transactions on computer-aided design of integrated circuits and systems
container_volume 35
creator Sagstetter, Florian
Waszecki, Peter
Steinhorst, Sebastian
Lukasiewycz, Martin
Chakraborty, Samarjit
description Car manufacturers provide a growing variety of models and configuration options for customers. In the highly competitive and cost-driven automotive industry, managing these variants and increasing the reuse of functionality in different variants has therefore become one of the key challenges. This paper addresses the problem of generating variant schedules for time-triggered electrical/electronic-architectures. We propose a multischedule synthesis approach that determines the common parts of multiple variants and generates a schedule that exploits this commonality. Hence, a multischedule defines individual variant schedules with an identical schedule for applications common to different variants. This makes these applications variant-independent, thus, reduces the testing and integration efforts as it only has to be done once. Multischedule synthesis involves several challenges, viz., identification of commonality between different variants, schedule synthesis for common parts, and the integration of uncommon parts. Consequently, the schedule synthesis approach presented here is very different from conventional approaches. Finally, to address the increased complexity, we also propose a divide-and-conquer approach to partition the problem, improving the scalability.
doi_str_mv 10.1109/TCAD.2015.2488480
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_7294654</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7294654</ieee_id><sourcerecordid>4045933171</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-2ee30517e6242be48a22c38412343b868887e6a0a8b16486711abcc37fc4b8d73</originalsourceid><addsrcrecordid>eNo9kMtqwzAQRUVpoWnaDyjdGLp2qpFkS16G9AkJXcTtVsjOOFGI7VSSC_n7KiR0NQNz7h04hNwDnQDQ4qmcTZ8njEI2YUIpoegFGUHBZSogg0syokyqlFJJr8mN91tKQWSsGJHlYtgF6-sNroYdJstDFzborU-a3iXfxlnThWRhOrPGFuNqu2Q6hL7tg_3FpLQtpqWz6zU6XMW0D9j6W3LVmJ3Hu_Mck6_Xl3L2ns4_3z5m03lac56HlCFymoHEnAlWoVCGsZorAYwLXqlcKRVvhhpVQS5ULgFMVddcNrWo1EryMXk89e5d_zOgD3rbD66LLzVIlRcFjw2RghNVu957h43eO9sad9BA9dGdPrrTR3f67C5mHk4Zi4j_vGSFyDPB_wCiwmpU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1786993887</pqid></control><display><type>article</type><title>Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Sagstetter, Florian ; Waszecki, Peter ; Steinhorst, Sebastian ; Lukasiewycz, Martin ; Chakraborty, Samarjit</creator><creatorcontrib>Sagstetter, Florian ; Waszecki, Peter ; Steinhorst, Sebastian ; Lukasiewycz, Martin ; Chakraborty, Samarjit</creatorcontrib><description>Car manufacturers provide a growing variety of models and configuration options for customers. In the highly competitive and cost-driven automotive industry, managing these variants and increasing the reuse of functionality in different variants has therefore become one of the key challenges. This paper addresses the problem of generating variant schedules for time-triggered electrical/electronic-architectures. We propose a multischedule synthesis approach that determines the common parts of multiple variants and generates a schedule that exploits this commonality. Hence, a multischedule defines individual variant schedules with an identical schedule for applications common to different variants. This makes these applications variant-independent, thus, reduces the testing and integration efforts as it only has to be done once. Multischedule synthesis involves several challenges, viz., identification of commonality between different variants, schedule synthesis for common parts, and the integration of uncommon parts. Consequently, the schedule synthesis approach presented here is very different from conventional approaches. Finally, to address the increased complexity, we also propose a divide-and-conquer approach to partition the problem, improving the scalability.</description><identifier>ISSN: 0278-0070</identifier><identifier>EISSN: 1937-4151</identifier><identifier>DOI: 10.1109/TCAD.2015.2488480</identifier><identifier>CODEN: ITCSDI</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>automotive ; Automotive engineering ; Computer architecture ; Distributed systems ; Industries ; Job shop scheduling ; schedule synthesis ; Schedules ; Testing ; variant management</subject><ispartof>IEEE transactions on computer-aided design of integrated circuits and systems, 2016-04, Vol.35 (4), p.637-650</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-2ee30517e6242be48a22c38412343b868887e6a0a8b16486711abcc37fc4b8d73</citedby><cites>FETCH-LOGICAL-c336t-2ee30517e6242be48a22c38412343b868887e6a0a8b16486711abcc37fc4b8d73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7294654$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27911,27912,54745</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7294654$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sagstetter, Florian</creatorcontrib><creatorcontrib>Waszecki, Peter</creatorcontrib><creatorcontrib>Steinhorst, Sebastian</creatorcontrib><creatorcontrib>Lukasiewycz, Martin</creatorcontrib><creatorcontrib>Chakraborty, Samarjit</creatorcontrib><title>Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems</title><title>IEEE transactions on computer-aided design of integrated circuits and systems</title><addtitle>TCAD</addtitle><description>Car manufacturers provide a growing variety of models and configuration options for customers. In the highly competitive and cost-driven automotive industry, managing these variants and increasing the reuse of functionality in different variants has therefore become one of the key challenges. This paper addresses the problem of generating variant schedules for time-triggered electrical/electronic-architectures. We propose a multischedule synthesis approach that determines the common parts of multiple variants and generates a schedule that exploits this commonality. Hence, a multischedule defines individual variant schedules with an identical schedule for applications common to different variants. This makes these applications variant-independent, thus, reduces the testing and integration efforts as it only has to be done once. Multischedule synthesis involves several challenges, viz., identification of commonality between different variants, schedule synthesis for common parts, and the integration of uncommon parts. Consequently, the schedule synthesis approach presented here is very different from conventional approaches. Finally, to address the increased complexity, we also propose a divide-and-conquer approach to partition the problem, improving the scalability.</description><subject>automotive</subject><subject>Automotive engineering</subject><subject>Computer architecture</subject><subject>Distributed systems</subject><subject>Industries</subject><subject>Job shop scheduling</subject><subject>schedule synthesis</subject><subject>Schedules</subject><subject>Testing</subject><subject>variant management</subject><issn>0278-0070</issn><issn>1937-4151</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtqwzAQRUVpoWnaDyjdGLp2qpFkS16G9AkJXcTtVsjOOFGI7VSSC_n7KiR0NQNz7h04hNwDnQDQ4qmcTZ8njEI2YUIpoegFGUHBZSogg0syokyqlFJJr8mN91tKQWSsGJHlYtgF6-sNroYdJstDFzborU-a3iXfxlnThWRhOrPGFuNqu2Q6hL7tg_3FpLQtpqWz6zU6XMW0D9j6W3LVmJ3Hu_Mck6_Xl3L2ns4_3z5m03lac56HlCFymoHEnAlWoVCGsZorAYwLXqlcKRVvhhpVQS5ULgFMVddcNrWo1EryMXk89e5d_zOgD3rbD66LLzVIlRcFjw2RghNVu957h43eO9sad9BA9dGdPrrTR3f67C5mHk4Zi4j_vGSFyDPB_wCiwmpU</recordid><startdate>201604</startdate><enddate>201604</enddate><creator>Sagstetter, Florian</creator><creator>Waszecki, Peter</creator><creator>Steinhorst, Sebastian</creator><creator>Lukasiewycz, Martin</creator><creator>Chakraborty, Samarjit</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201604</creationdate><title>Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems</title><author>Sagstetter, Florian ; Waszecki, Peter ; Steinhorst, Sebastian ; Lukasiewycz, Martin ; Chakraborty, Samarjit</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-2ee30517e6242be48a22c38412343b868887e6a0a8b16486711abcc37fc4b8d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>automotive</topic><topic>Automotive engineering</topic><topic>Computer architecture</topic><topic>Distributed systems</topic><topic>Industries</topic><topic>Job shop scheduling</topic><topic>schedule synthesis</topic><topic>Schedules</topic><topic>Testing</topic><topic>variant management</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sagstetter, Florian</creatorcontrib><creatorcontrib>Waszecki, Peter</creatorcontrib><creatorcontrib>Steinhorst, Sebastian</creatorcontrib><creatorcontrib>Lukasiewycz, Martin</creatorcontrib><creatorcontrib>Chakraborty, Samarjit</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sagstetter, Florian</au><au>Waszecki, Peter</au><au>Steinhorst, Sebastian</au><au>Lukasiewycz, Martin</au><au>Chakraborty, Samarjit</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems</atitle><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle><stitle>TCAD</stitle><date>2016-04</date><risdate>2016</risdate><volume>35</volume><issue>4</issue><spage>637</spage><epage>650</epage><pages>637-650</pages><issn>0278-0070</issn><eissn>1937-4151</eissn><coden>ITCSDI</coden><abstract>Car manufacturers provide a growing variety of models and configuration options for customers. In the highly competitive and cost-driven automotive industry, managing these variants and increasing the reuse of functionality in different variants has therefore become one of the key challenges. This paper addresses the problem of generating variant schedules for time-triggered electrical/electronic-architectures. We propose a multischedule synthesis approach that determines the common parts of multiple variants and generates a schedule that exploits this commonality. Hence, a multischedule defines individual variant schedules with an identical schedule for applications common to different variants. This makes these applications variant-independent, thus, reduces the testing and integration efforts as it only has to be done once. Multischedule synthesis involves several challenges, viz., identification of commonality between different variants, schedule synthesis for common parts, and the integration of uncommon parts. Consequently, the schedule synthesis approach presented here is very different from conventional approaches. Finally, to address the increased complexity, we also propose a divide-and-conquer approach to partition the problem, improving the scalability.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCAD.2015.2488480</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0278-0070
ispartof IEEE transactions on computer-aided design of integrated circuits and systems, 2016-04, Vol.35 (4), p.637-650
issn 0278-0070
1937-4151
language eng
recordid cdi_ieee_primary_7294654
source IEEE Electronic Library (IEL)
subjects automotive
Automotive engineering
Computer architecture
Distributed systems
Industries
Job shop scheduling
schedule synthesis
Schedules
Testing
variant management
title Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T19%3A55%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multischedule%20Synthesis%20for%20Variant%20Management%20in%20Automotive%20Time-Triggered%20Systems&rft.jtitle=IEEE%20transactions%20on%20computer-aided%20design%20of%20integrated%20circuits%20and%20systems&rft.au=Sagstetter,%20Florian&rft.date=2016-04&rft.volume=35&rft.issue=4&rft.spage=637&rft.epage=650&rft.pages=637-650&rft.issn=0278-0070&rft.eissn=1937-4151&rft.coden=ITCSDI&rft_id=info:doi/10.1109/TCAD.2015.2488480&rft_dat=%3Cproquest_RIE%3E4045933171%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1786993887&rft_id=info:pmid/&rft_ieee_id=7294654&rfr_iscdi=true