Compositional real-time scheduling framework for periodic reward-based task model
► The imprecise resource model is proposed to support the imprecise resource supply. ► An imprecise interface model to abstract the demand of components is provided. ► The schedulability is analyzed to guarantee mandatory parts under EDF and RM. ► The weakly schedulability of potentially non schedul...
Gespeichert in:
Veröffentlicht in: | The Journal of systems and software 2013-06, Vol.86 (6), p.1712-1724 |
---|---|
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 | 1724 |
---|---|
container_issue | 6 |
container_start_page | 1712 |
container_title | The Journal of systems and software |
container_volume | 86 |
creator | Tchamgoue, Guy Martin Kim, Kyong Hoon Jun, Yong-Kee Lee, Wan Yeon |
description | ► The imprecise resource model is proposed to support the imprecise resource supply. ► An imprecise interface model to abstract the demand of components is provided. ► The schedulability is analyzed to guarantee mandatory parts under EDF and RM. ► The weakly schedulability of potentially non schedulable components is introduced. ► A scheduling algorithm that guarantees a minimum reward to components is proposed.
As the size and complexity of embedded software systems increase, compositional real-time scheduling framework is widely accepted as means to build large and complex systems. A compositional real-time scheduling framework proposes to decompose a system into independent subsystems and provides ways to assemble them into a flexible hierarchical real-time scheduling system while guaranteeing the internal real-time requirements of each subsystem. In this paper, we consider the imprecise reward-based periodic task model in compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations provided by the system to a single component, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability of mandatory parts is also analyzed to meet the minimum requirement of tasks. Finally, we provide a scheduling algorithm to guarantee a certain amount of reward, which makes it feasible to efficiently compose multiple imprecise components. |
doi_str_mv | 10.1016/j.jss.2013.02.052 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1365155369</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0164121213000526</els_id><sourcerecordid>1365155369</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-1b5f4e691b6c704c3ac18d1f09e075d49f3cc5445495dd4dc4290f3ae1c6f72d3</originalsourceid><addsrcrecordid>eNp9kEtLxDAUhYMoOI7-AHcFN25a8-wDVzL4AkEEXYdMcqPptE1NWgf_vRnGlQtX9y6-c-B8CJ0TXBBMyqu2aGMsKCaswLTAgh6gBakrlhNK60O0SAxPP6HH6CTGFmNcUUwX6GXl-9FHNzk_qC4LoLp8cj1kUX-AmTs3vGc2qB62Pmwy60M2QnDeOJ3YrQomX6sIJptU3GS9N9CdoiOrughnv3eJ3u5uX1cP-dPz_ePq5inXTNRTTtbCcigbsi51hblmSpPaEIsbwJUwvLFMa8G54I0whhvNaYMtU0B0aStq2BJd7nvH4D9niJPsXdTQdWoAP0dJWCmIEKxsEnrxB239HNLeHcV4QytBcaLIntLBxxjAyjG4XoVvSbDcSZatTJLlTrLEVCbJKXO9z0Ba-uUgyKgdDBqMC6Anabz7J_0DzmWEvg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1334927520</pqid></control><display><type>article</type><title>Compositional real-time scheduling framework for periodic reward-based task model</title><source>Elsevier ScienceDirect Journals</source><creator>Tchamgoue, Guy Martin ; Kim, Kyong Hoon ; Jun, Yong-Kee ; Lee, Wan Yeon</creator><creatorcontrib>Tchamgoue, Guy Martin ; Kim, Kyong Hoon ; Jun, Yong-Kee ; Lee, Wan Yeon</creatorcontrib><description>► The imprecise resource model is proposed to support the imprecise resource supply. ► An imprecise interface model to abstract the demand of components is provided. ► The schedulability is analyzed to guarantee mandatory parts under EDF and RM. ► The weakly schedulability of potentially non schedulable components is introduced. ► A scheduling algorithm that guarantees a minimum reward to components is proposed.
As the size and complexity of embedded software systems increase, compositional real-time scheduling framework is widely accepted as means to build large and complex systems. A compositional real-time scheduling framework proposes to decompose a system into independent subsystems and provides ways to assemble them into a flexible hierarchical real-time scheduling system while guaranteeing the internal real-time requirements of each subsystem. In this paper, we consider the imprecise reward-based periodic task model in compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations provided by the system to a single component, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability of mandatory parts is also analyzed to meet the minimum requirement of tasks. Finally, we provide a scheduling algorithm to guarantee a certain amount of reward, which makes it feasible to efficiently compose multiple imprecise components.</description><identifier>ISSN: 0164-1212</identifier><identifier>EISSN: 1873-1228</identifier><identifier>DOI: 10.1016/j.jss.2013.02.052</identifier><identifier>CODEN: JSSODM</identifier><language>eng</language><publisher>New York: Elsevier Inc</publisher><subject>Complex systems ; Compositional and hierarchical real-time scheduling ; Computer programs ; Construction ; Embedded computer systems ; Embedded systems ; Imprecise computation ; Interface model ; Mathematical models ; Real time ; Resource allocation ; Resource model ; Reward function ; Scheduling ; Scheduling algorithms ; Software engineering ; Studies ; Tasks</subject><ispartof>The Journal of systems and software, 2013-06, Vol.86 (6), p.1712-1724</ispartof><rights>2013 Elsevier Inc.</rights><rights>Copyright Elsevier Sequoia S.A. Jun 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c358t-1b5f4e691b6c704c3ac18d1f09e075d49f3cc5445495dd4dc4290f3ae1c6f72d3</citedby><cites>FETCH-LOGICAL-c358t-1b5f4e691b6c704c3ac18d1f09e075d49f3cc5445495dd4dc4290f3ae1c6f72d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.jss.2013.02.052$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,777,781,3537,27905,27906,45976</link.rule.ids></links><search><creatorcontrib>Tchamgoue, Guy Martin</creatorcontrib><creatorcontrib>Kim, Kyong Hoon</creatorcontrib><creatorcontrib>Jun, Yong-Kee</creatorcontrib><creatorcontrib>Lee, Wan Yeon</creatorcontrib><title>Compositional real-time scheduling framework for periodic reward-based task model</title><title>The Journal of systems and software</title><description>► The imprecise resource model is proposed to support the imprecise resource supply. ► An imprecise interface model to abstract the demand of components is provided. ► The schedulability is analyzed to guarantee mandatory parts under EDF and RM. ► The weakly schedulability of potentially non schedulable components is introduced. ► A scheduling algorithm that guarantees a minimum reward to components is proposed.
As the size and complexity of embedded software systems increase, compositional real-time scheduling framework is widely accepted as means to build large and complex systems. A compositional real-time scheduling framework proposes to decompose a system into independent subsystems and provides ways to assemble them into a flexible hierarchical real-time scheduling system while guaranteeing the internal real-time requirements of each subsystem. In this paper, we consider the imprecise reward-based periodic task model in compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations provided by the system to a single component, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability of mandatory parts is also analyzed to meet the minimum requirement of tasks. Finally, we provide a scheduling algorithm to guarantee a certain amount of reward, which makes it feasible to efficiently compose multiple imprecise components.</description><subject>Complex systems</subject><subject>Compositional and hierarchical real-time scheduling</subject><subject>Computer programs</subject><subject>Construction</subject><subject>Embedded computer systems</subject><subject>Embedded systems</subject><subject>Imprecise computation</subject><subject>Interface model</subject><subject>Mathematical models</subject><subject>Real time</subject><subject>Resource allocation</subject><subject>Resource model</subject><subject>Reward function</subject><subject>Scheduling</subject><subject>Scheduling algorithms</subject><subject>Software engineering</subject><subject>Studies</subject><subject>Tasks</subject><issn>0164-1212</issn><issn>1873-1228</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAUhYMoOI7-AHcFN25a8-wDVzL4AkEEXYdMcqPptE1NWgf_vRnGlQtX9y6-c-B8CJ0TXBBMyqu2aGMsKCaswLTAgh6gBakrlhNK60O0SAxPP6HH6CTGFmNcUUwX6GXl-9FHNzk_qC4LoLp8cj1kUX-AmTs3vGc2qB62Pmwy60M2QnDeOJ3YrQomX6sIJptU3GS9N9CdoiOrughnv3eJ3u5uX1cP-dPz_ePq5inXTNRTTtbCcigbsi51hblmSpPaEIsbwJUwvLFMa8G54I0whhvNaYMtU0B0aStq2BJd7nvH4D9niJPsXdTQdWoAP0dJWCmIEKxsEnrxB239HNLeHcV4QytBcaLIntLBxxjAyjG4XoVvSbDcSZatTJLlTrLEVCbJKXO9z0Ba-uUgyKgdDBqMC6Anabz7J_0DzmWEvg</recordid><startdate>201306</startdate><enddate>201306</enddate><creator>Tchamgoue, Guy Martin</creator><creator>Kim, Kyong Hoon</creator><creator>Jun, Yong-Kee</creator><creator>Lee, Wan Yeon</creator><general>Elsevier Inc</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201306</creationdate><title>Compositional real-time scheduling framework for periodic reward-based task model</title><author>Tchamgoue, Guy Martin ; Kim, Kyong Hoon ; Jun, Yong-Kee ; Lee, Wan Yeon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-1b5f4e691b6c704c3ac18d1f09e075d49f3cc5445495dd4dc4290f3ae1c6f72d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Complex systems</topic><topic>Compositional and hierarchical real-time scheduling</topic><topic>Computer programs</topic><topic>Construction</topic><topic>Embedded computer systems</topic><topic>Embedded systems</topic><topic>Imprecise computation</topic><topic>Interface model</topic><topic>Mathematical models</topic><topic>Real time</topic><topic>Resource allocation</topic><topic>Resource model</topic><topic>Reward function</topic><topic>Scheduling</topic><topic>Scheduling algorithms</topic><topic>Software engineering</topic><topic>Studies</topic><topic>Tasks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tchamgoue, Guy Martin</creatorcontrib><creatorcontrib>Kim, Kyong Hoon</creatorcontrib><creatorcontrib>Jun, Yong-Kee</creatorcontrib><creatorcontrib>Lee, Wan Yeon</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems 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>The Journal of systems and software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tchamgoue, Guy Martin</au><au>Kim, Kyong Hoon</au><au>Jun, Yong-Kee</au><au>Lee, Wan Yeon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Compositional real-time scheduling framework for periodic reward-based task model</atitle><jtitle>The Journal of systems and software</jtitle><date>2013-06</date><risdate>2013</risdate><volume>86</volume><issue>6</issue><spage>1712</spage><epage>1724</epage><pages>1712-1724</pages><issn>0164-1212</issn><eissn>1873-1228</eissn><coden>JSSODM</coden><abstract>► The imprecise resource model is proposed to support the imprecise resource supply. ► An imprecise interface model to abstract the demand of components is provided. ► The schedulability is analyzed to guarantee mandatory parts under EDF and RM. ► The weakly schedulability of potentially non schedulable components is introduced. ► A scheduling algorithm that guarantees a minimum reward to components is proposed.
As the size and complexity of embedded software systems increase, compositional real-time scheduling framework is widely accepted as means to build large and complex systems. A compositional real-time scheduling framework proposes to decompose a system into independent subsystems and provides ways to assemble them into a flexible hierarchical real-time scheduling system while guaranteeing the internal real-time requirements of each subsystem. In this paper, we consider the imprecise reward-based periodic task model in compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations provided by the system to a single component, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability of mandatory parts is also analyzed to meet the minimum requirement of tasks. Finally, we provide a scheduling algorithm to guarantee a certain amount of reward, which makes it feasible to efficiently compose multiple imprecise components.</abstract><cop>New York</cop><pub>Elsevier Inc</pub><doi>10.1016/j.jss.2013.02.052</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0164-1212 |
ispartof | The Journal of systems and software, 2013-06, Vol.86 (6), p.1712-1724 |
issn | 0164-1212 1873-1228 |
language | eng |
recordid | cdi_proquest_miscellaneous_1365155369 |
source | Elsevier ScienceDirect Journals |
subjects | Complex systems Compositional and hierarchical real-time scheduling Computer programs Construction Embedded computer systems Embedded systems Imprecise computation Interface model Mathematical models Real time Resource allocation Resource model Reward function Scheduling Scheduling algorithms Software engineering Studies Tasks |
title | Compositional real-time scheduling framework for periodic reward-based task model |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T05%3A13%3A37IST&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=Compositional%20real-time%20scheduling%20framework%20for%20periodic%20reward-based%20task%20model&rft.jtitle=The%20Journal%20of%20systems%20and%20software&rft.au=Tchamgoue,%20Guy%20Martin&rft.date=2013-06&rft.volume=86&rft.issue=6&rft.spage=1712&rft.epage=1724&rft.pages=1712-1724&rft.issn=0164-1212&rft.eissn=1873-1228&rft.coden=JSSODM&rft_id=info:doi/10.1016/j.jss.2013.02.052&rft_dat=%3Cproquest_cross%3E1365155369%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1334927520&rft_id=info:pmid/&rft_els_id=S0164121213000526&rfr_iscdi=true |