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

DOI10.1016/J.IPL.2019.105867MaRDI QIDQ2011036zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
• Scheduling Periodic Tasks

Cites work

• A response-time analysis for non-preemptive job sets under global scheduling
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• The non-preemptive scheduling of periodic tasks upon multiprocessors

Cited in

(3)

• Processor bounding for an efficient non-preemptive task scheduling algorithm
• scientific article; zbMATH DE number 1706356 (Why is no real title available?)
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

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

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