\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={Resource Management in Grid Computing: A Review},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Resource Management in Grid Computing: A Review}
\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]{Sunita  Rani}

             \author[2]{  P.K.Suri}

             \affil[1]{  BPSMV, Khanpurkalan, Sonepat, Haryana, India}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


A Network Computing System is a virtual computer formed by a networked set of heterogeneous machines that agree to share their local resources with each other. A grid is a very large scale network computing system that scales to internet size environments with machines distributed across multiple organizationsand administrative domains. The resource management system is the central component of grid computing system. Resources in the grid are distributed, heterogeneous, autonomous and unpredictable. A resource management system matches requests to resources, schedules the matched resources, and executes the requests using scheduled resources. Scheduling in the grid environment depends upon the characteristics of the tasks, machines and network connectivity. The paper provides a brief overview of resource management in grid computing considering important factors such as types of resource management in grid computing, resource management models and comparison of various scheduling algorithm in resource management in grid computing.

\end{abstract}


\keywords{grid computing, resource management, scheduling algorithms.}

\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 Computing is coordinated resource sharing and problem solving in dynamic, Multiinstitutional virtual organizations \hyperref[b0]{[1]}.Grid Computing is the flexible, secure, and coordinated sharing of resources among dynamic collections of individuals, institutions, and resources \hyperref[b1]{[2]}.The resource management is the central to the operation of a grid. The basic function of resource management is to accept requests for resources from machines with in the grid and assign specific machine resources to a request from the overall pool of grid resource for which the user has access permission. A resource management system matches requests to resources, schedules the matched resources, and executes the requests using the scheduled resources. Grid resources are the entities such as processor, disk space, memory space, network bandwidth etc. that are managed by the resource management system. The grid resource scheduling process can be defined as the process of matching a query for resources, described in terms of required characteristics, to a set of resources that meet the expressed requirements. Job scheduling is the mapping of jobs to specific physical resources, trying to minimize some cost function specified by the user. 
\section[{II.}]{II.} 
\section[{Related Work}]{Related Work}\par
There have been some studies on survey and taxonomy of grid resource management. The most popular is done by Klaus Krauter and RajKumar Buyya \hyperref[b2]{[3]}, it described an abstract model and defined various concepts and terminologies for describing resource management architecture for grid computing. The work is also done by \hyperref[b3]{[4]} for grid resource management system, it described issues and functions for GRMS and survey various grid resource management system. In 2010, Bo Wang, Gang Chen \hyperref[b4]{[5]} presented various grid resource management models and context for grid resource management system. In 2010, \hyperref[b5]{[6]} surveyed the various job scheduling and resource scheduling in grid computing. Scheduling experiments are performed with the help of GridSim simulator by setting the values to the number of jobs and processing time is recorded to analyze the feasibility of algorithm. In 2010, \hyperref[b6]{[7]} surveyed and simulate various job scheduling strategies in grid computing environment. Also compare various jobs scheduling algorithm considering various parameters like type of scheduling model, type of resources that particular job scheduling algorithm favors(i.e. heterogeneous or homogenous), response time, load balancing, etc. In 2012, Isah Abdul Azeez and Safwana Haque \hyperref[b7]{[8]} have given a review for resource management in grid computing and described resource management concepts. 
\section[{III. Types of Grid Resource Management}]{III. Types of Grid Resource Management}\par
SLA-supported Resource Management: This architecture reflects the business needs of service provider and aims at a more automatic and autonomous resource configuration through the introduction of a Conversion Factory \hyperref[b8]{[9]}. Service Level Agreements with the aid of formalized business goals (Business Level Objectives), complexity analyses, and knowledge of previous configurations. 
\section[{Agent-based Grid Resource Management:}]{Agent-based Grid Resource Management:}\par
Agent-based approach for resource management \hyperref[b9]{[10]} is flexible, robust, and scalable. Resource Management agents match requests to available resources and( D D D D D D D D )\par
arbitrate between requests with respect to Business Values. Each agent implements one or more allocation semantics, and advertises its capabilities to the Naming/Discovery service. Their behavior depends on the allocation semantic they implement and extends the basic behavior consisting in matching a requested resource profile with an available resource within its set of primary resources.\par
An Enterprise-Based Grid Resource Management System: An Enterprise based resource management system \hyperref[b10]{[11]} is highly scalable resource management system built using COTS (Commercial Off-The-Shelf) components used in web server infrastructures. The web services and enterprise components constituted the core of the system that provides fault tolerance as well as high performance and scalability. 
\section[{Agreement-Based Resource Management:}]{Agreement-Based Resource Management:}\par
Agreement based resource management is on the basis of standards activities and next generation resource management services \hyperref[b11]{[12]}. Agreements abstract local management policy by representing an underlying resource strictly in terms of policy terms which it is willing to assert, and in doing so provides the basis for building a variety of alternative grid resource management strategies. An agreement provides a powerful mechanism for virtualizing or abstracting a resource. A resource may have complex internal policy for deciding permission, relative priorities, and other scheduling and management procedures. 
\section[{Grid Resource Management based on P2P}]{Grid Resource Management based on P2P}\par
Technology: A resource management approach in grid computing environment based upon P2P technology \hyperref[b12]{[13]} can manage dynamic grid computing resources efficiently. Different kinds of grid computing resources are organized into a P2P overlay network and available information is published in type of grid service. With this approach, the computational resources of a grid system can be scheduled dynamically according to the realtime workload on each peer. The application of this approach is introduced into DDGRID (Drug Discovery GRID), a grid system for drug discovery and design, to evaluate the performance.\par
Failure-Aware Grid Resource Management System: Novel load-based failure recovery strategy used in the Virtual Resource Management framework \hyperref[b13]{[14]}. The mechanism is applicable in any environment where distributed resources must be managed and failures of the system are critical, e.g. Service Level Agreements are given for the correct and complete execution of a job. Given approach adapts to the actual load situation and determines a remapping interval accordingly, which diminishes the danger of underestimating failure durations as any job is remapped before it is actually endangered of being terminated.\par
A Scalable wide-area Grid Resource Management Framework: A scalable wide-area grid resource management framework \hyperref[b14]{[15]} is a hierarchical framework that permits wide-area grid resource management. The framework uses a hierarchical organization of resource managers. The hierarchy is composed of multiple levels of resource managers, similar to business and government organizations. Resources are assigned to jobs through decentralized inter and intra organizational collaborations between resource managers. 
\section[{Semantically}]{Semantically}\par
Enhanced Grid Resource Management: Semantic based Grid Resource Management(S-GRM) \hyperref[b15]{[16]} system utilizes semantic metadata to describe and discover both logical and physical resources. The system integrates the component search into existing Grid application development environment and discovery of nodes in resource manager in a comprehensive perspective.\par
HRMF-G: a Grid based Hierarchical RM Framework: Hierarchical Resource Management framework \hyperref[b16]{[17]} effectively resolved the bottleneck problem in the centralized resource management mode and non-reliability problem in the distributed resource management mode, and also resolved the load imbalance problem and other problems in the centralized resource schedule mode and the distributed resource schedule mode. 
\section[{Performance}]{Performance}\par
based Grid Resource Management: A Generalized Stochastic PetriNet (GSPN) model is for performance evaluation of grid \hyperref[b17]{[18]}. In this model, three roles are defined: Users (U), Resource Management System (RMS), and Resources(R). All resource requests by users are to be submitted to some resource management system, instead of directly to resources. The mapping of users to RMS's and resources to RMS's are assumed to be both n to 1, which means that each users always chooses a preferable designated RMS to submit their tasks to, and each resource is directly managed by only one RMS. 
\section[{IV. Resource Management Models}]{IV. Resource Management Models}\par
Model of resource management gives information regarding the relationship between users and resources provider, how resources are chosen for users, how resources are allocated. There are several different models for grid resource management system and these several different models may be used in the same system. a) Economic Model for GRM It provides a decentralized resource management capability and is adaptable to changes in the environment and user requirements. It is scalable, controllable, measurable and easily understandable policy for management of resources. There are \hyperref[b18]{[19]} several market-based economic models such as a commodity market, tenders and auctions along with the( D D D D D D D D )\par
architecture and algorithms for their implementation in grid computing systems. b) Architectural Models for GRM For the architecture of grid resource management three different models are \hyperref[b19]{[20]}: Hierarchical Model, Abstract Owner Model and Market Model. The hierarchical model exhibits the approach followed in many contemporary grid systems. The abstract owner model follows an order and delivery approach in job submission and result gathering. The market/economy model follow economic model in resource discovery and scheduling that can coexist or work with contemporary systems and captures the essence of both hierarchical and abstract owner models. 
\section[{c) Pricing Model for GRM}]{c) Pricing Model for GRM}\par
This price model for grid resources \hyperref[b20]{[21]} is based upon the theory of financial option. The use of option value computation is for grid resources usage and to select the best point of exercise of the option to utilize any of the grid resources. This helps the user as well as the grid resources provider to optimize resources for profitability. A price varying function which controls the price of resources and ensure the grid users get the maximum at best prices and the resources provider also make reasonable revenue at the current base price setting. A price variant function in price model is to adjust the charges for resources at various times so that the grid remains busy. This function helps the resource provider in keeping the grid busy and recovering the investment on the infrastructure in a predetermined period of time. 
\section[{d) Resource Management Model of Electric Power System Based on Grid Technology}]{d) Resource Management Model of Electric Power System Based on Grid Technology}\par
A resource management model of power system based on grid technology \hyperref[b21]{[22]} can fully use computer hardware infrastructure and provide a favorable support for large scale computing environment in electric power system. This model consists of two independent parts: management node and computing node. As a center node, management node is responsible for the maintenance of grid users and resource information, safety management, job scheduling, the job monitor, task decomposition and transmission computing result collection and so on. Computing node receives computation tasks from the management node, and generates intermediate results. 
\section[{e) Resource Management Model Based on P2P Technology}]{e) Resource Management Model Based on P2P Technology}\par
Web services grid resource management and discovery model based on P2P technology \hyperref[b22]{[23]} applies the semantic web technology and P2P technology to the grid resource search, improves the retrieving utilization, search speed and precision rate of grid resources and better solves the system expandability and reliability.\par
This model is divided into two layers. The under layer is composed of Web Service Resource Providers (WSRP) nodes, called WSRP network. The upper layer is structural P2P networks, composed of Web Service Resource Register and Inquiry Broker (WSRRAIB) nodes with high reliability, long online time and less variation, called WSRRAIB network.\par
V. 
\section[{Scheduling}]{Scheduling}\par
In grid environment, to schedule resources and jobs, certain scheduling components are required which decides which resources are assigned to which jobs. Assignment of resources to job can be explicitly and implicitly. Explicitly assignment can be specified by external rules base or programmable interface. Implicitly assignment can be implemented by choice of state estimation algorithms and rescheduling approaches. 
\section[{a) Scheduler}]{a) Scheduler}\par
The function of the scheduler as task allocation or task mapping in distributed computing system. It should be noted that multiple tasks from various users are submitted on any nodes of the distributed computing system from time to time. The scheduler must also accommodate this multiplicity of the disjoint task. Characteristic parameters for any scheduler are: turnaround time, throughput and interactive response time.\par
Turnaround time is a task oriented characteristics that considers the time duration between submission and completion of a task. Obviously, it will be desirable to minimize this time.\par
Throughput of the system is a characteristic that measures the number of tasks successfully executed in unit time. This quantity must be maximized. Interactive response is about the requirement of interactive users during the execution of the tasks. Scheduler is responsible for resource discovery, resource trading, resource selection and job assignment. 
\section[{b) Scheduling Model}]{b) Scheduling Model}\par
Scheduling models describes structure of resource management system \hyperref[b3]{[4]} and scalability of system.\par
Scheduling models can be classified as centralized, hierarchical or decentralized.\par
i. Centralized Scheduling Model: In centralized scheduling model, all jobs are submitted to a single scheduler who is responsible for scheduling them on the available resources. Since all the scheduling information is available at one single position the scheduling decision are optimal but this approach is not very scalable in a grid system.\par
ii. Decentralized Scheduling Model: In decentralized scheduling model, there is no central scheduler, scheduling is done by the resource requestor and owners independently. This approach is scalable( D D D D D D D D )\par
Year and suits grid systems. But individual schedulers should cooperate with each other in making scheduling decisions and the schedule generated may not be the optimal schedule.\par
iii. Hierarchical Scheduling Model: In this model, the schedulers are organized in a hierarchy. High level resource entities are scheduled at higher levels and lower level smaller sub-entities are scheduled at lower levels of the scheduler hierarchy. This model is a combination of above two models. c) Scheduling Algorithms i. Capacity Planning and Stochastic Scheduling in Large-Scale Grids (CPSS)\par
Capacity Planning and Stochastic Scheduling \hyperref[b23]{[24]} is very efficient and scalable approach that lead to increased resource utilization, lower cost per workflow execution and the ability to solve huge problem sizes. Capacity Planning and Stochastic Scheduling is used for large scale grid computing infrastructures that aims to minimize the cost of application execution while ensuring that Quality of Service constraints are satisfied with desired confidence levels. This Scheduling formulation is based on queuing theory to specify the stochastic nature of the grid. In modeling the grid as a queuing network make able to use more accurate forecasting mechanisms to determine workload and its behavior which improves our ability to negotiate for advance reservations and grid futures. In this scheduling, the job of the scheduler is to select a set of resources onto which to schedule the tasks and manage an application, coordinate the execution of the tasks and manage the data distributions and communication between the tasks. Here, problem formulation implicitly performs capacity planning in that it assigns just enough resources to be able to handle the total service workload, while minimizing the cost of resources. 
\section[{ii. Stochastic Model and Evolutionary Optimization}]{ii. Stochastic Model and Evolutionary Optimization}\par
Algorithm for Grid Scheduling (SMEOA)\par
Stochastic Model and Evolutionary Optimization Algorithm for grid scheduling \hyperref[b24]{[25]} address the issues of uncertainty or randomness of sources. Uncertainty of sources has major impact include machine breakdowns, unexpected releases of high priority jobs, network status and soon. A new stochastic model for grid scheduling and a novel evolutionary scheduling algorithm is based on MSE (Minimum Stochastic Expectation) model.A resource Use Pattern Analysis (UPA) method to predict resources and grid QoS policy bring resources to improve grid efficiency.\par
iii. Research on Novel Dynamic Resource Management and job scheduling in grid computing (RNDRM) This scheduling model is based on Heap Sort Tree (HST) \hyperref[b25]{[26]} for computing the available computational power of the nodes (resource) as well as whole grid system. Here the resource with largest available computational ability among the whole grid system is selected to be the root node of the HST and it is ready for the scheduler to submit a job. The algorithm design for job scheduling is well suitable for the complex grids environment and it is based on agents. iv. Virtual Computing Grid using Resource Pooling (VCGRP)\par
The System is based on loosely coupled concept. Virtual Computing Grid means the system can choose a resource and allocate tasks to it. Here, it is a single point web based access known as Virtual Computing Grid Portal and the Virtual Computing Grid Monitor is a central resource manager for the System \hyperref[b26]{[27]}.\par
v. A Grid-distance Based Scheduling for Grid Resource Management (GDBS)\par
Resource scheduling algorithm model based on grid distance \hyperref[b27]{[28]}, which can optimize scheduling by using close resources in the grid resource scheduling. This is especially important in terms of establishing lasting and numerous relationships between consumer and providers, for it helps form more effective VOs (Virtual Organizations).In resource scheduling, choosing near and low-cost resources using grid-distance as a key criterion improves the performance of grid resource scheduling and has better characteristics in executing tasks, which achieves the aim of scheduling optimization.Therefore, the strategies based on the grid distance scheduling are:\par
1. Achieving the aim of choosing the physically closer resource and show the advantage of closer resource in terms of completing time, communication reliability and cost; 2. The closer resource is obviously more stable in communication;\par
3. Optimizing the whole grid resource scheduling based on grid distance scheduling so as to improve the capacity of grid in dealing with job in unit time.\par
vi. Resource-cost-based Multi-agent Systems Scheduling for Grid Resource Management (RCBMAS) A multi-agent systems resource management method in Grid environment fully utilizes the agent's autonomy, heterogeneity and distribution etc. to cooperate jobs in the Grid environment. The method utilizes resource-cost-based Grid resource scheduling algorithm \hyperref[b28]{[29]} to find the most appropriate resource for each Grid task. Resource-cost is a triple, represented as physical distance, bandwidth available of communication network and the use cost .The first is a constant and the others vary with both the communication load and the relationship between supply and requirement. Assume A,B are two entities which A is the job and B is the node that provides resource in Grid, RC(A,B) is the Resource-cost between them, and then RC(A,B) = ?f(d is , a v -band, cost) .Here dis, av-band and cost denote physical distance, available bandwidth and cost respectively.\par
Resource-cost-based scheduling algorithm due to the dynamic characteristics of the resource and nodes in Grid and the fact that the resource-cost varies with the time, a satisfactory threshold cannot be determined. However, it should be the minimum one chosen from the resources available. There are two choices to find the shortest path of Grid resource graph: depth-limited search and the non-depth-limited search. Therefore, the corresponding algorithms are called the depth-limited algorithm and the free algorithm. The free algorithm is the one used in freely calculating the resource-cost for the candidate resources in the whole Grid. 
\section[{vii. Market-driven}]{vii. Market-driven}\par
Based Resource Scheduling Algorithm in Computational Grid (MDBRS) In resource management system based on economy model, resource provider is defined as producer, and resource user is defined as consumer. Producers and consumers become individuals in economic environment, and each individual has their own target and strategy. Market-driven resource management and scheduling system \hyperref[b29]{[30]} should maximize profit of each individual. The strategy of consumer is to use lowest expense to solve his problem, while the strategy of producer is to attract more consumers and makes his profit maximum. Resource owners or provider determine the price of their resources, and charge customers for consuming the resource. Pricing strategy is that price depends on some factors, and price can be fixed or fluctuates as the changing of supply and demand. A Grid resource scheduling algorithm based on market-driven using dynamic resource price-adjusting (RPA) strategy. RPA-Cost Optimization and RPA-Time Optimization scheduling algorithm are based on a dynamic /priceadjusting strategy, which introduces the concept of central price, the fluctuant factor of price, and the lifetime of price; the performance evaluation standard of load balance for Grid system is defined using a load balance factor. 
\section[{viii. BMQOS: A General Self-Adaptive Global Resource}]{viii. BMQOS: A General Self-Adaptive Global Resource}\par
Scheduling Algorithm for Computational Grid\par
The process of computational grid resource scheduling generally falls into two phases: global resource scheduling and local resource scheduling. Under this pattern, global resource scheduling algorithms are different from the traditional resource scheduling algorithms of LRMS (local resource management system, LRMS).A general self-adaptive global resource scheduling algorithm for Computational Grid \hyperref[b30]{[31]}, BMQOS (Best Multi QOS) specifies the personal resource requirement of a computational grid job, BMQOS can globally self adaptively weigh every index of the MQOS of candidate computational grid nodes and choose an appropriate node for a job from the candidates finally. Especially by adjusting a weight vector, w= (w1, w2 ? wn) T, it can better meet a job's personal resource requirement and enhance run-time benefit of Computational Grid. ix. 2-Phase Trust-Based Scheduling (2PTBS) 2-Phase Scheduling: Since grid computing system is an Internet-based, distributed computing platform, it involves not only LANs, but hosts in every LAN also. According to so, when a scheduling is put to a computing task, it must be considered to schedule not only a certain LAN with a certain algorithm, but also a certain host in LAN with other algorithms. So a certain scheduling process can be divided into two levels:External Scheduling: WAN-scope, the first subtask level, distributed scheduling; Internal Scheduling: LANscope, the second subtask level, concentrated scheduling.\par
2-Phase Trust-Based Scheduling: 2-Phase scheduling algorithm \hyperref[b31]{[32]} is the right one to show out the hierarchy explicitly.2-Phase Trust-Based Scheduling Algorithm (2PTBSA) is to avoid unstable nodes during computing progress, and to enhance the total computing efficiency, by the filtration with the mechanism of trust, on the premise of better descriptions of the complexity and hierarchy.\par
x. Resource Discovery Algorithm Based on Small-World Cluster in Hierarchical Grid Computing Environment (RDA) Small-world cluster into hierarchical grid in which intra-cluster adopts centralized management and cluster center nodes form small-world network. The architecture strikes a balance between high efficiency of total centralized management and good scalability of absolute distributed disposal. In the process of constructing small-world network, a new construction method on the basis of NW (Newman-Watts) model is short range contacts and long range contacts are represented by routing tables in a logic and dynamic way not by Manhattan distance. Hierarchical architecture based on small-world cluster and SWRD algorithm used in education resource grid have high search success rate and low query cost, where small world and resource discovery make perfect combination. There exists no bottleneck and central database, and system is scalable and reliable. Discovering resources according to different situations is in fact another expression of distribution \hyperref[b32]{[33]}. 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Conclusion}]{Conclusion}\par
In this paper, a review of resource management system in grid computing is presented. Various types of resource management in grid computing and various models for resource management in grids computing are discussed. Various scheduling algorithm in grid computing have been analyzed. A comparison on various parameters like architecture type, environment type (Heterogeneous or Homogeneous), response time, load balancing, and resource utilization is done on different types of job scheduling.			 			  				\begin{bibitemlist}{1}
\bibitem[Ma et al. ()]{b32}\label{b32} 	 		\textit{},  		 			Yan Ma 		,  		 			Bin Gong 		,  		 			Lida Zou 		.  	 	 		\textit{Resource Discovery Algorithm Based on Small-World Cluster in Hierarchical Grid Computing Environment}  		2008.  	 
\bibitem[Chen et al. ()]{b12}\label{b12} 	 		‘A Grid Resource Management Approach Based on P2P Technology’.  		 			Shudong Chen 		,  		 			Xuefeng Du 		,  		 			Fanyuan Ma 		,  		 			Jianhua Shen 		.  	 	 		\textit{Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)},  				 (the Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05))  		2005.  	 
\bibitem[Manfu et al. ()]{b27}\label{b27} 	 		‘A Grid-distance Based Scheduling for Grid Resource Management’.  		 			M A Manfu 		,  		 			W U Jian 		,  		 			Shuyu Li 		,  		 			Chen Dingjian 		,  		 			H U Zhengguo 		.  	 	 		\textit{Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)},  				 (the Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05))  		2005.  	 
\bibitem[Zhu Youchan and Juanhua ()]{b22}\label{b22} 	 		‘A P2P based Web service grid resources management model’.  		 			Bai Zhu Youchan 		,  		 			Juanhua 		.  	 	 		\textit{International Conference on Intelligent Computation Technology and Automation},  				2010.  	 
\bibitem[El-Darieby and Krishnamurthy ()]{b14}\label{b14} 	 		\textit{A Scalable Wide-Area Grid Resource Management Framework},  		 			Mohamed El-Darieby 		,  		 			Diwakar Krishnamurthy 		.  		2006.  	 
\bibitem[Sharma et al. ()]{b5}\label{b5} 	 		‘A Survey of Job Scheduling and Resource Management in Grid Computing’.  		 			Raksha Sharma 		,  		 			Kant Vishnu 		,  		 			Manoj Soni 		,  		 			Prachet Kumar Mishra 		,  		 			Bhuyan 		.  	 	 		\textit{World Academy of Science, Engineering and Technology}  		2010. 64.  	 
\bibitem[Krauter et al.]{b2}\label{b2} 	 		\textit{A Taxonomy and Survey of Grid Resource Management Systems},  		 			Klaus Krauter 		,  		 			Rajkumar Buyya 		,  		 			Muthucumaru Maheswaran 		.  		 	 
\bibitem[Wang et al. ()]{b4}\label{b4} 	 		‘A Taxonomy and Survey of Resource Management in Grid’.  		 			Bo Wang 		,  		 			Gang Chen 		,  		 			Hao Luo 		,  		 			Weimin Zheng 		.  	 	 		\textit{Sixth International Conference on Semantics, Knowledge and Grids},  				2010.  	 
\bibitem[Lenica et al.]{b9}\label{b9} 	 		\textit{Agentbased Grid Resource Management},  		 			A Lenica 		,  		 			F Ogel 		,  		 			F Peshanski 		,  		 			J.-P Briot 		.  		 	 
\bibitem[Czajkowski et al. ()]{b11}\label{b11} 	 		‘Agreement-Based Resource Management’.  		 			Karl Czajkowski 		,  		 			Ian Foster 		,  		 			Carl Kesselman 		.  	 	 		\textit{PROCEEDINGS OF THE IEEE}  		MARCH 2005. 93  (3) .  	 
\bibitem[Vishnu Kant Soni et al. ()]{b6}\label{b6} 	 		‘An Analysis of Various Job Scheduling Strategies in Grid Computing’.  		 			Raksha Vishnu Kant Soni 		,  		 			Manoj Sharma 		,  		 			Kumar Mishra 		.  	 	 		\textit{2nd international Conference on Signal Processing systems(ICSPS)},  				2010.  	 
\bibitem[Snell et al. ()]{b10}\label{b10} 	 		‘An Enterprise-Based Grid Resource Management System’.  		 			Quinn Snell 		,  		 			Kevin Tew 		,  		 			Joseph Ekstrom 		,  		 			Mark Clement 		.  	 	 		\textit{Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing HPDC-11 2002(HPDC'02)},  				 (the 11th IEEE International Symposium on High Performance Distributed Computing HPDC-11 2002(HPDC'02))  		2002.  	 
\bibitem[Buyya et al.]{b19}\label{b19} 	 		\textit{Architectural Models for Resource Management in the Grid},  		 			Rajkumar Buyya 		,  		 			Steve Chapin 		,  		 			David Dinucci 		.  		 	 
\bibitem[Liang et al. ()]{b30}\label{b30} 	 		‘BMQOS: A General Self-Adaptive Global Resource Scheduling Algorithm forComputational Grid’.  		 			Liu Liang 		,  		 			Zhou Xing-She 		,  		 			Liu Qiu-Rang 		,  		 			Wang Tao 		,  		 			Yang Zhi-Yi 		.  	 	 		\textit{Proceedings of the First International Conference on Semantics, Knowledge, and Grid (SKG 2005)},  				 (the First International Conference on Semantics, Knowledge, and Grid (SKG 2005))  		2006.  	 
\bibitem[Burchard et al. ()]{b13}\label{b13} 	 		 			Lars-Olof Burchard 		,  		 			A F C´esar 		,  		 			Hans-Ulrich De Rose 		,  		 			Barry Heiss 		,  		 			J¨org Linnert 		,  		 			Schneider 		.  		\textit{VRM: A Failure-Aware Grid Resource Management 2 E Table : Comparison Of Various Job And Resource Scheduling Algorithms Parameter Paper Architecture Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05)},  				2005.  	 
\bibitem[Afzal et al. ()]{b23}\label{b23} 	 		‘Capacity Planning and Stochastic Scheduling in Large-Scale Grids’.  		 			Ali Afzal 		,  		 			John Darlington 		,  		 			A Stephen Mcgough 		.  	 	 		\textit{Proceedings of the Second IEEE International Conference on e-Science and Grid Computing},  				 (the Second IEEE International Conference on e-Science and Grid Computing)  		2006.  	 
\bibitem[Buyya et al. ()]{b18}\label{b18} 	 		‘Economic models for resource management and scheduling in Grid computing’.  		 			Rajkumar Buyya 		,  		 			David Abramson 		,  		 			Jonathan Giddy 		,  		 			Heinz Stockinger 		.  	 	 		\textit{Concurrency and Computation: Practice and Experience},  				2002. p. .  	 
\bibitem[Allenotor et al. ()]{b20}\label{b20} 	 		‘Evaluation of a Financial Option Based Pricing Model for Grid Resources Management: Simulation vs. Real Data’.  		 			David Allenotor 		,  		 			K Ruppa 		,  		 			Thulasiram 		.  	 	 		\textit{12th IEEE International Conference on High Performance Computing and Communications},  				2010.  	 
\bibitem[Blatecky (2002)]{b1}\label{b1} 	 		‘Grid Computing’.  		 			Alan Blatecky 		.  	 	 		\textit{EDUCAUSE Center for Applied Research}  		2002. September 3, 2002.  (17) .  	 	 (Research Bulletin) 
\bibitem[Hasselmeyer et al.]{b8}\label{b8} 	 		 			Peer Hasselmeyer 		,  		 			Bastian Koller 		,  		 			Lutz Schubert 		,  		 			Philopp Wieder 		.  		\textit{Towards SLA-supported Resource Management},  				 	 
\bibitem[Kun et al. ()]{b16}\label{b16} 	 		\textit{HRMF-G: A Grid-Based Hierarchical Resource Management Framework},  		 			Wang Kun 		,  		 			Guo Qiang 		,  		 			Zhang Hengwei 		,  		 			Wang Jindong 		.  		2011.  	 
\bibitem[Tang et al. ()]{b29}\label{b29} 	 		‘Market-driven Based Resource Scheduling Algorithm in Computational Grid’.  		 			Bing Tang 		,  		 			Zude Zhou 		,  		 			Quan Liu 		,  		 			Fangmin Li 		.  	 	 		\textit{International Conference on Computer Science and Software Engineering},  				2008. 2008.  	 
\bibitem[Hong et al. ()]{b17}\label{b17} 	 		‘Performance Modeling of Grid Resource Management and Scheduling Systems’.  		 			Ye Hong 		,  		 			Chuang Lin 		,  		 			Yang Qu 		,  		 			Zhiguang Shan 		.  	 	 		\textit{Proceedings of the First International Conference on Semantics, Knowledge, and Grid (SKG 2005)},  				 (the First International Conference on Semantics, Knowledge, and Grid (SKG 2005))  		2006.  	 
\bibitem[Li et al. ()]{b25}\label{b25} 	 		‘Research on Novel Dynamic Resource Management and Job Scheduling in Grid Compuing’.  		 			Fufang Li 		,  		 			Deyu Qi 		,  		 			Limin Zhang 		,  		 			Xianguang Zhang 		,  		 			Zhili Zhang 		.  	 	 		\textit{IEEE Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences},  				2006.  	 
\bibitem[Luo et al. ()]{b31}\label{b31} 	 		‘Resource Management and Task Scheduling in Grid Computing’.  		 			Junzhou Luo 		,  		 			Peng Ji 		,  		 			Xiaozhi Wang 		,  		 			Ye Zhu 		,  		 			Feng Li 		,  		 			Teng Ma 		,  		 			Xiaopeng Wang 		.  	 	 		\textit{The 8th International Conference on Computer Supported Cooperative Work in Design Proceedings},  				2003.  	 
\bibitem[Isah et al. (2012)]{b7}\label{b7} 	 		‘Resource Management in Grid Computing’.  		 			Abdul Isah 		,  		 			Safwana Azzez 		,  		 			Haque 		.  	 	 		\textit{Greener Journal of Science and Technological Research}  		 2276-7835.  		April, 2012. 2  (1)  p. .  	 
\bibitem[Gao et al. ()]{b21}\label{b21} 	 		‘Resource Management Model of Electric Power System Based on Grid Technology’.  		 			Lisha Gao 		,  		 			Yong Hu 		,  		 			Dahong Zhou 		.  	 	 		\textit{China International Conference on Electricity Distribution},  				2010.  	 
\bibitem[Xiaoqing and Jia ()]{b28}\label{b28} 	 		‘Resource-cost-based Multi-agent Systems Scheduling for Grid Resource Management’.  		 			Hao Xiaoqing 		,  		 			Chen Jia 		.  	 	 		\textit{International Conference on Computer Application and System Modeling (ICCASM 2010)},  				2010. 2010.  	 
\bibitem[Qadir et al. ()]{b15}\label{b15} 	 		‘Semantically Enhanced Grid Resource Management’.  		 			Kamran Qadir 		,  		 			Falak Nawaz 		,  		 			Raihan Ur Rasool 		,  		 			H Farooq Ahmad 		,  		 			Shahid Mahmood 		.  	 	 		\textit{Fourth International Conference on Semantics, Knowledge and Grid},  				2008.  	 
\bibitem[Seventh International Conference on Grid and Cooperative Computing ()]{b33}\label{b33} 	 		\textit{Seventh International Conference on Grid and Cooperative Computing},  				2008.  	 
\bibitem[Shi and Zhao ()]{b24}\label{b24} 	 		‘Stochastic Model and Evolutionary Optimization Algorithm for Grid Scheduling’.  		 			Xuelin Shi 		,  		 			Ying Zhao 		.  	 	 		\textit{Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2010)},  				2010. 2010.  	 
\bibitem[Kandagatla]{b3}\label{b3} 	 		\textit{Survey and Taxonomy of Grid Resource Management Systems},  		 			Chaitanya Kandagatla 		.  		 	 
\bibitem[Rajan et al. ()]{b26}\label{b26} 	 		‘Virtual Computing Grid using Resource Pooling’.  		 			Alpana Rajan 		,  		 			Anil Rawat 		,  		 			Rajesh Kumar Verma 		.  	 	 		\textit{IEEE, International Conference on Information Technology},  				2008.  	 
\bibitem[Foster (2002)]{b0}\label{b0} 	 		\textit{What is the Grid? A Three Point Checklist},  		 			Ian Foster 		.  		July 20, 2002.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
