Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems

DOI10.1109/TC.2016.2584064MaRDI QIDQ2989519zbMATH OpenOpenAlexFDO

Authors Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Giorgio C. Buttazzo, Alberto Marchetti-Spaccamela

Publication date 8 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2016.2584064

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cited in

(6)

• scientific article; zbMATH DE number 969979 (Why is no real title available?)
• Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
• scientific article; zbMATH DE number 1756650 (Why is no real title available?)
• Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
• May-Happen-in-Parallel Analysis for Priority-Based Scheduling
• Parallel execution of schedules with random dependency graph

This page was built for publication: Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems

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