Pre-run-time scheduling of processes with exclusion relations on nested or overlapping critical sections

Nested or overlapping critical sections in processes frequently occur in many hard-real-time system applications. For a pre-run time schedule, the ability to schedule such processes can often significantly increase the chances of finding a feasible schedule. The authors study the properties of exclusion relations defined on nested or overlapping critical sections. An algorithm is presented that is able to systematically search for a feasible schedule that satisfies a given set of release times, deadline constraints, and precedence and exclusion relations, where the exclusion relations are defined on critical sections that may nest within or overlap with each other.<>