A new algorithm for scheduling periodic, real-time tasks

DOI10.1007/BF01553887zbMath0664.68035OpenAlexW2001794165MaRDI QIDQ1115592

Joseph Y.-T. Leung

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01553887

zbMATH Keywords

preemptive schedulingmultiprocessor computer systemco-NP-hardperiodic, real-time tasks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Related Items (11)

Schedulers for larger classes of pinwheel instances ⋮ LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems ⋮ Proportionate progress: A notion of fairness in resource allocation ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ A new fair scheduling algorithm for periodic tasks on multiprocessors ⋮ {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling ⋮ Feasibility problems for recurring tasks on one processor ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Efficient scheduling of periodic information monitoring requests ⋮ Optimal virtual cluster-based multiprocessor scheduling

Cites Work

• Scheduling periodically occurring tasks on multiple processors
• A note on preemptive scheduling of periodic, real-time tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: A new algorithm for scheduling periodic, real-time tasks