By Topic

Intelligent priority ceiling protocol for scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dániel Kristóf Kiss ; Óbuda University PhD School of Applied Informatics, Bécsi út 96/b, 1034 Budapest, Hungary

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.

Published in:

3rd IEEE International Symposium on Logistics and Industrial Informatics

Date of Conference:

25-27 Aug. 2011