Uma Heurística de Agrupamento de Caminhos para Escalonamento de Tarefas em Grades Computacionais


Scheduling is fundamental to achieve good performance in process execution in distributed systems. The task scheduling problem is, in general,NP-Complete, leading to the development of heuristic-based algorithms. In a heterogeneous and dynamic system as a computational grid, this problem acquires new variables and becomes more complex. In this paper we present an algorithm for scheduling processes on a grid that supports dependent task execution through hierarchical control sctructures called controllers. The performed simulations show that the algorithm gives good performance and, jointly with the middleware, provides scalability and dependability for process execution in a grid environment.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: