Conference Paper

Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing.

DOI: 10.1109/IPDPS.2005.184 Conference: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA
Source: DBLP


An algorithm has been developed to dynamically sched- ule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environ- ment with dynamically changing resources and adapts to variable system resources. It operates in a batch fashion and utilises a genetic algorithm to minimise the total exe- cution time. We have compared our scheduler to six other schedulers, three batch-mode and three immediate-mode schedulers. We have performed simulations with randomly generated task sets, using uniform, normal, and Poisson dis- tributions, whilst varying the communication overheads be- tween the clients and scheduler. We have achieved more effi- cient results than all other schedulers across a range of dif- ferent scenarios while scheduling 10,000 tasks on up to 50 heterogeneous processors.

46 Reads
  • Source
    • "Dhodhi et al. [13] also presented a GA for task scheduling on heterogeneous systems, where a new encoding has been used to represent the feasible solutions. It is remarkable that these GA-based multi-objective algorithms [10] [11] [12] [13] were implemented for the general tasks without considering time constraints. Yoo et al. [14] proposed a hybrid multi-objective algorithm based on GA and Simulated Annealing (SA) for scheduling of soft real-time tasks. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Scheduling of real-time tasks in multiprocessor systems is a NP-hard problem. Recently, swarm intelligence algorithms have been efficiently applied for this problem. Real-time tasks can be classified into hard real-time tasks and soft real-time tasks. The aim of hard real-time task scheduling algorithms is to meet all tasks deadline constraints. However, slight violation is not critical, in the case of soft real-time tasks. In this paper, a new algorithm based on artificial bee colony (ABC) is proposed for scheduling of soft real-time tasks. In this method, a hybrid neighborhood search mechanism is introduced to improve the convergence of ABC. Experimental results demonstrate the effectiveness of proposed algorithm for scheduling of soft real-time tasks in heterogeneous multiprocessor systems.
    22nd Iranian Conference on Electrical Engineering (ICEE2014), Tehran, Iran; 05/2014
  • Source
    • "In the case of Parallel machine scheduling, there are many literatures surrounding the multiobjective problem. The use of Holland's genetic algorithms [3] (GAs) in scheduling, which apply evolutionary strategies to allow for the fast exploration of the search space of schedules, allows good solutions to be found quickly and for the scheduler to be applied to more general problems [4]. E. Kim et al. [5] considered a deterministic scheduling problem where multiple jobs with s-precedence relations are processed on multiple identical parallel machines. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Multiprocessor task scheduling is a NP-hard problem and Genetic Algorithm (GA) has been revealed as an excellent technique for finding an optimal solution. In the past, several methods have been considered for the solution of this problem based on GAs. But, all these methods consider single criteria and in the present work, minimization of the bi-criteria multiprocessor task scheduling problem has been considered which includes weighted sum of makespan & total completion time. Efficiency and effectiveness of genetic algorithm can be achieved by optimization of its different parameters such as crossover, mutation, crossover probability, selection function etc. The effects of GA parameters on minimization of bi-criteria fitness function and subsequent setting of parameters have been accomplished by central composite design (CCD) approach of response surface methodology (RSM) of Design of Experiments. The experiments have been performed with different levels of GA parameters and analysis of variance has been performed for significant parameters for minimisation of makespan and total completion time simultaneously.
  • Source
    • "The authors presented an extensive study on the usefulness of GAs for designing efficient Grid schedulers when makespan and flowtime are minimized. In [11], an algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in a batch fashion and utilizes a genetic algorithm to minimize the total execution time. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Advanced distributed applications in engineering, scientific and business domains that are highly data-intensive demand high-performance computing platforms. Grid networks based on optical technology provide a promising approach to create efficient infrastructure to support such applications. These networks, termed in general as Lambda Grid networks, are based on optical circuit switching and employ wavelength division multiplexing and optical lightpaths. In this paper, we propose an approach based on Tabu Search heuristic for joint scheduling of computing, network and storage resources in a Lambda Grid network. The objectives are to minimize cost by efficient usage of resources and to minimize total completion time of job execution. The results are compared to a Greedy approach. Simulation results from both the methods show that the Tabu search heuristic performed better than the greedy approach in optimizing both the cost and completion time objectives.
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE; 01/2011
Show more

Similar Publications


46 Reads
Available from