Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling

DOI10.1007/S11241-018-09325-5zbMATH Open1436.68060OpenAlexW2917461237WikidataQ128362830 ScholiaQ128362830MaRDI QIDQ779441FDOQ779441

D. Kharzeev

Publication date: 13 July 2020

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-018-09325-5

zbMATH Keywords

real-time systemsDAG schedulingmultiprocessor systemsparallel tasksresponse-time analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Measuring the performance of schedulability tests
• Multi-core real-time scheduling for generalized parallel task models
• Parallel recognition and decomposition of two terminal series parallel graphs
• Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War

This page was built for publication: Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779441)