Flexible hard real-time scheduling for deliberative AI systems

DOI10.1007/s11241-008-9058-1zbMath1194.68084OpenAlexW2078694713MaRDI QIDQ842724

Yanching Chu, Alan Burns

Publication date: 25 September 2009

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

Full work available at URL: https://doi.org/10.1007/s11241-008-9058-1

zbMATH Keywords

response time analysisfixed priority schedulingdeliberative agentsoptimal priority orderingreal-time AI

Mathematics Subject Classification ID

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

Related Items (1)

The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems

Cites Work

• Unnamed Item
• Real-time operating systems
• Real-time heuristic search
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Multiple servers and capacity sharing for implementing flexible scheduling

This page was built for publication: Flexible hard real-time scheduling for deliberative AI systems