A Novel Hybrid Algorithm for Task Graph Scheduling

Details A Novel Hybrid Algorithm for Task Graph Scheduling A Novel Hybrid Algorithm for Task Graph Scheduling

2011-06-09

arxiv.org/abs/1106.1910v1

IJCSI, Vol 8, Issue 2, March 2011, p32-38

Computer Science

Computational Complexity

Scientific paper

One of the important problems in multiprocessor systems is Task Graph Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata and genetic algorithms are search tools which are used for solving many NP-Hard problems. In this paper a new hybrid method based on Genetic Algorithm and Learning Automata is proposed. The proposed algorithm begins with an initial population of randomly generated chromosomes and after some stages, each chromosome maps to an automaton. Experimental results show that superiority of the proposed algorithm over the current approaches.

Affiliated with

Also associated with

No associations

Rating

A Novel Hybrid Algorithm for Task Graph Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Novel Hybrid Algorithm for Task Graph Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Hybrid Algorithm for Task Graph Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319544