Tree scheduling versus sequential scheduling

Abstract

We present a new approach of validation for critical real-time applications: the tree based approach. This approach explicitly takes the conditional statements and the semantics contained in the tests into account. We substitute sequential schedules by scheduling trees. We thus add new scheduling possibilities to those provided by the sequential approach. We then give conditions which make the two approaches equivalent (i.e. give same results for schedulability).