An empirical study of permutational genetic crossover and mutation operators on the fixed priority assignment in distributed real-time systems

• Type: Article in International Conference Proceedings Book
• Date: 2012

Authors

Azketa, E (Author) Other; Uribe, JP (Author) Other; Marcos, M (Author) Other; Luis Almeida (Author) FEUP; Javier Gutierrez, JJ (Author) Other

Conference proceedings International

Title: 2012 IEEE International Conference on Industrial Technology, ICIT 2012, Proceedings

Pages: 598-605

2012 IEEE International Conference on Industrial Technology, ICIT 2012

Athens, 19 March 2012 through 21 March 2012

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 1 Citation

Other information

Authenticus ID: P-008-4YD

DOI: 10.1109/icit.2012.6210004

Abstract (EN): The assignment of fixed priorities to tasks and messages in distributed real-time systems is known to be an NP-hard problem, so there is no optimal method to accomplish it in polynomial time. Several generic search and optimization methods have been proposed in the literature for the priority-based scheduling of distributed real-time systems. The permutational genetic algorithm is one of those techniques that has shown a notable ability to solve this problem. The success of a genetic algorithm is greatly influenced by the used crossover and mutation operators, whose performance may vary between different problems. In this paper we make an introduction of some crossover and mutation operators for permutational genetic algorithms and make an experimental analysis of their performance in the assignment of fixed priorities to tasks and messages in distributed real-time systems.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8