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

DOI10.1016/J.IPL.2019.105867zbMATH Open1478.68027OpenAlexW2982356502MaRDI QIDQ2011036FDOQ2011036

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

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

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

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

Cited In (3)

• Processor bounding for an efficient non-preemptive task scheduling algorithm
• Title not available (Why is that?)
• 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)