Processor utilization bounds for real-time systems with precedence constraints

DOI10.1023/A:1019747531714MaRDI QIDQ1857164zbMATH OpenOpenAlexFDO

Authors Hongchao Liu, Xiaobo Hu

Publication date 17 February 2003

Published in Design Automation for Embedded Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019747531714

zbMATH Keywords

real-timeutilization boundPrecedence

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Theory of software (68N99)

Recommendations

• Utilization bounds for EDF scheduling on real-time multiprocessor systems
• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• Utilization bounds for multiprocessor rate-monotonic scheduling
• Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems
• Rate monotonic scheduling in hard real-time systems

Cited in

(5)

• Utilization based schedulability bounds for age constraint process sets in real-time systems
• Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems
• The feasibility of general task systems with precedence constraints on multiprocessor platforms
• Real-time uniprocessor scheduling with fewer preemptions
• The limited-preemptive feasibility of real-time tasks on uniprocessors

This page was built for publication: Processor utilization bounds for real-time systems with precedence constraints

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