CPMD-mindful task assignment for NPS-F

DOI10.1007/S11241-014-9206-8zbMATH Open1314.68093OpenAlexW2043770135MaRDI QIDQ488221FDOQ488221

Joël Goossens, Geoffrey Nelissen, Konstantinos Bletsas

Publication date: 23 January 2015

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-014-9206-8

zbMATH Keywords

real-time schedulingbin packingmultiprocessorCPMD estimationNPS-Fsemi-partitioned

Mathematics Subject Classification ID

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

Cites Work

• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

This page was built for publication: CPMD-mindful task assignment for NPS-F

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