ISSN: 2250-3005 - ijcer

International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 82. Model and Problem Definition2.1. System ModelThe system used for simulation is loosely coupled non-uniform system, all task are non-pre-emptive and noprocess migration are assumed. The process scheduling problem considered in this paper is based on the deterministicmodel. The most important purposes of distributed system are assigned as providing an appropriate and efficientenvironment for sharing resource, having an acceptable speed and high reliability and availability.Netwo rk topology,processors speed, communication channels speed and so on. Since we study a deterministic model, a distributed systemwith m processors, m > 1 should be modeled as follows:P= {p1, p2, p3,..., pm} is the set of processors in the distributedsystem. Each processor can only execute one process at each moment, a processor completes current process beforeexecuting a new one, and a process cannot be moved to another processor during execution. G is an m × m matrix,where the element guv 1≤ u,v ≤ m of G, is the communication delay rate between Pu and Pv. H is an m × m matrix,where the element huv 1≤ u, v ≤m of H, is the time required to transmit a unit of data from Pu and Pv. It is obvious thathuu=0 and ruu=0.T = {t1, t2, t3,...,tn} is the set of processes to execution. E is an n × m matrix, where the element eij 1≤ i ≤ n, 1 ≤ j ≤ m of E, is the execution time of process ti on processor pj. In distributed systems the execution time ofan individual process ti on all processors is equal.F is a linear matrix, where the element fi 1≤ i ≤ n of F, is the targetprocessor that is selected for process ti to be executed on.C is a linear matrix, where the element ci i ≤ i ≤ n of C, is theprocessor that the process ti is presented on just now.The problem of process scheduling is to assign for each process ti Є T a processor fi Є P so that total execution timewill be minimized, utilization of processors will be maximized, and load balancing will be maximized.The processor load for each processor is the sum of process execution times allocated to that process [1].The length or max span of schedule T is the maximal finishing time of all the processes or maximum load. Also,communication cost (CC) to spread recently created processes on processors must be computed:Maxspan (T) = max (Load (p i )) for each 1≤i≤ Number of processors… (2)The processor utilization for each processor is obtained by dividing the sum of processing times by scheduling length.The average of process utilization is obtained by dividing the sum of all utilizations by number of processors [2].2.2. Genetic algorithmGenetic algorithm is guided random search algorithm based on the principles of evolution and natural genetics.It combines the exploitation of the past results with the exploration of new areas of the search space. Geneticalgorithms, as powerful and broadly applicable stochastic search and optimization techniques, are the most widelyknown types of evolutionary computation methods today. In general, a genetic algorithm has five basic components asfollows [3]:1. An encoding method that is a genetic representation (genotype) of solutions to the program.2. A way to create an initial population of individuals (chromosomes).3. An evaluation function, rating solutions in terms of their fitness, and a selection mechanis m.4. The genetic operators (crossover and mutation) that alter the genetic composition of offspring during reproduction.5. Values for the parameters of genetic algorithm.||Issn 2250-3005(online)|| ||December|| 2012 Page 270