An analysis of totally clairvoyant scheduling

DOI10.1007/S10951-005-6367-2MaRDI QIDQ2464437zbMATH OpenOpenAlexFDO

Authors K. Subramani

Publication date 20 December 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-005-6367-2

zbMATH Keywords

real-time systemsperformance metricsmutable dynamic programmingtotal clairvoyance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• An analysis of partially Clairvoyant scheduling
• Partially clairvoyant scheduling for aggregate constraints
• An empirical analysis of algorithms for partially Clairvoyant scheduling
• A polynomial time algorithm for Zero-Clairvoyant scheduling

Cites work

• 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 53318 (Why is no real title available?)
• scientific article; zbMATH DE number 3628660 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1196650 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• scientific article; zbMATH DE number 2080043 (Why is no real title available?)
• scientific article; zbMATH DE number 1798173 (Why is no real title available?)
• scientific article; zbMATH DE number 744095 (Why is no real title available?)
• Approximation algorithms for NP-hard problems.
• Fault-tolerant real-time scheduling
• Introduction to algorithms.
• Online algorithms. The state of the art
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parametric dispatching of hard real-time tasks

Cited in

(16)

• Partially clairvoyant scheduling for aggregate constraints
• Formal Modeling and Analysis of Timed Systems
• Verification, Model Checking, and Abstract Interpretation
• An analysis of partially Clairvoyant scheduling
• On memoryless provers and insincere verifiers
• On quantified linear implications
• Empirical analysis of algorithms for the shortest negative cost cycle problem
• Optimal length resolution refutations of difference constraint systems
• A polynomial time algorithm for Zero-Clairvoyant scheduling
• On the negative cost girth problem in planar networks
• Improved algorithms for optimal length resolution refutation in difference constraint systems
• scientific article; zbMATH DE number 2080043 (Why is no real title available?)
• A complexity perspective on entailment of parameterized linear constraints
• Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm
• On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
• An empirical analysis of algorithms for partially Clairvoyant scheduling

This page was built for publication: An analysis of totally clairvoyant scheduling

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