Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times

DOI10.1007/978-3-540-75454-1_20MaRDI QIDQ3510849zbMATH OpenOpenAlexFDO

Authors Pavel Krčál, Martin Stigge, Wang Yi

Publication date 3 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75454-1_20

Mathematics Subject Classification ID

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

Recommendations

• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Composition of Schedulability Analyses for Real-Time Multiprocessor Systems
• scientific article; zbMATH DE number 4215346
• Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
• scientific article; zbMATH DE number 2147037
• Multiprocessor scheduling for real-time systems

Cited in

(5)

• An analysis method for variable execution time tasks based on histograms
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• A survey of timed automata for the development of real-time systems
• scientific article; zbMATH DE number 2080042 (Why is no real title available?)
• Reachability for updatable timed automata made faster and more effective

This page was built for publication: Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times

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