By Topic

Permutational Genetic Algorithm for the Optimized Assignment of Priorities to Tasks and Messages in Distributed Real-Time Systems

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
$31 $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

5 Author(s)
Azketa, E. ; Software Technol., Ikerlan Res. Center, Mondragon, Spain ; Uribe, J.P. ; Marcos, M. ; Almeida, L.
more authors

The assignment of fixed priorities to tasks and messages in distributed real-time systems is known to be an NP-hard problem, and thus there is no optimal method to accomplish it in polynomial time. This fact makes it a suitable problem to be approached with generic search and optimization algorithms. In this paper we propose a genetic algorithm with a permutational solution encoding for the assignment of fixed priorities to tasks and messages in distributed real-time systems using a holistic approach. This paper shows that the genetic algorithm can find more and better schedulable priority assignments than HO PA, which is, as far as we know, one of the best methods for the fixed priority assignment in distributed real-time systems.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011