A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
2010
Real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances made in schedulability analysis, and contains a number of significant additional results. The paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. We prove that Audsley's Optimal Priority Assignment (OPA) algorithm, originally
doi:10.1007/s11241-010-9106-5
fatcat:lkkemxvxwrey5cxs74ma5olmgu