Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay

In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-cas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Schmidt, Klaus, Schmidt, Ece G
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 5
container_issue
container_start_page 1
container_title
container_volume
creator Schmidt, Klaus
Schmidt, Ece G
description In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.
doi_str_mv 10.1109/VETECF.2010.5594414
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5594414</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5594414</ieee_id><sourcerecordid>5594414</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-61fd5bc61b1f149a4a14ace6d0efd3810ecbf9b9a975bd24a4fb00b636ef84743</originalsourceid><addsrcrecordid>eNpFkM1OAjEUhetfIqBPwKYvMNg7ve3QJRlBTTAmgm5ckHbmFmrmh9Ahcd5eEklcneSc75zFYWwMYgIgzMPnfD3PF5NUnAylDCLgBRsCpohSZWgu2SBVWZakqNXVfyDFNRuc-iKRQk5v2TDGbyEEgE4H7GtV7Kg8VtaFKnQ9nzW26mOI3DYlf6UY7Zb4mSGet_X-2NkutA337YF3O-KPfWPrUPAVbWtqOt56vqjo5932d-zG2yrS_VlH7GMxX-fPyfLt6SWfLZMAmeoSDb5UrtDgwAMaixbQFqRLQb6UUxBUOG-csSZTrkzRondCOC01-SlmKEds_LcbiGizP4TaHvrN-SH5C3XGV_s</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Schmidt, Klaus ; Schmidt, Ece G</creator><creatorcontrib>Schmidt, Klaus ; Schmidt, Ece G</creatorcontrib><description>In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.</description><identifier>ISSN: 1090-3038</identifier><identifier>ISBN: 1424435730</identifier><identifier>ISBN: 9781424435739</identifier><identifier>EISSN: 2577-2465</identifier><identifier>EISBN: 1424435749</identifier><identifier>EISBN: 9781424435746</identifier><identifier>DOI: 10.1109/VETECF.2010.5594414</identifier><language>eng</language><publisher>IEEE</publisher><subject>Delay ; Dynamic scheduling ; Heuristic algorithms ; Protocols ; Real time systems ; Schedules ; Vehicle dynamics</subject><ispartof>2010 IEEE 72nd Vehicular Technology Conference - Fall, 2010, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5594414$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5594414$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Schmidt, Klaus</creatorcontrib><creatorcontrib>Schmidt, Ece G</creatorcontrib><title>Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay</title><title>2010 IEEE 72nd Vehicular Technology Conference - Fall</title><addtitle>VETECF</addtitle><description>In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.</description><subject>Delay</subject><subject>Dynamic scheduling</subject><subject>Heuristic algorithms</subject><subject>Protocols</subject><subject>Real time systems</subject><subject>Schedules</subject><subject>Vehicle dynamics</subject><issn>1090-3038</issn><issn>2577-2465</issn><isbn>1424435730</isbn><isbn>9781424435739</isbn><isbn>1424435749</isbn><isbn>9781424435746</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkM1OAjEUhetfIqBPwKYvMNg7ve3QJRlBTTAmgm5ckHbmFmrmh9Ahcd5eEklcneSc75zFYWwMYgIgzMPnfD3PF5NUnAylDCLgBRsCpohSZWgu2SBVWZakqNXVfyDFNRuc-iKRQk5v2TDGbyEEgE4H7GtV7Kg8VtaFKnQ9nzW26mOI3DYlf6UY7Zb4mSGet_X-2NkutA337YF3O-KPfWPrUPAVbWtqOt56vqjo5932d-zG2yrS_VlH7GMxX-fPyfLt6SWfLZMAmeoSDb5UrtDgwAMaixbQFqRLQb6UUxBUOG-csSZTrkzRondCOC01-SlmKEds_LcbiGizP4TaHvrN-SH5C3XGV_s</recordid><startdate>201009</startdate><enddate>201009</enddate><creator>Schmidt, Klaus</creator><creator>Schmidt, Ece G</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201009</creationdate><title>Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay</title><author>Schmidt, Klaus ; Schmidt, Ece G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-61fd5bc61b1f149a4a14ace6d0efd3810ecbf9b9a975bd24a4fb00b636ef84743</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Delay</topic><topic>Dynamic scheduling</topic><topic>Heuristic algorithms</topic><topic>Protocols</topic><topic>Real time systems</topic><topic>Schedules</topic><topic>Vehicle dynamics</topic><toplevel>online_resources</toplevel><creatorcontrib>Schmidt, Klaus</creatorcontrib><creatorcontrib>Schmidt, Ece G</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schmidt, Klaus</au><au>Schmidt, Ece G</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay</atitle><btitle>2010 IEEE 72nd Vehicular Technology Conference - Fall</btitle><stitle>VETECF</stitle><date>2010-09</date><risdate>2010</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>1090-3038</issn><eissn>2577-2465</eissn><isbn>1424435730</isbn><isbn>9781424435739</isbn><eisbn>1424435749</eisbn><eisbn>9781424435746</eisbn><abstract>In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.</abstract><pub>IEEE</pub><doi>10.1109/VETECF.2010.5594414</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1090-3038
ispartof 2010 IEEE 72nd Vehicular Technology Conference - Fall, 2010, p.1-5
issn 1090-3038
2577-2465
language eng
recordid cdi_ieee_primary_5594414
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Delay
Dynamic scheduling
Heuristic algorithms
Protocols
Real time systems
Schedules
Vehicle dynamics
title Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T15%3A02%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Schedulability%20Analysis%20and%20Message%20Schedule%20Computation%20for%20the%20Dynamic%20Segment%20of%20FlexRay&rft.btitle=2010%20IEEE%2072nd%20Vehicular%20Technology%20Conference%20-%20Fall&rft.au=Schmidt,%20Klaus&rft.date=2010-09&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=1090-3038&rft.eissn=2577-2465&rft.isbn=1424435730&rft.isbn_list=9781424435739&rft_id=info:doi/10.1109/VETECF.2010.5594414&rft_dat=%3Cieee_6IE%3E5594414%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424435749&rft.eisbn_list=9781424435746&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5594414&rfr_iscdi=true