Optimal harmonic period assignment: complexity results and approximation algorithms

DOI10.1007/S11241-018-9304-0zbMATH Open1436.68067OpenAlexW2796220414WikidataQ130042226 ScholiaQ130042226MaRDI QIDQ777052FDOQ777052

Authors: 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

Recommendations

• Scheduling periodic tasks in a hard real-time environment
• Scheduling Periodic Tasks
• Algorithms and complexity for periodic real-time scheduling
• Algorithms and complexity for periodic real-time scheduling
• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors

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)

Cites Work

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

Cited In (1)

• Scheduling periodic tasks in a hard real-time environment

Uses Software

• TrueTime

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777052)