Scheduling cyclic tasks with binary periods

DOI10.1016/S0020-0190(98)00221-XzbMath1339.68030MaRDI QIDQ293232

Adam Czajka, Jerzy R. Nawrocki, Wojciech Complak

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909800221X?np=y

zbMATH Keywords

computational complexityschedulingcombinatorial problemsreal-time systemscyclic tasks

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)

Related Items (3)

Scheduling cyclic tasks with binary periods ⋮ Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks ⋮ Efficient scheduling of periodic information monitoring requests

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling cyclic tasks with binary periods
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• The Periodic Loading Problem: Formulation And Heuristics

This page was built for publication: Scheduling cyclic tasks with binary periods