2012
DOI: 10.4236/am.2012.37111
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Genetic Scheduling Algorithm to Heterogeneous Distributed System

Abstract: In parallel and distributed computing, development of an efficient static task scheduling algorithm for directed acyclic graph (DAG) applications is an important problem. The static task scheduling problem is NP-complete in its general form. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, consisting of processors with varying processing capabilities and network links with varying bandwidths. List scheduling algorithms are generally preferred since they… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 10 publications
(13 reference statements)
0
2
0
Order By: Relevance
“…A genetic algorithm is used for the optimal feature selection [38]. The pseudo-code for the genetic algorithm is expressed in Algorithm 1.…”
Section: B Feature Engineeringmentioning
confidence: 99%
“…A genetic algorithm is used for the optimal feature selection [38]. The pseudo-code for the genetic algorithm is expressed in Algorithm 1.…”
Section: B Feature Engineeringmentioning
confidence: 99%
“…The schedule obtained outperforms the GA and is within 9% of the optimal schedule. Kang and Zhang 20 presented a hybrid GA for static task mapping and scheduling on heterogeneous systems with satisfaction of the precedence requirements of the application.…”
Section: Related Workmentioning
confidence: 99%