- -

- -
swallow2_2006@yahoo.com isra19kalak@yahoo.com

" "
.SCFET " " HLFET

( )

A Genetic Algorithm in Scheduling Processes with Non – Permeability

Isra N. Alkallak Ruqaya Z. Sha’ban
Assistant lecturer Assistant lecturer
Department of Basic Sciences Computers Unit
College of Nursing College of Medicine
University of Mosul University of Mosul

Abstract
The current paper tackles the combination of the genetic Algorithm with scheduling the
multiprocessor by browsing the two algorithms for dependent tasks and non preemptive.
The first algorithm is the highest level first estimated time (HLFET), and the second
algorithm is smallest co -level first with estimated time (SCFET). The genetic algorithm
proved to be powerful, efficient and appeared the feasible solution among many solutions;
that minimize the schedule length (execution time) to find the optimal scheduling. In this
research, it is proposed a genetic algorithm that finds a good combination of two list
algorithms to produce a schedule with shortest schedule length.
The results of the experiments showed that scheduling found with the proposed two list
scheduling genetic algorithms outperform those found with each one of the two lists
scheduling alone.

/ / ________________________________ / /
( ) / [ ]

Iintroduction -
Genetic Algorithm

.(Goldberg,1989)

.(Gold,1989, Hou et. al.,1994).

.
Scheduling Problem
Optimization Problem
(Auyeung et. al. ,2003 , Peng et .al. NP-Complete
. ,1997, Thiebaut,1995)

(Directed Acyclic Graph Model -

DAG)

Parallel
DAG Program
(Albala Cycle ( )
V G = (E,V) et. al.,1997, Gonzalez,1977)
Edge E Node

Weight (Collins,2001, Aronsson et. al.,2002)

. Computation Cost
Communication Cost Weight

.(Kowk et. al., 1999,Radulescu et. al., 2002)

 [ ] ...

( ) Precedence Relation
Ready
.(Gonzalez,1977, Baskiyar, 2002, Radulescu et .al., 2002)

Basic Steps in Scheduling -

List
Scheduling
:
. .
. .
. .

(Arroyo,1996, Arbitrary ( )
.Kowk et .al.,1999)

Gantt Chart Model -

Gantt Chart

(Thiebaut,1995)
Idle Period ( ) (φ)
. (Arroyo,1996)

Dependent Tasks Scheduling -

Algorithm

Highest Level First With Estimated

Smallest Times (HLFET)
Co-Level First With Estimated Time (SCFET)
level
Critical Path

Co- .
Level
.(Kowk et. al.,1999) Entry Node
 ( ) / [ ]

Create initial generation function

Find objective function

Parent selection function

Crossover Function

( )
Regeneration Process Mutation function

Find objective function

Stopping
criteria
 [ ] ...

Population -
Individuals
.
.genes

Gen1 Gen2 --------------------- Gen n

Chromosome

(Auyeung et. al. 2003, Grajcar, 1999, Mahmood, n

Mitchell ,1998) 2000, Nossal, 2000,
8bit

Randomly Function
.

Encoding Solution -
.
Binary Encoding
weight

4bits
.
8bits
Index (0-7) .
.

0 1 2 3 4 5 6 7

weight for HLFET weight for SCFET

Index 1 Index 2
( ) / [ ]

Fitness Function -

( )
:
Pr(n)=(whlfet*phlfet)+(wscfet*pscfet)
:
. pr(n)
Index1 HLFET Whlfet
.
. Index2 SCFET Wscfet
HLFET level Phlfet
. DAG
SCFET Co-level Pscfet
. DAG

Selection -
Parenet

.(Mitchell,1998) Selection Wheel Roulette

.(Goldberg,1989)

:
. .
.p .
. sumall .
. I=1 .
. 0<R<=sumall (R) randomly .
. I=I+1 .
.Ob .
. Slide=Slide+Ob .
.
. Partsum=Partsum+Slide
 [ ] ...

. Partsum>R .
.
.
.
. .

Slide1

SlideP
ob1 ob2 ob3 ……obn

Slide2

Crossover -

(Auyeung et. al, 2003) (Mahmood, 2000)

.( ) (Grajcar ,1999) (Nossal, 2000) (Mitchell ,1998)

Single Point Crossover

.
( ) / [ ]

Parent1 Child1

Parent2 Child2

Mutation -

(Mahmood, 1989)
.(Goldberg, 2000) (Nossal, 2000)
Bit Inversion
)
.((11001001) 10001001 1 0

Stop Criteria -

Classical Measures

(Goldberg ,1989;
(Nossal,2000 ;

Results -

( - ) ( - )
[ ] ...

.
++
C

HLFET
SCFET

.
Co_level Level
.
 ( ) / [ ]

0 0 0 0 1 1 0 0

weight for HLFET =0 weight for SCFET=12

TASK 1 2 3 4 5 6 7 8 9 10 11
LEVEL 16 15 11 10 8 9 5 4 3 5 2
CO_LEVEL 1 6 3 9 10 7 14 12 11 10 16

1 2 2 2 2 2 4 4 4 5 5 5 5 10 10 10 9 11 11
φ 3 3 0 0 0 6 6 6 6 7 7 7 7 7 8 8 0 0

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

Conclusions -
:
.
 [ ] ...

( )
.
.

.
.
.

-
.
.
.
.

-
1. Albala, A., Chan, W. Y.,Chow, A., Fan, X. and Stephan, V., Data Structure and
Algorithms Topic #30 :Directed A cyclic Graph, Class Notes for 308-251.School of
Computer Science, Mc Gill University,1997.
http//www.cs.mcgill.ca/~cs251/old courses/1997/topic30/
2. Aronsson, P. and Fritzson, P. Multiprocessor Scheduling of Simulation Code from
Modelica Models, 2nd International Modelica Conference, 2002.
http//www.modelica.org/Conference2002/ paper.s html.
3. Arroyo, D. O., STS A Simple Tool for Scheduling, School of Computer Science,
McGill University, 1996.
http://www.cs.mcgill.ca/~cs251/oldcourses/1997/
4. Auyeung, A., Gondra, I. And Dai, H.K., Multi-Heuristic List Scheduling Genetic
Algorithm for Task Scheduling. ACM.,2003.
http//www.cs.okstate.edu/~wingha/sac03-ga.pdf
5. Baskiyar, S., Scheduling DAGs on Message Passing
m-Processor System, IEICE Trans. Inf. & Syst., E 83-D (7), 2000.
6. Collins, J. B., An Approach to Scheduling Task Graphs with Contention in
communication, 2001.
http//www.ait.nrl.navy.mil/pgmt-for-web/pdf/an-approach-to-scheduling.pdf
7. Goldberg D.E, Genetic Algorithms in Search Optimization and Machine Learing,
Addison-Wesly. 1989.
8. Gonzalez, M. J., Deterministic Processor Scheduling, ACM. Computing Surveys, 9(3) ,
1977.
9. Grajcar, M., Genetic List Scheduling for Scheduling and Allocation on a Loosely
Coupled Heterogeneous Multiprocessor System, 1999.
http://portal.acm.org/citation.cfm?id=309931&coll.
10. Hou, E. S. H. Ansari, N., Ren, H., A Genetic Algorithm for Multiprocessor
Scheduling, IEEE Transaction on parallel and Distributed systems,l5(2) , 1994.
( ) / [ ]

11. Kowk, Y. K. and Ahmad, I., Static Scheduling Algorithm for Allocating Directed Task
Graphs to Multiprocessors, ACM Computing Surveys, Vol. 31, No. 4, 1999.
12. Mahmood A., A Hybrid Genetic Algorithm for Task Scheduling in Multiprocessor
Real-Time Systems, 2000.
http://www.ici.ro/ici/revista/sic2000-3/art05.html
13. Mitchell, M., An Introduction to Genetic Algorithms, MIT press, London, 1998.
14. Nossal, R., An Evolutionary Approach to Multiprocessor Scheduling of Dependent
Task, 2000.
http:// www.citesser.ist.psu.edu/context/377390
15. Peng,D.T., Shin, K.G and Abdel Zaher, T. F., Assignment and Scheduling
Communicating Periodic Tasks in Distributed Real-Time Systems, IEEE. Transactions
on Software Engineering 23(12) ,1997.
16. Radulescu, A. and Gemund, A. J. C. V. Low-Cost Task Scheduling for Distributed-
Memory Machines, IEEE Transactions on Parallel and Distributed Systems, Vol. 13,
No. 6, 2002.
17. Thiebaut, D. Problem Decomposition on a multiprocessor Network, Parallel
Programming in C for the Transputer, chap. IX, 1995.
http//cs.smith.edu/~thiebaut/transputer/chapter9/chap9-1.html