Delay-bounded scheduling

DOI10.1145/1926385.1926432MaRDI QIDQ5408560zbMATH OpenOpenAlexWikidataFDO

Authors Michael Emmi, Zvonimir Rakamarić, Shaz Qadeer

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926432

zbMATH Keywords

asynchronous programsconcurrencydelaysequentialization

Mathematics Subject Classification ID

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

Recommendations

• Delay-bounded scheduling without delay!
• Schedulers are no prophets
• Concurrent Probabilistic Programs, Or: How to Schedule If You Must
• scientific article; zbMATH DE number 3901999
• Hitting Families of Schedules for Asynchronous Programs

Cited in

(13)

• Reachability of scope-bounded multistack pushdown systems
• The decidability of verification under PS 2.0
• DESH: Overhead reduction algorithms for deferrable scheduling
• Verifying robustness of event-driven asynchronous programs against concurrency
• SAT-Based Model Checking
• Budget-bounded model-checking pushdown systems
• Bounded context switching for valence systems
• Verification of timed asynchronous programs
• Verification of asynchronous programs with nested locks
• Scheduling with tails and deadlines
• A pragmatic approach to stateful partial order reduction
• Automatic analysis of DMA races using model checking and k-induction
• Delay-bounded scheduling without delay!

This page was built for publication: Delay-bounded scheduling

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