Improved genetic algorithms and list scheduling techniques for independent task scheduling in distributed systems
Given a set of tasks with certain characteristics, e.g., data size, estimated execution time and a set of processing nodes with their own parameters, the goal of task scheduling is to allocate tasks at nodes so that the total makespan is minimized. The problem has been studied under various assumptions concerning task and node parameters with the resulting problem statements usually being NP-complete. List scheduling (LS) heuristics such as MaxMin and MinMin together with genetic algorithms (GAs) were applied in the past to find solutions. In this paper we investigate new heuristics for both the LS and the GA paradigm with the specific aim of improving the performance of the standard algorithms when task computations involve large data transfers. Experimental results under various environment assumptions illustrate the merits of the new algorithms. © 2007 IEEE.
Showing items related by title, author, creator and subject.
Control and optimization meet the smart power grid: Scheduling of power demands for optimal energy management Koutsopoulos, I.; Tassiulas, L. (2012)The smart power grid harnesses information and communication technologies to enhance reliability and enforce sensible use of energy through effective management of demand load. We envision a scenario with real-time ...
Liu, Y.; Liu, J.; Song, J.; Argyriou, A. (2015)3D video distribution over P2P networks has been thought as a promising way for 3D video entering home. The convergence of scalable 3D video coding and P2P streaming can provide diverse 3D experiences for heterogeneous ...
Owaida, M.; Antonopoulos, C. D.; Bellas, N. (2014)In large-scale datapaths, complex interconnection requirements limit resource utilization and often dominate critical path delay. A variety of scheduling and binding algorithms have been proposed to reduce routing requirements ...