DAG scheduling on heterogeneous distributed systems using learning automata

Authors:
Habib Moti Ghader;Davood KeyKhosravi;Ali HosseinAliPour
Affiliations:
Islamic Azad University, Young Research Club, Tabriz, Iran;Islamic Azad University, Departmant of Computer Engineering, Osku, Iran;Islamic Azad University, Departmant of Computer Engineering, Tabriz, Iran
Venue:
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Year:
2010

Citing 12
Cited 0

Deterministic Learning Automata Solutions to the Equipartitioning Problem

IEEE Transactions on Computers
Learning automata: an introduction

Learning automata: an introduction
Multiprocessor scheduling using mean-field annealing

Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Learning Automata and Stochastic Optimization

Learning Automata and Stochastic Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors

Proceedings of the 8th International Symposium on Parallel Processing
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
A comparison of multiprocessor task scheduling algorithms with communication costs

Computers and Operations Research
Research Note: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

DAG scheduling is of great importance to optimal distribution of tasks in parallel and distributed systems. In this paper a novel approach to DAG scheduling, utilizing learning automata across distributed systems, is proposed. The learning process begins with an initial population of randomly generated learning automata. Each automaton by itself represents a stochastic scheduling. The scheduling is optimized within a learning process. Compared with current genetic approaches to DAG scheduling better results are achieved. The main reason underlying this achievement is that an evolutionary approach such as genetics looks for the best chromosomes within genetic populations whilst in the approach presented in this paper learning automata is applied to find the most suitable position for the genes in addition to looking for the best chromosomes. The scheduling resulted from applying our scheduling algorithm to some benchmark task graphs are compared with the existing ones.