Optimal harmonic period assignment: complexity results and approximation algorithms

DOI10.1007/S11241-018-9304-0zbMath1436.68067OpenAlexW2796220414WikidataQ130042226 ScholiaQ130042226MaRDI QIDQ777052

D. Kharzeev

Publication date: 13 July 2020

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-018-9304-0

zbMATH Keywords

hard real-timereal-time schedulabilityharmonic tasksperiod assignment

Mathematics Subject Classification ID

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)

Uses Software

• TrueTime

Cites Work

• Feedback--feedforward scheduling of control tasks
• Sensitivity analysis for fixed-priority real-time systems
• Optimal checkpoint placement on real-time tasks with harmonic periods
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Optimal harmonic period assignment: complexity results and approximation algorithms