Scheduling cyclic tasks with binary periods
DOI10.1016/S0020-0190(98)00221-XzbMATH Open1339.68030MaRDI QIDQ293232FDOQ293232
Authors: Jerzy R. Nawrocki, Adam Czajka, 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
Recommendations
- scientific article; zbMATH DE number 6971075
- Publication:3478256
- The cyclical scheduling problem
- The cyclical scheduling problem
- Cyclic scheduling problems.
- The basic cyclic scheduling problem with deadlines
- Cyclic Scheduling in a Stochastic Environment
- Scheduling periodic tasks in a hard real-time environment
- Scheduling Periodic Tasks
- Scheduling periodic tasks on uniform multiprocessors
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
Cited In (8)
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
- Title not available (Why is that?)
- Scheduling cyclic tasks with binary periods
- The basic cyclic scheduling problem with deadlines
- Periodic scheduling of marked graphs using balanced binary words
- Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
- Recovering cyclic schedules from delay
- Efficient scheduling of periodic information monitoring requests
This page was built for publication: Scheduling cyclic tasks with binary periods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293232)
