Static Real-time Scheduling Algorithms using Graph Partitioning
We propose static task allocation algorithms for the periodic tasks of a distributed real-time system. The cyclic task consists of task threads which may communicate and share resources. A graph partitioning process and a thread sequencing algorithm are applied to these threads to yield local schedules. The exact analysis is then obtained and further refinements are performed if the worst case response time of a task is greater than its deadline....
Kayhan Erciyes Zehra Soysert
Izmir Institute of Technology Computer Eng.Dept., Urla, Izmir 35430, Turkey;California State Univers Ege University International Computer Institute 35100 Bornova, Izmir, Turkey
国际会议
首届嵌入式软件与系统国际会议(Proceedings of the First International Conference on Embedded Software and System)
杭州
英文
416-423
2004-12-09(万方平台首次上网日期,不代表论文的发表时间)