Parametric dispatching of hard real-time tasks
From MaRDI portal
Publication:4419674
DOI10.1109/12.372041zbMath1062.68543OpenAlexW2098764081MaRDI QIDQ4419674
Manas Saksena, William Pugh, Richard Gerber
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
Theory of programming languages (68N15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (21)
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Towards an algorithmic synthesis of thermofluid systems ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints ⋮ Randomized algorithms for finding the shortest negative cost cycle in networks ⋮ Unit read-once refutations for systems of difference constraints ⋮ A certifying algorithm for lattice point feasibility in a system of UTVPI constraints ⋮ Out of order quantifier elimination for standard quantified linear programs ⋮ 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 ⋮ On a decision procedure for quantified linear programs ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ An analysis of totally clairvoyant scheduling ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ A polynomial time algorithm for Zero-Clairvoyant scheduling ⋮ A combinatorial certifying algorithm for linear feasibility in UTVPI 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 ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ Analyzing unit read-once refutations in difference constraint systems ⋮ Pre-scheduling
This page was built for publication: Parametric dispatching of hard real-time tasks
