This work presents the development of a multipopulation genetic algorithm for the task schedulingproblem with communication costs, aiming to compare its performance with the serial genetic algorithm. For thispurpose, a set of instances was developed and different approaches for genetic operations were compared.Experiments were conducted varying the number of populations and the number of processors available forscheduling. Solution quality and execution time were analyzed, and results show that the AGMP with adjustedparameters generally produces better solutions while requiring less execution time
Multiprocessors have emerged as a powerful computing means for running real-time applications, espec...
The multiprocessor task scheduling problem is an NP-complete problem that is difficult to solve via ...
In recent years, with the wide-spreading usage of computer technologies in various aspects of the mo...
The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multi...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to b...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
This paper presents the development of genetic algorithm approach to schedule tasks on a multiproces...
Until now, several methods have been presented to optimally solve the multiprocessor task scheduling...
In the NP-hard multiprocessor scheduling problem a set of precedence constrained tasks are allocated...
Multiprocessors have evolved as powerful computing tools for executing dynamic real time tasks. The ...
In the multíprocessor schedulíng problem a given program is to be scheduled in a given multiprocesso...
Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduli...
Task scheduling is essential for the suitable operation of multiprocessor systems. The aim of task s...
Allocation of the components (tasks) of a parallel program to processors in a multiprocessor or a mu...
Multiprocessors have emerged as a powerful computing means for running real-time applications, espec...
The multiprocessor task scheduling problem is an NP-complete problem that is difficult to solve via ...
In recent years, with the wide-spreading usage of computer technologies in various aspects of the mo...
The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multi...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to b...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
This paper presents the development of genetic algorithm approach to schedule tasks on a multiproces...
Until now, several methods have been presented to optimally solve the multiprocessor task scheduling...
In the NP-hard multiprocessor scheduling problem a set of precedence constrained tasks are allocated...
Multiprocessors have evolved as powerful computing tools for executing dynamic real time tasks. The ...
In the multíprocessor schedulíng problem a given program is to be scheduled in a given multiprocesso...
Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduli...
Task scheduling is essential for the suitable operation of multiprocessor systems. The aim of task s...
Allocation of the components (tasks) of a parallel program to processors in a multiprocessor or a mu...
Multiprocessors have emerged as a powerful computing means for running real-time applications, espec...
The multiprocessor task scheduling problem is an NP-complete problem that is difficult to solve via ...
In recent years, with the wide-spreading usage of computer technologies in various aspects of the mo...