Polynomial time schedulability test for periodic non-preemptive 2-task system

DOI10.1016/j.ipl.2019.105867zbMath1478.68027OpenAlexW2982356502MaRDI QIDQ2011036

Jaishree Mayank, Arijit Mondal

Publication date: 28 November 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105867

zbMATH Keywords

schedulingperiodicityreal-time systemsschedulabilitynon-preemptive 2-task system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Polynomial time schedulability test for periodic non-preemptive 2-task system