A polynomial time algorithm for Zero-Clairvoyant scheduling

DOI10.1016/J.JAL.2006.08.001MaRDI QIDQ2475435zbMATH OpenOpenAlexFDO

Authors K. Subramani

Publication date 11 March 2008

Published in Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jal.2006.08.001

zbMATH Keywords

dispatchingfault-tolerancepolytopereal-time scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2080043
• An analysis of totally clairvoyant scheduling
• Verification, Model Checking, and Abstract Interpretation
• An analysis of partially Clairvoyant scheduling
• On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers

Cites work

• scientific article; zbMATH DE number 429516 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 1196090 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• scientific article; zbMATH DE number 1393135 (Why is no real title available?)
• Parametric dispatching of hard real-time tasks
• Scheduling real-time computations with separation constraints
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Temporal constraint networks

Cited in

(7)

• An analysis of partially Clairvoyant scheduling
• An analysis of totally clairvoyant scheduling
• scientific article; zbMATH DE number 2080043 (Why is no real title available?)
• An empirical analysis of algorithms for partially Clairvoyant scheduling
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Formal Modeling and Analysis of Timed Systems
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: A polynomial time algorithm for Zero-Clairvoyant scheduling

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