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
The fork-join real-time task model
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Embedded Systems)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Embedded Systems)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Embedded Systems)
2013 (English)In: ACM SIGBED Review, ISSN 1551-3688, Vol. 10, no 2, 20-20 p.Article in journal, Meeting abstract (Refereed) Published
Abstract [en]

Hard real-time task models have evolved from periodic models to more sophisticated graph-based ones like the Digraph Real-Time Task Model (DRT) [1]. These models have in common that tasks are sequential in nature and do not allow for forking structures, modeling job releases that occur in parallel within the same task. To capture these, we present a task model that extends the DRT model with the possibility of forking and joining release paths. We are developing an exact schedulability test for EDF on uniprocessor systems with a pseudo-polynomial bound of its runtime.

Place, publisher, year, edition, pages
2013. Vol. 10, no 2, 20-20 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-213295DOI: 10.1145/2518148.2518158OAI: oai:DiVA.org:uu-213295DiVA: diva2:681552
Conference
Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12), December 5-7, 2012, San Juan, Puerto Rico
Projects
UPMARC
Available from: 2013-12-20 Created: 2013-12-20 Last updated: 2014-04-29Bibliographically approved

Open Access in DiVA

fulltext(1268 kB)150 downloads
File information
File name FULLTEXT01.pdfFile size 1268 kBChecksum SHA-512
9cbe82a38a137831500800e9e382f30e759f97f6db1e13c5e8db5e53326831b32a7357cd9337d58f92f39433d5d5dbe6d416785e0d668254609cdf22f3290a7d
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Stigge, MartinEkberg, PontusYi, Wang

Search in DiVA

By author/editor
Stigge, MartinEkberg, PontusYi, Wang
By organisation
Computer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 150 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 418 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