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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Erciyes, K., & Soysert, Z. (2005). Multilevel static real-time scheduling algorithms using graph partitioning. In Lecture Notes in Computer Science (Vol. 3514, pp. 196–203). Springer Verlag. https://doi.org/10.1007/11428831_25
Mendeley helps you to discover research relevant for your work.