Algorithms and complexity for periodic real-time scheduling

DOI10.1145/2390176.2390182zbMath1301.90027OpenAlexW2124435847WikidataQ57399758 ScholiaQ57399758MaRDI QIDQ2933634

Nicole Megow, Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11590/381331

zbMATH Keywords

computational complexityapproximation algorithmsinapproximabilityreal-time schedulingfeasibility testerliest deadline firstperiodic task system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Algorithms and complexity for periodic real-time scheduling