Aplicando Algoritmos Genticos na Alocao de Tarefas em Sistemas Distribudos de Tempo Real

This work aims at analyzing the behavior of genetic algorithms on distributed real time systems scheduling. The system consists of periodic and sporadic tasks that must be scheduled in design time and according to a fixed priority policy. The main goal of the scheduling it to guarantee that all deadlines are met, while minimizing the use of the interconnection bus. The work described in this paper shows the success rate of genetic algorithms when used to schedule feasible applications.