Abstract. In this paper, a Data Envelopment analysis based Genetic Algorithm (DEA-GA) is proposed for multi-objective scheduling on Chip-Multiprocessor. The proposal adopts modified GA as the searching heuristic to explore the solution space, and the fitness of each individual (schedule) is evaluated using the DEA approach. Three of the schedule metrics, namely makespan, energy and load balance are used to construct the multi-input multi-output Decision Making Units in the DEA, and the BCC super efficiency of each schedule is calculated. In the modified genetic algorithm, the metapopulation is divided into three subpopulations each optimizing a single metric. The top performance individuals in each subpopulation are then regrouped and appli...
Task scheduling plays an important part in the improvement of parallel and distributed systems. The ...
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to b...
multiprocessor task scheduling is a NP-hard problem and Genetic algorithm (GA) has been revealed as ...
This paper proposes a genetic algorithm (GA) based energy-efficient design-time task scheduling algo...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
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...
Task scheduling is essential for the suitable operation of multiprocessor systems. The aim of task s...
Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduli...
Multiprocessors have evolved as powerful computing tools for executing dynamic real time tasks. The ...
System is using multiple processors for computing and information processing, is increasing rapidly ...
Task scheduling plays an important part in the improvement of parallel and distributed systems. The ...
The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multi...
Multiprocessors have emerged as a powerful computing means for running real-time applications, espec...
Task scheduling plays an important part in the improvement of parallel and distributed systems. The ...
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to b...
multiprocessor task scheduling is a NP-hard problem and Genetic algorithm (GA) has been revealed as ...
This paper proposes a genetic algorithm (GA) based energy-efficient design-time task scheduling algo...
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiproce...
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...
Task scheduling is essential for the suitable operation of multiprocessor systems. The aim of task s...
Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduli...
Multiprocessors have evolved as powerful computing tools for executing dynamic real time tasks. The ...
System is using multiple processors for computing and information processing, is increasing rapidly ...
Task scheduling plays an important part in the improvement of parallel and distributed systems. The ...
The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multi...
Multiprocessors have emerged as a powerful computing means for running real-time applications, espec...
Task scheduling plays an important part in the improvement of parallel and distributed systems. The ...
Efficient multiprocessor task scheduling is a long-studied and difficult problem that continues to b...
multiprocessor task scheduling is a NP-hard problem and Genetic algorithm (GA) has been revealed as ...