Scheduling Periodic Tasks in a Hard Real-Time Environment

DOI10.1007/978-3-642-14165-2_26zbMath1288.90026OpenAlexW1798684815MaRDI QIDQ3587387

Nicolai Hähnle, Friedrich Eisenbrand, Martin Niemeier, Andreas Wiese, José Verschae

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2534/

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems ⋮ Line search method for solving a non-preemptive strictly periodic scheduling problem ⋮ Strictly periodic scheduling in IMA-based architectures ⋮ Approximation algorithms for replenishment problems with fixed turnover times

This page was built for publication: Scheduling Periodic Tasks in a Hard Real-Time Environment