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

DOI10.1007/s11241-018-09325-5zbMath1436.68060OpenAlexW2917461237WikidataQ128362830 ScholiaQ128362830MaRDI QIDQ779441

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 systemsmultiprocessor systemsDAG schedulingparallel 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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Measuring the performance of schedulability tests
• Parallel recognition and decomposition of two terminal series parallel graphs
• Multi-core real-time scheduling for generalized parallel task models
• Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems

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