Optimal harmonic period assignment: complexity results and approximation algorithms

DOI10.1007/s11241-018-9304-0zbMath1436.68067MaRDI 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-time; real-time schedulability; harmonic tasks; period assignment

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Uses Software

• TrueTime