Permutational genetic algorithm for the optimized assignment of priorities to tasks and messages in distributed real-time systems

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2011

Autores

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

Ata de Conferência Internacional

Título: Proc. 10th IEEE Int. Conf. on Trust, Security and Privacy in Computing and Communications, TrustCom 2011, 8th IEEE Int. Conf. on Embedded Software and Systems, ICESS 2011, 6th Int. Conf. on FCST 2011

Páginas: 958-965

10th IEEE Int. Conf. on Trust, Security and Privacy in Computing and Communications, TrustCom 2011, 8th IEEE Int. Conf. on Embedded Software and Systems, ICESS 2011, 6th Int. Conf. on Frontier of Computer Science and Technology, FCST 2011

Changsha, 16 November 2011 through 18 November 2011

Indexação

ISI Web of Knowledge - 7 Citações

Scopus - 18 Citações

Outras Informações

ID Authenticus: P-008-22D

DOI: 10.1109/trustcom.2011.132

Abstract (EN): 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 HOPA, which is, as far as we know, one of the best methods for the fixed priority assignment in distributed real-time systems.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 8