Performance evaluation of schedulers in a probabilistic setting

DOI10.1007/978-3-642-24310-3_1MaRDI QIDQ3172839zbMATH OpenOpenAlexFDO

Authors Jean-Francois Kempf, Marius Bozga, Oded Maler

Publication date 7 October 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-24310-3_1

Mathematics Subject Classification ID

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

Recommendations

• As soon as probable: optimal scheduling under stochastic uncertainty
• scientific article; zbMATH DE number 1956584
• scientific article; zbMATH DE number 96059
• Probabilistic Bounds on the Performance of List Scheduling
• Probabilistic single processor scheduling

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 1786474 (Why is no real title available?)
• scientific article; zbMATH DE number 1905116 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• A partial order semantics approach to the clock explosion problem of timed automata
• A theory of timed automata
• Calculating Probabilities of Real-Time Test Cases
• Hybrid Systems: Computation and Control
• Introduction to Discrete Event Systems
• On Interleaving in Timed Automata
• Partial order path technique for checking parallel timed automata
• Scheduling with timed automata
• Symbolic Analysis for GSMP Models with One Stateful Clock
• Symbolic model checking for real-time systems
• Timed regular expressions
• Unfoldings: A partial-order approach to model checking.
• Uppaal in a nutshell

Cited in

(7)

• Space-efficient scheduling of stochastically generated tasks
• Decoupled fitness criteria for reactive systems
• Space-efficient scheduling of stochastically generated tasks
• A probabilistic analysis of multiprocessor list scheduling: the erlang case
• As soon as probable: optimal scheduling under stochastic uncertainty
• Measuring the performance of schedulability tests
• scientific article; zbMATH DE number 1956584 (Why is no real title available?)

Describes a project that uses

Uses Software

• Kronos
• IF-2.0
• Uppaal
• UMDES

This page was built for publication: Performance evaluation of schedulers in a probabilistic setting

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