Parametric dispatching of hard real-time tasks

DOI10.1109/12.372041MaRDI QIDQ4419674zbMATH OpenOpenAlexFDO

Authors Richard Gerber, William Pugh, Manas Saksena

Publication date 15 October 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0f76c4b6e01617896c9ce0f625c0c8319fbe5c94

zbMATH Keywords

real-timevariable eliminationtiming constraints

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080869
• scientific article; zbMATH DE number 1696503
• Parametric timing analysis for real-time systems
• scientific article; zbMATH DE number 4199942
• scientific article; zbMATH DE number 1497768

Cited in

(24)

• Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
• Towards an algorithmic synthesis of thermofluid systems
• On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
• scientific article; zbMATH DE number 1696503 (Why is no real title available?)
• Multistage robust discrete optimization via quantified integer programming
• Randomized algorithms for finding the shortest negative cost cycle in networks
• Analyzing unit read-once refutations in difference constraint systems
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
• Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
• Pre-scheduling
• Unit read-once refutations for systems of difference constraints
• On integer closure in a system of unit two variable per inequality constraints
• An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
• Periodic real-time scheduling: From deadline-based model to latency-based model
• On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
• scientific article; zbMATH DE number 2080869 (Why is no real title available?)
• Out of order quantifier elimination for standard quantified linear programs
• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
• Analyzing restricted fragments of the theory of linear arithmetic
• A polynomial time algorithm for Zero-Clairvoyant scheduling
• An analysis of totally clairvoyant scheduling
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• On a decision procedure for quantified linear programs
• A certifying algorithm for lattice point feasibility in a system of UTVPI constraints

This page was built for publication: Parametric dispatching of hard real-time tasks

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