Professional Documents
Culture Documents
(mox(looJ(p
))) (2)
PROCESSOR UTILIZATION:
Processor utilization for any processor, pi is obtained by dividing the processor load, load (pi), by the value
of makespan.
Mathematically,
utilizotion(p
) =
Ioud(p
i
)
mukcspun(c
i
)
(3)
15
Figure 3: Underlying systemarchitecture
Average processor utilization is given by:
A:crogc utilizotion =
no.o] poccsso utIzuton
N
i=0
(p
i
)
totuI no.o] poccsso
(4)
V. PROPOSED GENETIC ALGORITHM BASED APPROACH
Generally the Genetic Algorithmprovides an efficient way to search for an optimal solution. The algorithm
starts by randomly generating an initial population of possible solutions. In this paper, the proposed GA-
implemented load balancing provides distribution of processes, among different processor or server, based on
processor load. When a process is assigned to a processor, the processor load is updated with the latest
assigning process to that processor or server, which is given by the assignment (nm) matrix. In context to
our problem, the initial population is created by randomly taking incoming requests/ processes. A request
queue is defined with all un- processed requests/ processes within it. After a specific time- interval, the
request/ processes are taken out fromthe queue in FCFS order and randomly allocated to the processors
(servers). Then each schedule is evaluated according to a fitness function. Two best schedules are selected, to
produce the next generation. Mutation and crossover functions are performed over the selected schedules to
produce schedules with higher fitness value, in order to maintain the population size. In every generation,
individuals are evaluated with the fitness function and less fit solutions are got rejected.
The algorithmcan be implemented in the following phases:
INITIALIZATION PHASE:
Genetic algorithmprovides to search froma large population of individuals. The initial population is created
by randomly selecting the processes/ requests fromthe request queue, in FCFS order and then randomly
assigned to processors (servers). The order of assigning the processes is taken as a condition. The initial
population is obtained by swapping the orders of assignment of processes, for a fixed number of times.
EVALUATION PHASE:
Evaluation phase provides to find a quality measure to determine how fit one individual is among the
population. In context to our key problem, web hotspot, where the load on the server suddenly get
increased to high; we define the fitness of a schedule as the number of un-processed requests. This is because
our foremost aimis to find an optimumsolution for distributing load among the processors (servers), so that
there is a response for every incoming processes/ requests. The fittest schedule will have zero un-processed
requests.
The fitness function can be defined as:
(s) ={u