Runtime feasibility check for non-preemptive real-time periodic tasks

DOI10.1016/J.IPL.2005.10.010MaRDI QIDQ1045905zbMATH OpenOpenAlexFDO

Authors Sangwon Kim, Joonwon Lee, Jinsoo Kim

Publication date 18 December 2009

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

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

zbMATH Keywords

non-preemptive schedulingreal-time systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Runtime feasibility check for non-preemptive real-time periodic tasks

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