An intuitive formal proof for deadline driven scheduler

DOI10.1007/BF02950419MaRDI QIDQ5945840zbMATH OpenFDO

Authors Naijun Zhan

Publication date 14 October 2001

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02950419

zbMATH Keywords

deadline driven schedulerduration calculus

Mathematics Subject Classification ID

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

Recommendations

• Formalising scheduling theories in duration calculus
• A formal proof of the deadline driven scheduler in PPTL axiomatic system
• Proof of OS scheduling behavior in the presence of interrupt-induced concurrency
• Proving fairness and implementation correctness of a microkernel scheduler
• Theorem proving guided development of formal assertions in a resource-constrained scheduler for high-level synthesis

Cites work

• A calculus of durations
• Duration calculus: Logical foundations
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(3)

• Formalising scheduling theories in duration calculus
• scientific article; zbMATH DE number 7362744 (Why is no real title available?)
• A formal proof of the deadline driven scheduler in PPTL axiomatic system

This page was built for publication: An intuitive formal proof for deadline driven scheduler

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