uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF
Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Liaoning, Peoples R China;Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Liaoning, Peoples R China.
Show others and affiliations
2018 (English)In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, ISSN 0278-0070, E-ISSN 1937-4151, Vol. 37, no 11, p. 2200-2211Article in journal (Refereed) Published
Abstract [en]

Capacity augmentation bound is a widely used quantitative metric in theoretical studies of schedulability analysis for directed acyclic graph (DAG) parallel real-time tasks, which not only quantifies the suboptimality of the scheduling algorithms, but also serves as a simple linear-time schedulability test. Earlier studies on capacity augmentation bounds of the sporadic DAG task model were either restricted to a single DAG task or a set of tasks with implicit deadlines. In this paper, we consider parallel tasks with constrained deadlines under global earliest deadline first policy. We first show that it is impossible to obtain a constant bound for our problem setting, and derive both lower and upper bounds of the capacity augmentation bound as a function with respect to the maximum ratio of task period to deadline. Our upper bound is at most 1.47 times larger than the optimal one. We conduct experiments to compare the acceptance ratio of our capacity augmentation bound with the existing schedulability test also having linear-time complexity. The results show that our capacity augmentation bound significantly outperforms the existing linear-time schedulability test under different parameter settings.

Place, publisher, year, edition, pages
2018. Vol. 37, no 11, p. 2200-2211
Keywords [en]
Capacity augmentation bound, directed acyclic graph (DAG), global earliest deadline first (GEDF), parallel tasks, real-time scheduling, schedulability analysis
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-370013DOI: 10.1109/TCAD.2018.2857362ISI: 000447854500003OAI: oai:DiVA.org:uu-370013DiVA, id: diva2:1275695
Conference
Embedded Syst Week (ESWEEK) / Int Conf on Compilers, Architecture, and Synthesis for Embedded Syst (CASES) / Int Conf on Hardware/Software Codesign and Syst Synthesis (CODES+ISSS) / ACM SIGBED Int Conf on Embedded Software (EMSOFT), MAR 27-APR 03, 2018, Torino, ITALY
Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-01-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Wang, Yi

Search in DiVA

By author/editor
Guo, ZhishanWang, Yi
By organisation
Computer Systems
In the same journal
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf