Loading…

Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines

The well-known model of Vestal aims to avoid excessive pessimism in the quantification of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size...

Full description

Saved in:
Bibliographic Details
Published in:Real-time systems 2021-04, Vol.57 (1-2), p.141-189
Main Authors: Hussain, Ishfaq, Awan, Muhammad Ali, Souto, Pedro F., Bletsas, Konstantinos, Akesson, Benny, Tovar, Eduardo
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253
cites cdi_FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253
container_end_page 189
container_issue 1-2
container_start_page 141
container_title Real-time systems
container_volume 57
creator Hussain, Ishfaq
Awan, Muhammad Ali
Souto, Pedro F.
Bletsas, Konstantinos
Akesson, Benny
Tovar, Eduardo
description The well-known model of Vestal aims to avoid excessive pessimism in the quantification of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size, weight and power constraints. This efficiency is promoted via the use of multiple worst-case execution time (WCET) estimates for the same task, with each such estimate characterized by a confidence associated with a different criticality level. However, even this approach can be very pessimistic when the WCET of successive instances of the same task can vary greatly according to a known pattern, as in MP3 and MPEG codecs or the processing of ADVB video streams. In this paper, we present a schedulability analysis for the new multiframe mixed-criticality model, which allows tasks to have multiple, periodically repeating, WCETs in the same mode of operation. Our work extends both the analysis techniques for Static Mixed-Criticality scheduling (SMC) and Adaptive Mixed-Criticality scheduling (AMC), on one hand, and the schedulability analysis for multiframe task systems on the other. A constrained-deadline model is initially targeted, and then extended to the more general, but also more complex, arbitrary-deadline scenario. The corresponding optimal priority assignment for our schedulability analysis is also identified. Our proposed worst-case response time (WCRT) analysis for multiframe mixed-criticality systems is considerably less pessimistic than applying the static and adaptive mixed-criticality scheduling tests oblivious to the WCET variation patterns. Experimental evaluation with synthetic task sets demonstrates up to 20% and 31.4% higher scheduling success ratio (in absolute terms) for constrained-deadline analyses and arbitrary-deadline analyses, respectively, when compared to the best of their corresponding frame-oblivious tests.
doi_str_mv 10.1007/s11241-020-09357-w
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2503359349</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2503359349</sourcerecordid><originalsourceid>FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253</originalsourceid><addsrcrecordid>eNp9kEtLBDEQhIMouK7-AU8Bz9E8Z3aOsviCBUEUjyE709Es81jTWdb590ZH8Oapm6aq6PoIORf8UnBeXqEQUgvGJWe8UqZk-wMyE6ZUTKiFOiQzXknJCq3VMTlB3HDOjSirGXl9AtwOPQJNoQPqeteOGJAOnna7NgUfXT534RMaVseQQu3akEaKIybokO5DeqcurkOKLo60Ade0oQc8JUfetQhnv3NOXm5vnpf3bPV497C8XrFa6UVi4MumqLmoRGWUdEIYL_R6rZ1seP190D63yZvWdZZAWTgoneegi2YB0qg5uZhyt3H42AEmuxl2MbdAKw1XylRKV1klJ1UdB8QI3m5j6PLDVnD7DdBOAG0GaH8A2n02qcmEWdy_QfyL_sf1BVP-dSw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2503359349</pqid></control><display><type>article</type><title>Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines</title><source>Springer Link</source><creator>Hussain, Ishfaq ; Awan, Muhammad Ali ; Souto, Pedro F. ; Bletsas, Konstantinos ; Akesson, Benny ; Tovar, Eduardo</creator><creatorcontrib>Hussain, Ishfaq ; Awan, Muhammad Ali ; Souto, Pedro F. ; Bletsas, Konstantinos ; Akesson, Benny ; Tovar, Eduardo</creatorcontrib><description>The well-known model of Vestal aims to avoid excessive pessimism in the quantification of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size, weight and power constraints. This efficiency is promoted via the use of multiple worst-case execution time (WCET) estimates for the same task, with each such estimate characterized by a confidence associated with a different criticality level. However, even this approach can be very pessimistic when the WCET of successive instances of the same task can vary greatly according to a known pattern, as in MP3 and MPEG codecs or the processing of ADVB video streams. In this paper, we present a schedulability analysis for the new multiframe mixed-criticality model, which allows tasks to have multiple, periodically repeating, WCETs in the same mode of operation. Our work extends both the analysis techniques for Static Mixed-Criticality scheduling (SMC) and Adaptive Mixed-Criticality scheduling (AMC), on one hand, and the schedulability analysis for multiframe task systems on the other. A constrained-deadline model is initially targeted, and then extended to the more general, but also more complex, arbitrary-deadline scenario. The corresponding optimal priority assignment for our schedulability analysis is also identified. Our proposed worst-case response time (WCRT) analysis for multiframe mixed-criticality systems is considerably less pessimistic than applying the static and adaptive mixed-criticality scheduling tests oblivious to the WCET variation patterns. Experimental evaluation with synthetic task sets demonstrates up to 20% and 31.4% higher scheduling success ratio (in absolute terms) for constrained-deadline analyses and arbitrary-deadline analyses, respectively, when compared to the best of their corresponding frame-oblivious tests.</description><identifier>ISSN: 0922-6443</identifier><identifier>EISSN: 1573-1383</identifier><identifier>DOI: 10.1007/s11241-020-09357-w</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Adaptive systems ; Codec ; Communications Engineering ; Computer Science ; Computer Systems Organization and Communication Networks ; Constraints ; Control ; Deadlines ; Mechatronics ; Networks ; Performance and Reliability ; Pessimism ; Response time ; Robotics ; Scheduling ; Special Purpose and Application-Based Systems ; Task scheduling ; Video compression ; Video data</subject><ispartof>Real-time systems, 2021-04, Vol.57 (1-2), p.141-189</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253</citedby><cites>FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253</cites><orcidid>0000-0002-4470-1744</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Hussain, Ishfaq</creatorcontrib><creatorcontrib>Awan, Muhammad Ali</creatorcontrib><creatorcontrib>Souto, Pedro F.</creatorcontrib><creatorcontrib>Bletsas, Konstantinos</creatorcontrib><creatorcontrib>Akesson, Benny</creatorcontrib><creatorcontrib>Tovar, Eduardo</creatorcontrib><title>Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines</title><title>Real-time systems</title><addtitle>Real-Time Syst</addtitle><description>The well-known model of Vestal aims to avoid excessive pessimism in the quantification of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size, weight and power constraints. This efficiency is promoted via the use of multiple worst-case execution time (WCET) estimates for the same task, with each such estimate characterized by a confidence associated with a different criticality level. However, even this approach can be very pessimistic when the WCET of successive instances of the same task can vary greatly according to a known pattern, as in MP3 and MPEG codecs or the processing of ADVB video streams. In this paper, we present a schedulability analysis for the new multiframe mixed-criticality model, which allows tasks to have multiple, periodically repeating, WCETs in the same mode of operation. Our work extends both the analysis techniques for Static Mixed-Criticality scheduling (SMC) and Adaptive Mixed-Criticality scheduling (AMC), on one hand, and the schedulability analysis for multiframe task systems on the other. A constrained-deadline model is initially targeted, and then extended to the more general, but also more complex, arbitrary-deadline scenario. The corresponding optimal priority assignment for our schedulability analysis is also identified. Our proposed worst-case response time (WCRT) analysis for multiframe mixed-criticality systems is considerably less pessimistic than applying the static and adaptive mixed-criticality scheduling tests oblivious to the WCET variation patterns. Experimental evaluation with synthetic task sets demonstrates up to 20% and 31.4% higher scheduling success ratio (in absolute terms) for constrained-deadline analyses and arbitrary-deadline analyses, respectively, when compared to the best of their corresponding frame-oblivious tests.</description><subject>Adaptive systems</subject><subject>Codec</subject><subject>Communications Engineering</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Constraints</subject><subject>Control</subject><subject>Deadlines</subject><subject>Mechatronics</subject><subject>Networks</subject><subject>Performance and Reliability</subject><subject>Pessimism</subject><subject>Response time</subject><subject>Robotics</subject><subject>Scheduling</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Task scheduling</subject><subject>Video compression</subject><subject>Video data</subject><issn>0922-6443</issn><issn>1573-1383</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLBDEQhIMouK7-AU8Bz9E8Z3aOsviCBUEUjyE709Es81jTWdb590ZH8Oapm6aq6PoIORf8UnBeXqEQUgvGJWe8UqZk-wMyE6ZUTKiFOiQzXknJCq3VMTlB3HDOjSirGXl9AtwOPQJNoQPqeteOGJAOnna7NgUfXT534RMaVseQQu3akEaKIybokO5DeqcurkOKLo60Ade0oQc8JUfetQhnv3NOXm5vnpf3bPV497C8XrFa6UVi4MumqLmoRGWUdEIYL_R6rZ1seP190D63yZvWdZZAWTgoneegi2YB0qg5uZhyt3H42AEmuxl2MbdAKw1XylRKV1klJ1UdB8QI3m5j6PLDVnD7DdBOAG0GaH8A2n02qcmEWdy_QfyL_sf1BVP-dSw</recordid><startdate>20210401</startdate><enddate>20210401</enddate><creator>Hussain, Ishfaq</creator><creator>Awan, Muhammad Ali</creator><creator>Souto, Pedro F.</creator><creator>Bletsas, Konstantinos</creator><creator>Akesson, Benny</creator><creator>Tovar, Eduardo</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><orcidid>https://orcid.org/0000-0002-4470-1744</orcidid></search><sort><creationdate>20210401</creationdate><title>Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines</title><author>Hussain, Ishfaq ; Awan, Muhammad Ali ; Souto, Pedro F. ; Bletsas, Konstantinos ; Akesson, Benny ; Tovar, Eduardo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Adaptive systems</topic><topic>Codec</topic><topic>Communications Engineering</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Constraints</topic><topic>Control</topic><topic>Deadlines</topic><topic>Mechatronics</topic><topic>Networks</topic><topic>Performance and Reliability</topic><topic>Pessimism</topic><topic>Response time</topic><topic>Robotics</topic><topic>Scheduling</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Task scheduling</topic><topic>Video compression</topic><topic>Video data</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hussain, Ishfaq</creatorcontrib><creatorcontrib>Awan, Muhammad Ali</creatorcontrib><creatorcontrib>Souto, Pedro F.</creatorcontrib><creatorcontrib>Bletsas, Konstantinos</creatorcontrib><creatorcontrib>Akesson, Benny</creatorcontrib><creatorcontrib>Tovar, Eduardo</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; 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>ProQuest Central China</collection><jtitle>Real-time systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hussain, Ishfaq</au><au>Awan, Muhammad Ali</au><au>Souto, Pedro F.</au><au>Bletsas, Konstantinos</au><au>Akesson, Benny</au><au>Tovar, Eduardo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines</atitle><jtitle>Real-time systems</jtitle><stitle>Real-Time Syst</stitle><date>2021-04-01</date><risdate>2021</risdate><volume>57</volume><issue>1-2</issue><spage>141</spage><epage>189</epage><pages>141-189</pages><issn>0922-6443</issn><eissn>1573-1383</eissn><abstract>The well-known model of Vestal aims to avoid excessive pessimism in the quantification of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size, weight and power constraints. This efficiency is promoted via the use of multiple worst-case execution time (WCET) estimates for the same task, with each such estimate characterized by a confidence associated with a different criticality level. However, even this approach can be very pessimistic when the WCET of successive instances of the same task can vary greatly according to a known pattern, as in MP3 and MPEG codecs or the processing of ADVB video streams. In this paper, we present a schedulability analysis for the new multiframe mixed-criticality model, which allows tasks to have multiple, periodically repeating, WCETs in the same mode of operation. Our work extends both the analysis techniques for Static Mixed-Criticality scheduling (SMC) and Adaptive Mixed-Criticality scheduling (AMC), on one hand, and the schedulability analysis for multiframe task systems on the other. A constrained-deadline model is initially targeted, and then extended to the more general, but also more complex, arbitrary-deadline scenario. The corresponding optimal priority assignment for our schedulability analysis is also identified. Our proposed worst-case response time (WCRT) analysis for multiframe mixed-criticality systems is considerably less pessimistic than applying the static and adaptive mixed-criticality scheduling tests oblivious to the WCET variation patterns. Experimental evaluation with synthetic task sets demonstrates up to 20% and 31.4% higher scheduling success ratio (in absolute terms) for constrained-deadline analyses and arbitrary-deadline analyses, respectively, when compared to the best of their corresponding frame-oblivious tests.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11241-020-09357-w</doi><tpages>49</tpages><orcidid>https://orcid.org/0000-0002-4470-1744</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0922-6443
ispartof Real-time systems, 2021-04, Vol.57 (1-2), p.141-189
issn 0922-6443
1573-1383
language eng
recordid cdi_proquest_journals_2503359349
source Springer Link
subjects Adaptive systems
Codec
Communications Engineering
Computer Science
Computer Systems Organization and Communication Networks
Constraints
Control
Deadlines
Mechatronics
Networks
Performance and Reliability
Pessimism
Response time
Robotics
Scheduling
Special Purpose and Application-Based Systems
Task scheduling
Video compression
Video data
title Response time analysis of multiframe mixed-criticality systems with arbitrary deadlines
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T04%3A14%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Response%20time%20analysis%20of%20multiframe%20mixed-criticality%20systems%20with%20arbitrary%20deadlines&rft.jtitle=Real-time%20systems&rft.au=Hussain,%20Ishfaq&rft.date=2021-04-01&rft.volume=57&rft.issue=1-2&rft.spage=141&rft.epage=189&rft.pages=141-189&rft.issn=0922-6443&rft.eissn=1573-1383&rft_id=info:doi/10.1007/s11241-020-09357-w&rft_dat=%3Cproquest_cross%3E2503359349%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c348t-ef7d6c01919532a115f14bb4a2d0c32a14f357c3244c195e76ae7af0e46d8e253%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2503359349&rft_id=info:pmid/&rfr_iscdi=true