Supporting deliberative real-time AI systems: A fixed priority scheduling approach

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Constructing deliberative real-time AI systems is challenging due to the high execution-time variance in AI algorithms and the requirement of worst-case bounds for hard real-time guarantees, often resulting in poor use of system resources. Using a motivating case study, the general problem of resource usage maximization is addressed. We show how the issues can be leveraged by employing a hybrid task model for anytime algorithms, which is supported by recent advances in fixed priority scheduling for imprecise computation.

In particular, with a novel scheduling scheme based on Dual Priority Scheduling, hard tasks are guaranteed by schedulability analysis and scheduled in favor of optional and anytime components which are executed whenever possible for enhancing system utility. Simulation studies show satisfactory performance on the case study with the application of the scheduling scheme. With its basis on fixed priority scheduling, it is expected that it can be easily incorporated into existing real-time operating systems, promoting wider use of imprecise computing and providing a framework where real-time AI applications can be suitably facilitated.

Original languageEnglish
Title of host publication19th Euromicro Conference on Real-Time Systems, Proceedings
Place of PublicationLOS ALAMITOS
PublisherIEEE Computer Society
Number of pages10
ISBN (Print)978-0-7695-2914-1
Publication statusPublished - 2007
Event19th Euromicro Conference on Real-Time Systems (ECRTS 2007) - Pisa
Duration: 4 Jul 20076 Jul 2007


Conference19th Euromicro Conference on Real-Time Systems (ECRTS 2007)



Cite this