Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems

DOI10.1016/S0045-7906(00)00025-2MaRDI QIDQ1860055zbMATH OpenOpenAlexWikidataFDO

Authors Bo-Chao Cheng, Thomas J. jun. Marlowe, Sanjoy K. Baruah, Alexander D. Stoyenko

Publication date 20 February 2003

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0045-7906(00)00025-2

zbMATH Keywords

real-time systemtheory of computation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99) Computing methodologies and applications (68U99)

Recommendations

• On optimal lateness and tardiness scheduling in real-time systems
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Generalized tardiness bounds for global multiprocessor scheduling
• Processor utilization bounds for real-time systems with precedence constraints
• Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling

Cited in

(3)

• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Processor utilization bounds for real-time systems with precedence constraints
• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems

This page was built for publication: Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems

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