Power conscious fixed priority scheduling for hard real-time systems

Abstract
Power efficient design of real-time systems based on program mable processors becomes more important as system functionality is in- creasingly realized through software. This paper presents a power- efficient version of a widely used fixed priority scheduling m ethod. The method yields a power reduction by exploiting slack times, both those inherent in the system schedule and those arising from variations of execution times. The proposed run-time mechanism is simple enough to be implemented in most kernels. Experimental results show that the proposed scheduling method obtains a signif- icant power reduction across several kinds of applications .

This publication has 15 references indexed in Scilit: