Scheduling Periodic Tasks

DOI10.1287/IJOC.8.4.428MaRDI QIDQ4367057zbMATH OpenOpenAlexFDO

Authors J. Korst, E. Aarts, Jan Karel Lenstra

Publication date 25 November 1997

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.8.4.428

zbMATH Keywords

approximation algorithmminimum number of processorsnonpreemptively scheduling periodic tasksNP-complete

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Periodic Tasks with Slack
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Scheduling cyclic tasks with binary periods
• scientific article; zbMATH DE number 4215346
• The non-preemptive scheduling of periodic tasks upon multiprocessors

Cited in

(31)

• A note on `Efficient scheduling of periodic information monitoring requests'
• Scheduling with semaphore constraints
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• A study of the cyclic scheduling problem on parallel processors
• Choosing task periods to minimise system utilisation in time triggered systems
• Scheduling of offset free systems
• Exact and heuristic algorithms for thrift cyclic scheduling
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Polynomial time schedulability test for periodic non-preemptive 2-task system
• Schedulability analysis for strictly periodic tasks in RTOS
• Efficient scheduling of periodic information monitoring requests
• Multitasking scheduling with alternate periods
• Scheduling cyclic tasks with binary periods
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• scientific article; zbMATH DE number 4215346 (Why is no real title available?)
• Scheduling periodic tasks in a hard real-time environment
• Technical Note—Optimal Scheduling of Periodic Activities
• Optimization of the computing process in a computer with a deterministic flow of requests
• The Periodic Loading Problem: Formulation And Heuristics
• scientific article; zbMATH DE number 30973 (Why is no real title available?)
• scientific article; zbMATH DE number 108489 (Why is no real title available?)
• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
• Strictly periodic scheduling in IMA-based architectures
• scientific article; zbMATH DE number 1529456 (Why is no real title available?)
• CHAIN STRUCTURES IN SCHEDULES TASKS
• Periodic chains scheduling on dedicated resources -- a crucial problem in time-sensitive networks
• Hardness and fixed parameter tractability for pinwheel scheduling problems
• Optimal harmonic period assignment: complexity results and approximation algorithms
• Generalized pinwheel problem
• The non-preemptive scheduling of periodic tasks upon multiprocessors

This page was built for publication: Scheduling Periodic Tasks

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