Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems

DOI10.1007/BF01940882zbMath0848.68049OpenAlexW1968713409MaRDI QIDQ1918993

Yanyan Li

Publication date: 23 July 1996

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

scheduling algorithmshard-real-time systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Related Items (5)

Scheduling cyclic tasks with binary periods ⋮ The non-preemptive scheduling of periodic tasks upon multiprocessors ⋮ Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks ⋮ Processor bounding for an efficient non-preemptive task scheduling algorithm ⋮ Polynomial time schedulability test for periodic non-preemptive 2-task system

Cites Work

• Unnamed Item
• Scheduling periodically occurring tasks on multiple processors
• A note on preemptive scheduling of periodic, real-time tasks
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• 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: Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems