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
2010 IEEE International Workshop on Factory Communication Systems Proceedings
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times. We identify three sub-problems which optimise different metrics related to the probability of deadline failures. For each sub-problem we propose an algorithm that is proved optimal. The first two algorithms are inspired by Audsley's algorithm which is a greedy (lowest priority first) approach that is optimal in the case ofdoi:10.1109/wfcs.2010.5548602 fatcat:jdo3aio5hffvlodr6nplwn62b4