Skip to Main Content
This paper introduces a modified version of the priority ceiling protocol (PCP) by applying adaptive techniques to approximate the optimal priorities. The proposed algorithm keeps the boundaries of the original PCP algorithm, while it increases the fairness of the scheduling as well as the possibility to use it in dynamically configured systems. Intelligent algorithms occasionally are used in embedded systems due to mostly runtime problems. The proposed algorithm fulfills the requirements of the safety critical systems and can effectively be applied in embedded systems, as well. Furthermore a benchmarking system for scheduling algorithms is introduced, which can advantageously be applied to compare different scheduling algorithms executed with the same configuration. Finally the performance of the modified algorithm versus the original one will be analyzed.