Proceedings of the KIEE Conference (대한전기학회:학술대회논문집)
- 2004.05a
- /
- Pages.59-61
- /
- 2004
End-to-End Laxity-based Priority Assignment for Distributed Real-Time Systems
분산 실시간 시스템을 위한 양극단 여유도 기반의 우선순위 할당 방법
- Published : 2004.05.22
Abstract
Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.