License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ECRTS.2019.21
URN: urn:nbn:de:0030-drops-107587
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10758/
Go to the corresponding LIPIcs Volume Portal

Nasri, Mitra ; Nelissen, Geoffrey ; Brandenburg, Björn B.

Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling

pdf-format:
LIPIcs-ECRTS-2019-21.pdf (2 MB)

Abstract

Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks) that must be (repeatedly) executed in a specific order. This paper provides a schedulability analysis for such systems modeled as a set of parallel DAG tasks executed under any limited-preemptive global job-level fixed priority scheduling policy. More precisely, we derive response-time bounds for a set of jobs subject to precedence constraints, release jitter, and execution-time uncertainty, which enables support for a wide variety of parallel, limited-preemptive execution models (e.g., periodic DAG tasks, transactional tasks, generalized multi-frame tasks, etc.). Our analysis explores the space of all possible schedules using a powerful new state abstraction and state-pruning technique. An empirical evaluation shows the analysis to identify between 10 to 90 percentage points more schedulable task sets than the state-of-the-art schedulability test for limited-preemptive sporadic DAG tasks. It scales to systems of up to 64 cores with 20 DAG tasks. Moreover, while our analysis is almost as accurate as the state-of-the-art exact schedulability test based on model checking (for sequential non-preemptive tasks), it is three orders of magnitude faster and hence capable of analyzing task sets with more than 60 tasks on 8 cores in a few seconds.

BibTeX - Entry

@InProceedings{nasri_et_al:LIPIcs:2019:10758,
  author =	{Mitra Nasri and Geoffrey Nelissen and Bj{\"o}rn B. Brandenburg},
  title =	{{Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling}},
  booktitle =	{31st Euromicro Conference on Real-Time Systems (ECRTS 2019)},
  pages =	{21:1--21:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-110-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{133},
  editor =	{Sophie Quinton},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10758},
  URN =		{urn:nbn:de:0030-drops-107587},
  doi =		{10.4230/LIPIcs.ECRTS.2019.21},
  annote =	{Keywords: parallel DAG tasks, global multiprocessor scheduling, schedulability analysis, non-preemptive jobs, precedence constraints, worst-case response time,}
}

Keywords: parallel DAG tasks, global multiprocessor scheduling, schedulability analysis, non-preemptive jobs, precedence constraints, worst-case response time,
Collection: 31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
Issue Date: 2019
Date of publication: 02.07.2019
Supplementary Material: The source code of the analysis tool is available at https://github.com/brandenburg/np-schedulability-analysis.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI