Power-aware scheduling of conditional task graphs in real-time multiprocessor systems

We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle conditional task graphs (CTGs) which model more complex precedence constraints. We first propose a condition-unaware task scheduling algorithm integrating the task ordering algorithm for CTGs and the task stretching algorithm for unconditional task graphs. We then describe a condition-aware task scheduling algorithm which assigns to each task the start time and the clock speed, taking account of the condition matching and task execution profiles. Experimental results show that the proposed condition-aware task scheduling algorithm can reduce the energy consumption by 50% on average over the non-DVS task scheduling algorithm. Categories and Subject Descriptors C.3 [Computer Systems Organization]: Special-Purpose and Ap -plication-Based Systems—Real-time and embedded systems General Terms Design, Algorithms K...

• Type: Conference
• Year: 2003
• Where: ISLPED
• Authors: Dongkun Shin, Jihong Kim
• Keywords: Conditional Task Graph, ISLPED 2003, Task Graph, Task Scheduling Algorithm