OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES

By N. Audsley. 2007

353 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/59911c0872b2e598ebc4fe8eefdb75d39f0e3f01

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Alan Burns
2. Robert I. Davis
3. Johan J. Lukkien
4. Steve Vestal
5. R. Bril
6. Sanjoy Baruah

Citations in the corpus

• Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance (2007, methodology): “A second multi-criticality scheduling technique, which can be used either as an alternative to or in combination with period transformation, is to apply Audsley’s priority assignment algorithm to the multicriticality scheduling problem[1].”
• A survey of hard real-time scheduling for multiprocessor systems (2011, methodology): “The interested reader is referred to Audsley et al. [1996] and Sha et al. [2004], which provide historical accounts of the most important advances in the field of uniprocessor scheduling during those decades.”
• Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised (2007, methodology): “George et al. (1996) also showed that the optimal priority assignment algorithm devised by Audsley (1991) is applicable to non-pre-emptive systems.”