\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Load Balancing and Job Migration Algorithms for Autonomic Grid Environment},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Load Balancing and Job Migration Algorithms for Autonomic Grid Environment}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Paritosh  Kumar}

             \author[2]{Paritosh  Kumar}

             \author[3]{Monika  Singh}

             \affil[1]{  Ramjas College, University of Delhi}

\renewcommand\Authands{ and }

\date{\small \em Received: 7 December 2013 Accepted: 4 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Resource management and load balancing are the main areas of concern in a distributed, heterogeneous and dynamic environment like Grid. Load balancing may further cause Job migration or in some cases resubmission of Job. In this paper a number of job migration algorithms have been surveyed and studied which have resulted because of the Load balancing problem. A comparative analysis of these algorithms has also been presented which summarizes the utility and applicability of different algorithms in different environment and circumstances.

\end{abstract}


\keywords{}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
rid has a number of resources working independently with different processing capability and processes different workloads accordingly. Grid computing joins all the scattered resources into a large problem solving heterogeneous environment for different types of applications, which can run in parallel. Considering the whole distributed system as one unit, workload should be evenly distributed over all the resources as per the configuration of the system, to minimize the job execution time. Therefore, Load balancing and resource management are major areas of concern for a Grid environment.\par
Main objective of load balancing is to optimize the response time of the application by which workload would be maintained according to resources. There are broadly three reasons which are the major causes of load balancing, resubmission of jobs and job migration; heterogeneity of resources, dynamic nature of resource's performance and diversity of applications in case of Grids \hyperref[b2]{[3]}. This is even more crucial in computational Grid where the main concern is to fairly assign jobs to resources and to minimize the difference between the heaviest and the lightest resource load \hyperref[b3]{[4]}.\par
This paper presents a survey of job migration algorithms and techniques, which is done to balance the load in a Grid environment. It also compares and construes the applicability of each technique as per the requirement. The paper is organized as: Section 2 contains background of load balancing, and job migration. In Section 3, existing job migration algorithms are discussed. In the section 4, describe the proposed load balancing algorithm. Finally Section 5 concludes the paper and provides the future scope of work. 
\section[{II. Load Balancing and Job Migration}]{II. Load Balancing and Job Migration}\par
Load balancing is main area of concern in distributed environment whereas job migration is one of the best solutions to handle load balancing problems. 
\section[{a) Load Balancing}]{a) Load Balancing}\par
An important issue of distributed and heterogeneous environment is the efficient assignment of tasks and utilization of resources, commonly referred to as load balancing problem \hyperref[b12]{[13]}.\par
Load balancing is required to disperse the resource's load evenly so that maximum resource utilization and minimum task execution time could be possible. This is very crucial concern in distributed environment to fairly assign jobs to resources. Generally, load balancing mechanisms can be broadly categorized as centralized or decentralized, dynamic or static, and periodic or non periodic \hyperref[b4]{[5]}. All load balancing methods are designed such as, to spread the load on resources equally and maximize their utilization while minimizing the total task execution time. Selecting the optimal set of jobs for transferring has a significant role on the efficiency of the load balancing method as well as Grid resource utilization. This problem has been neglected by researchers in most of previous contributions on load balancing, either in distributed systems or in the Grid environment \hyperref[b6]{[7]}.\par
Job migration is the only efficient way to guarantee that submitted jobs are completed reliably and efficiently in case of process failure, processer failure, node crash, network failure, system performance degradation, communication delay; addition of new machines dynamically even though a resource failure occurs which changes the distributed environment \hyperref[b11]{[12]}.\par
Load balancing strategies aim to adapt the load optimally to the environment. However, they mainly consider the application running on a parallel, homogeneous system. 
\section[{b) Job Migration}]{b) Job Migration}\par
Grid is inherently a dynamic system where environmental conditions are subjected to unpredictable changes like system or network failures, system performance degradation, addition of new machines, variations in the cost of resources etc. Job migration is1 ( D D D D D D D D )\par
Year B the next step when there is no proper scheduling or resubmission of jobs. Whenever any resources encounter problem, then job migration to the next eligible system is suggested. Migration behavior of jobs lead to the assumption that small sites tend to migrate resourcedemanding jobs, while large sites confine to pass only small jobs to the central job pool. Job migration is the only efficient way to guarantee that the submitted jobs are completed and that the user restrictions are met \hyperref[b9]{[10]}.\par
Job migration mechanisms, which take the nondedicated and dynamic natures of Grids into consideration, become important for optimizing the application performance \hyperref[b12]{[13]}. Job monitoring, rescheduling and check pointing are some steps involved in job migration. Job monitoring contains all performance related data of all the resources so that it could initiate the migration. Further this information is reported to the rescheduler, which evaluates if it is worth Migrating the job, and in that case, decides a new allocation for the job. Check pointing is capturing a snapshot of the state of a running job, in such a way that the job can be restarted from that state in a later time in case of migration. 
\section[{III.}]{III.} 
\section[{Survey of Existing Job Migration Algorithms}]{Survey of Existing Job Migration Algorithms}\par
There are many mechanism but only five mechanism is surveyed here which is surveyed here. Which are Virtual machine migration, node reconfiguration method, check pointing, Robin-hood algorithms and load based graph method. 
\section[{a) Virtual Machine Migration (Live Migration)}]{a) Virtual Machine Migration (Live Migration)}\par
In Virtual machine migration snapshots of machine are sent to other machine that's why it is called the virtual machine migration. There are two methods for virtual machine migration. First one is live migration and second one is regular migration \hyperref[b0]{[1]}. In live migration, running domain between the different host machines is migrated without stopping the job. In between it stops job and gathers all required data then resumes. But this happens only in same layer -layer network and IP subnet. In regular migration generally stop the job then migrated.\par
An important aspect of this mechanism is to make the run-time job migration with non-dedicated shared resources in dynamic Grid environment. Virtual machine migration provides high isolation, security and customization environment in which administrator privileges the user to execute the work. Ether IP and IP tunneling are required while migrating in this mechanism. This algorithm redistributes the load coming to any particular node, which may be the old connected node or newly added node for that load. 
\section[{b) Node reconfiguration by User Level Thread Migration}]{b) Node reconfiguration by User Level Thread Migration}\par
This mechanism makes application workload migrate from source node to destination node, and then let source node depart from original computing environment .There are two mechanism for this, first one is node reconfiguration by user-level thread migration and another one is node reconfiguration by kernel level thread migration. Node reconfiguration by user level thread migration has been discussed in this survey.\par
There is two-implementation fashion of node reconfiguration. One is synchronous method and the other is asynchronous method. In synchronous method, all nodes are paused during reconfiguration. On the other hand, in asynchronous method all nodes continue to work simultaneously with reconfiguration. Synchronous method may make performance down even though it is easier to design. Alternatively, better performance can be obtained by asynchronous method as long as more attention paid to correctly maintain the order of node reconfiguration messages \hyperref[b0]{[1]}.\par
Information regarding redistribution of workload and how to add/delete nodes is present in the implementation of node reconfiguration mechanism. With the help of user level thread migration, which is already supported by the thread package workload, is redistributed here. Same as virtual machine migration, node reconfiguration mechanism also needs to transfer in memory states from source node to destination node. 
\section[{c) Check-Pointing Approach}]{c) Check-Pointing Approach}\par
Checkpoint is defined as a designated place in a program at which normal processing is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time. By periodically invoking the check pointing process, one can save the status of a program at regular intervals. If there is a failure one may restart computation from the last check point thereby avoiding repeating the computation from the beginning. The process of resuming computation by rolling back to a saved state is called rollback recovery \hyperref[b1]{[2]}.\par
There are three types of check pointing implementations: kernel-level, user-level and application level. These implementations differ in level of transparency, efficiency and mechanism used to initiate checkpoint and restart. In kernel level check pointing user does not have to change the application at all so least efficient, because system does not have the knowledge about the application. Developer achieves user level check pointing, and he puts or implements some set of procedures that handle check pointing and restart. Developer knows all about the application that's why this approach is more efficient. The developer itself achieves application-level check pointing. This approach is the most efficient, because developer has detailed knowledge about application. This is very useful in case of preemption and migration and is used in making fault tolerant systems. Most common benefit of the check pointing technology is the high level of fault tolerance offered by the applications that can be check pointed. Besides it used to recover from failures, check pointing is also used in playback debugging distributed programs, migrating processes in a multiprocessor system, software rejuvenation and optimistic simulation.\par
Check pointing balances the load of processors in a distributed system; processes are moved from heavily loaded processors to lightly loaded ones. Check pointing process periodically provides the information necessary to move it from one processor to another. 
\section[{d) Robin Hood: An Active Objects Load Balancing Mechanism for Intranet}]{d) Robin Hood: An Active Objects Load Balancing Mechanism for Intranet}\par
Robin Hood algorithms present a new totally non centralized solution, multicast channel to communicate, and synchronize the processors and proactive tools to migrate jobs between them. Proactive techniques are very useful and provide the mobility and security in uniform framework. This work focuses on dynamic load balancing. Main objective of this algorithm is to improve the decision time in non-centralized environment.\par
In this mechanism two basic things have been considered, first one to know about the local load and second one transfer the load from high dense node to the less loaded node. This uses the non-centralized architecture and non-broadcasting of the balance of each node to reduce the overload in network. This is totally non-centralized load balancing mechanism, using the proactive library for the migration of jobs, and a multicast channel for node coordination. 
\section[{e) Load Graph Based Transfer Method}]{e) Load Graph Based Transfer Method}\par
Load based graph method is based on network graph where each node is represented with its load, whereas load can be the number of users, average queue length or the memory utilization. It uses analytic model and single load determination policy throughout the system and load is determined on the basis of memory utilization and average queue length. This algorithm is based on three layered structure. Top layer is load balancing layer which takes care of token generation, taking decision about task transfer; middle one is called monitoring layer and acts as an interface between top and middle and monitors load changes and third one called communication layer which take care of actual task transfer.\par
Here token is generated on the basis of outgoing and incoming edges and initialized on the basis of some specific value HWM \& LWM (Highest Water Mark, Lowest Water Mark). Specific values are decided on the basis of load value of neighbors. Nodes having load value greater than HWM and are local maxima or nodes having load value less than LWM and are the local minima, can initiate token \hyperref[b8]{[9]}.\par
Maximum message transfer per node, if N is number of nodes and X is maximum message transfer per node Total message transfer =NX And transfer of task will occur only if there would be proper load difference between the nodes as 1. La -Lb > M where M is the required Load difference for the task transfer.\par
Token will be generated if following conditions will be satisfied 1. For nth node (Load) n > L where L is maximum Load where load balancing is not required. 2. (Load) n > ? sum of load of all nodes If both conditions are satisfied then the token is generated in more than sixty percent of the cases where load imbalance exists token finds out the proper node for the task transfer which improves the system performance \hyperref[b8]{[9]}. In this algorithm along with the task transfer among the neighboring nodes with the token transfer method care is taken to avoid the starvation of those nodes for which neighbors are not suitable for the task transfer.\par
The major parameter, network-partitioning issues along with inter-cluster and intra-cluster transfers for decision making of load balancing for the transfer is considered here. 
\section[{IV. Proposed Load Balancing Algorithm}]{IV. Proposed Load Balancing Algorithm}\par
Proposed load balancing algorithm is developed considering main characteristics like performance, throughput, and resource utilization. 
\section[{a) Architecture of Load Balancing System}]{a) Architecture of Load Balancing System}\par
This section discusses about the architecture of load balancing algorithm-imposed system. Figure  {\ref 4}.2 presents a pictorial view of the system. Monitor server uses monitoring tool to gather information about all the connected nodes. This resource information is managed, processed and updated to a database. This information is accessed through web pages and is presented to the users. The web pages can be accessed from any nodes at the same network.   
\section[{c) Complexity of Proposed Load Balancing Algorithm}]{c) Complexity of Proposed Load Balancing Algorithm}\par
Complexity is a measure of the performance of an algorithm in term of CPU time and memory usage. In this case computational complexity has been considered as this algorithm is for grid environment.  
\section[{Conclusion}]{Conclusion}\par
Load balancing is a key issue in grid resource management and results in job migration or resubmission of job. In this paper load balancing and job migration algorithms have been surveyed and studied which have been designed for different scenarios. Based on all these algorithms new algorithm have been introduced, considering main characteristics like performance, throughput, and resource utilization.\par
Different algorithms do well in their respective contexts like multiple token policy results in optimal resource selection and minimum migration time where as Robin-hood provides better security and checkpointing provides good results for fault tolerant systems. \begin{figure}[htbp]
\noindent\textbf{41}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 4 . 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{42}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 4 . 2 b}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Ferreira et al.]{b10}\label{b10} 	 		\textit{},  		 			Luis Ferreira 		,  		 			Viktors Berstis 		,  		 			Jonathan Armstrong 		,  		 			Mike Kendzierski 		,  		 			Andreas Neukoetter 		,  		 			Richard Takagi 		,  		 			Adeeb Bing-Wo 		,  		 			Ryo Amir 		,  		 			Murakawa 		,  		 			Olegario 		,  		 			James Hernandez 		,  		 			Magowan 		.  		Norbert Bieberstein.  	 	 (Red Books" ibm.com/Redbooks) 
\bibitem[Lan and Yu ()]{b4}\label{b4} 	 		‘A Dynamic Central Scheduler load-Balancing Mechanism’.  		 			Y Lan 		,  		 			T Yu 		.  	 	 		\textit{Proc. 14th IEEE Conf. on Computers and Communication},  				 (14th IEEE Conf. on Computers and CommunicationTokyo, Japan)  		1995. p. .  	 
\bibitem[Chen et al.]{b0}\label{b0} 	 		‘A Performance Study of Virtual Machine Migration vs Thread Migration for Grid Systems’.  		 			Po-Cheng Chen 		,  		 			-I Cheng 		,  		 			Sheng-Wei Lin 		,  		 			Jyh-Biau Huang 		,  		 			Ce-Kuen Chang 		,  		 			Tyng-Yeu Shieh 		,  		 			Liang 		.  	 	 		\textit{22nd International Conference on Advanced Information Networking and Applications -Workshops},  				 	 
\bibitem[Kalaiselvi and Rajaraman (2000)]{b1}\label{b1} 	 		‘A Survey of Check-Pointing Algorithms for Parallel and Distributed Computers" v ol’.  		 			S Kalaiselvi 		,  		 			Rajaraman 		.  	 	 		\textit{Part}  		October 2000. 25 p. .  	 
\bibitem[Mohsen Amini Salehi Hamid Tabatabaee Yazdi, Mohammad Reza Akbarzade Toutoonchi (ed.)]{b5}\label{b5} 	 		\textit{An Optimal Job Selection method in Load Balancing Algorithms of Economical Grids},  		Mohsen Amini Salehi Hamid Tabatabaee Yazdi, Mohammad Reza Akbarzade Toutoonchi (ed.)  		 	 
\bibitem[Mohsen Amini Salehi and Deldari]{b3}\label{b3} 	 		\textit{Balancing Load in a Computational Grid Applying Adaptive, Intelligent Colonies of Ants},  		 			Hossein Mohsen Amini Salehi 		,  		 			Deldari 		.  		 	 
\bibitem[Yagoubi and Slimani (2006)]{b11}\label{b11} 	 		‘Dynamic Load Balancing Strategy for Grid Computing’.  		 			Belabbas Yagoubi 		,  		 			Yahya Slimani 		.  	 	 		\textit{Proceedings of World Academy of Science, Engineering and Technology}  		 1307-6884.  		May 2006. 13.  	 
\bibitem[Yagoubi]{b2}\label{b2} 	 		‘Hadj Tayab Lillia and Halima Si Mo ussa’.  		 			Belabbas Yagoubi 		.  	 	 		\textit{Load Balancing in Grid Computing},  				 	 
\bibitem[Jankowski and Januszewski (2008)]{b7}\label{b7} 	 		\textit{Improving the fault-tolerance level within the GRID computing environmentintegration with the low-level check pointing packages" Core Grid},  		 			Gracjan Jankowski 		,  		 			Radoslaw Januszewski 		.  		 TR-0158.  		June 16. 2008.  	 	 (Rafal Mikolajczak Poznan) 
\bibitem[Moreno and Alonso-Conde ()]{b9}\label{b9} 	 		‘Job Scheduling and Resource Management Techniques in Dynamic Grid Environments’.  		 			Rafael A Moreno 		,  		 			Ana B Alonso-Conde 		.  	 	 		\textit{LNCS}  		2004. 2970.  	 
\bibitem[Rips ()]{b6}\label{b6} 	 		‘Load Balancing Support for Grid-enabled Applications’.  		 			S Rips 		.  	 	 		\textit{NIC Series}  		2006. 33 p. .  	 
\bibitem[Neeraj Nehra et al. ()]{b12}\label{b12} 	 		‘Load Balancing with fault tolerance and Optimal Resource Utilization in grid Computing’.  		 			R B Neeraj Nehra 		,  		 			V K Patel 		,  		 			Bhat 		.  	 	 		\textit{Information Technology Journal}  		2007. 6 p. .  	 
\bibitem[Kulkarni and Sengupta]{b8}\label{b8} 	 		\textit{Load Balancing with Multiple Token policy},  		 			Parag Kulkarni 		,  		 			\& Indranil Sengupta 		.  		 	 
\end{bibitemlist}
 			 		 	 
\end{document}
