DocumentCode :
3242968
Title :
Periodic task scheduling algorithm under precedence constraint based on topological sort
Author :
Kim, Si Wan ; Park, Hong Seong
Author_Institution :
Dept. of Electr. Eng., Kangwon Nat. Univ., Chuncheon, South Korea
fYear :
2011
fDate :
23-26 Nov. 2011
Firstpage :
727
Lastpage :
729
Abstract :
Almost real-time systems are constructed by periodic tasks that have precedence. In this paper, we propose scheduling method and validation algorithm. This method allocate periodic task that have precedence relations for fixed priority using topological sort algorithm. And we validation this algorithm using simple example.
Keywords :
computational complexity; processor scheduling; sorting; topology; NP-Hard problem; fixed priority; periodic task allocation; periodic task scheduling algorithm; precedence constraint; real-time systems; topological sort algorithm; validation algorithm; Modeling; NP-hard problem; Real time systems; Scheduling; Scheduling algorithms; Timing; Off-line Scheduling; Periodic task; Precedence; Priority Assign; Topological;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Ubiquitous Robots and Ambient Intelligence (URAI), 2011 8th International Conference on
Conference_Location :
Incheon
Print_ISBN :
978-1-4577-0722-3
Type :
conf
DOI :
10.1109/URAI.2011.6145920
Filename :
6145920
Link To Document :
بازگشت