Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems

DOI10.1007/BF01940882MaRDI QIDQ1918993zbMATH OpenOpenAlexFDO

Authors 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

hard-real-time systemsscheduling algorithms

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Periodic Tasks
• scientific article; zbMATH DE number 4215346
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• scientific article; zbMATH DE number 4199942
• Algorithms and complexity for periodic real-time scheduling

Cites work

• A note on preemptive scheduling of periodic, real-time tasks
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On a Real-Time Scheduling Problem
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling periodically occurring tasks on multiple processors

Cited in

(28)

• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
• A new algorithm for scheduling periodic, real-time tasks
• Exact and heuristic algorithms for thrift cyclic scheduling
• Non-preemptive scheduling with setup times: a PTAS
• Exact speedup factors and sub-optimality for non-preemptive scheduling
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Real-time supervisory control of a processor for non-preemptive execution of periodic tasks
• On non-preemptive scheduling of recurring tasks using inserted idle times
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• Polynomial time schedulability test for periodic non-preemptive 2-task system
• Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Scheduling cyclic tasks with binary periods
• Algorithms and complexity for periodic real-time scheduling
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• scientific article; zbMATH DE number 4199942 (Why is no real title available?)
• scientific article; zbMATH DE number 4215346 (Why is no real title available?)
• Scheduling periodic tasks in a hard real-time environment
• Optimization of the computing process in a computer with a deterministic flow of requests
• scientific article; zbMATH DE number 30973 (Why is no real title available?)
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Scheduling Periodic Tasks
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Algorithms and complexity for periodic real-time scheduling
• From non-preemptive to preemptive scheduling using synchronization synthesis
• Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints
• Periodic chains scheduling on dedicated resources -- a crucial problem in time-sensitive networks
• The non-preemptive scheduling of periodic tasks upon multiprocessors

This page was built for publication: Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems

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