A two-phase heuristic for the energy-efficient scheduling of independent tasks on computational grids

Authors:
Frédéric Pinel;Bernabé Dorronsoro;Johnatan E. Pecero;Pascal Bouvry;Samee U. Khan
Affiliations:
Computer Science and Communications, University of Luxembourg, Luxembourg, Luxembourg 1359;Interdisciplinary Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg, Luxembourg 1359;Computer Science and Communications, University of Luxembourg, Luxembourg, Luxembourg 1359;Computer Science and Communications, University of Luxembourg, Luxembourg, Luxembourg 1359;NDSU-CIIT Green Computing and Communications Laboratory, Department of Electrical and Computer Engineering, North Dakota State University, Fargo, USA 58108-6050
Venue:
Cluster Computing
Year:
2013

Citing 22
Cited 2

A quantitative model-independent method for global sensitivity analysis of model output

Technometrics
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Techniques for mapping tasks to machines in heterogeneous computing systems

Journal of Systems Architecture: the EUROMICRO Journal - Heterogeneous distributed and parallel architectures: hardware, software and design tools
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
A Distributed Heterogeneous Supercomputing Management System

Computer
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Scheduling Algorithms

Scheduling Algorithms
Sensitivity Analysis in Practice: A Guide to Assessing Scientific Models

Sensitivity Analysis in Practice: A Guide to Assessing Scientific Models
A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing
Comparison and analysis of ten static heuristics-based Internet data replication techniques

Journal of Parallel and Distributed Computing
Dynamic Resource Management in Energy Constrained Heterogeneous Computing Systems Using Voltage Scaling

IEEE Transactions on Parallel and Distributed Systems
Cellular Genetic Algorithms

Cellular Genetic Algorithms
A New Parallel Asynchronous Cellular Genetic Algorithm for de Novo Genomic Sequencing

SOCPAR '09 Proceedings of the 2009 International Conference of Soft Computing and Pattern Recognition
A Heuristic Energy-aware Scheduling Algorithm for Heterogeneous Clusters

ICPADS '09 Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems
Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power

Information Sciences: an International Journal
Heterogeneous computing scheduling with evolutionary algorithms

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Evolutionary algorithm parameter tuning with sensitivity analysis

SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems

Energy-Aware Scheduling on Multicore Heterogeneous Grid Computing Systems

Journal of Grid Computing
Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The sensitivity analysis of a Cellular Genetic Algorithm (CGA) with local search is used to design a new and faster heuristic for the problem of mapping independent tasks to a distributed system (such as a computer cluster or grid) in order to minimize makespan (the time when the last task finishes). The proposed heuristic improves the previously known Min-Min heuristic. Moreover, the heuristic finds mappings of similar quality to the original CGA but in a significantly reduced runtime (1,000 faster). The proposed heuristic is evaluated across twelve different classes of scheduling instances. In addition, a proof of the energy-efficiency of the algorithm is provided. This convergence study suggests how additional energy reduction can be achieved by inserting low power computing nodes to the distributed computer system. Simulation results show that this approach reduces both energy consumption and makespan.