(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No.9, 2010
As such, a preemptive policy should also transfer thetask state which can be very large or complex. Thus,transferring operation is expensive. A non- preemptive policy selects only tasks that have not begun execution and, hence, it does not requiretransferring the state of task.
: The objective of this policy is tofind a suitable transfer partner for a machine, oncethe transfer policy has decided that the machine is aheavily-loaded state or lightly-loaded one. Commonlocation policies include: random selection, dynamicselection, and state polling.
: This policy determines when theinformation about the state of other machines should be collected, from where it has to be collected, andwhat information is to be collected.II.D
A simple model of a distributed system is presented here.This model consists of a decentralized decision makingapproach with cooperation from all the nodes. So the performance can be improved here purely by intelligentdecision making and proper coordination. The various nodesof the system here are the resources and each of theseresources can be in different states. A vector is used to givethe state of a node which describes many characteristics of thenode. The elements of this state vector are measures whichimply a cost or penalty for using the resource.The set of states of all the resources in the distributedsystem is known as the global system state. In distributed load balancing also the decisions are not always necessarily madeusing the complete global state information. In fact for eachnode under consideration only a subset of neighboring nodesmay be needed to take a decision. Another important aspect isthat a node can change state faster than the time taken totransmit state information from one state to another. Thereforethere is always some amount of uncertainty in the stateinformation used for making a decision. Hence it is necessarythat the decision making process deals with theseuncertainties. Fuzzy logic is one of the methods of dealingwith this uncertain information and has been used in the work presented in this paper.III.D
The algorithm implemented in this work is basically dividedinto two parts:A.The system ModelB. The Scheduler a)Threshold Estimation b)Decision Making
A.The System Model
A distributed system is assumed to be c collection of autonomous nodes connected by a communication network.Message passing is the only form of communication amongnodes. The system model with d dimensions has 2^d nodes. If we number the nodes from 0 thru (2^d)-1 and look at thenumbers as d-digit binary numbers, then each node will beconnected to d other nodes which differ only in one bit. Thatis, suppose d=4 for example, then 0010 (node 2) will beconnected to 1010 (node 10), 0110 (node 6), 0000 (0) and0011 (node 3).The system model is a compound module typewhich consists of a sender (source) and receiver (sink)module.
B. The Scheduler
Scheduler has two functions, threshold estimation and decisionmaking. When a scheduler is invoked, it estimates twonumerical thresholds from the current states of uncertaintysources based on a fuzzy control base, and making schedulingand state update decision using fuzzy consistency model.We have done the implementation of scheduler on MATLAB.In fuzzy logic toolbox we have take two input parameters. Thefirst input parameter is ‘load’ and the second one is ‘Number of heavy Load Node’ and one output i.e. ‘status of load balance node’. We measure load and Number of heavy loadnode on a 0 to 10 scale and status of load balancing node on 0to 20 scale.We need to define fuzzy sets for the input parameters, ‘load’,and ‘number of heavy load node’ levels, and the output, ‘statusof load balancing node’. For this we define five membershipfunctions for first input parameter i.e. ’load’ and twomembership functions for second input parameter i.e. ‘number of heavy load node’ and two membership functions for output parameter ‘status of load balance node.’
The Threshold Estimation determines the limiting value for each membership function. Beyond this limiting value themembership function will change.
First Input parameter: Load (0-10)
Member Function 1: Very lightly (0-2)Member Function 2: lightly (1-5)Member Function 3: moderate (4-6)Member Function 4: heavy (5-9)Member Function 5: very heavy (8 -10)
Second Input Paramete
No. of heavy load node (0-5)
Member Function 1: more (0-2.5)Member Function 2: less (2.5 – 5)
Status of load balance node (0-10)
Member Function 1: receiver (0-5)Member Function 2: sender (6-10)In our work here we have taken the Gaussian distributionfunction for all the different linguistic variables for theinput “load”. This is shown in figure 1 below.
271 http://sites.google.com/site/ijcsis/ISSN 1947-5500