\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={A New Efficient Cloud Model for Data Intensive Application},
 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{2015-01-15 (revised: 15 January 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-01-15}
\title{A New Efficient Cloud Model for Data Intensive Application}
\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]{Rama Satish K  V}

             \author[2]{Rama Satish K  V}

             \author[3]{Dr. N P  Kavya}

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2014 Accepted: 3 January 2015 Published: 15 January 2015}

\maketitle


\begin{abstract}
        


Cloud computing play an important role in data intensive application since it provide a consistent performance over time and it provide scalability and good fault tolerant mechanism. Hadoop provide a scalable data intensive map reduce architecture. Hadoop map task are executed on large cluster and consumes lot of energy and resources. Executing these tasks requires lot of resource and energy which are expensive so minimizing the cost and resource is critical for a map reduce application. So here in this paper we propose a new novel efficient cloud structure algorithm for data processing or computation on azure cloud. Here we propose an efficient BSP based dynamic scheduling algorithm for iterative MapReduce for data intensive application on Microsoft azure cloud platform. Our framework can be used on different domain application such as data analysis, medical research, dataminining etc? Here we analyze the performance of our system by using a co-located cashing on the worker role and how it is improving the performance of data intensive application over Hadoop map reduce data intrinsic application. The experimental result shows that our proposed framework properly utilizes cloud infrastructure service (management overheads, bandwith bottleneck) and it is high scalable, fault tolerant and efficient.

\end{abstract}


\keywords{big data, scheduling, iterative mapreduce, microsoft azure, hadoop.}

\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
loud computing technology is increasingly getting attention as a future paradigm for hosting, computing and delivering service over the internet. Cloud provides different service which are classified as follows and Infrastructure (Infrastructure as a Service: IaaS), Platform (Platform as a Service: PaaS), Software (Software as a service: SaaS). Cloud service provider provides user to access different type of service such as storage, software or hardware. In particular, in recent years IaaS have become increasingly popular for user to deploy his application on to the cloud for execution and use the cloud resource efficiently. Cloud computing also provides scalable resource computing and storage resources through the Internet \hyperref[b0]{[1]}- \hyperref[b1]{[2]}. It also allow cloud users to access services irrespective to where the cloud services are provided and how they are delivered, similar to other essential commodity(electricity, water) \hyperref[b2]{[3]}. With the adaptable, transparent and scalable features in the service provisioning and resource allocation, more and more data-intensive applications are developed by using Author ? ? : e-mails: ramasatish.k.v@rnsit.ac.in, n.p.kavya@rnsit.ac.in cloud computing environment. The data intensive applications spend most of their execution time in disk I/O operation for processing a huge volume of data, e.g. data mining of different enterprises transactions, satellite data processing, medical research computation, etc.  {\ref Hadoop [4]} is a well-known cloud computing platform which is used for data-intensive applications. Due to a large number of nodes in the cloud computing system, the probability of hardware failures is not a big issue based on the statistical analysis of hardware failures in \hyperref[b5]{[5]}- \hyperref[b6]{[6]}. Some hardware failures will damage the disk data of nodes. As a result, the running data-intensive applications may not fetch/read map data from disks properly. To come out of these map failures, the data replication technique is used in the cloud computing environment which provides high data availability \hyperref[b7]{[7]}- \hyperref[b8]{[8]}. When data map failure occurs, the QoS requirement of the application cannot be supported continuously. The reason is explained as follows. With a large number of nodes in the cloud computing environment, it is practically not possible ask all nodes with the same performance and capacity in their CPUs, memory, and disks \hyperref[b9]{[9]}. For example, the Amazon EC2 is a well-known heterogeneous cloud platform, which provides various infrastructure resource types to meet different user needs in resource computing and storage  {\ref [10]}.\par
The Microsoft Azure is a cloud computing environment which offers services on demand. It offers on demand computing services such as Windows Azure Compute, Storage Blob, Queue, Table service etc. Azure Compute is a platform as a service infrastructure which allow the users to lease hourly charged virtual machine instances in the form of different types of Roles such as(e.g.: Worker Role, Web Role, etc?). The Azure storage queue is an eventual consistent, reliable, scalable and distributed message queue service, which is ideal for small and transient messages (short period/impermanent). The Azure Storage Blob service provides a shared storage service where users can store and retrieve any type data by using web services interface. Azure Storage Table service provides scalable non-relational highly available structured data storage. However Azure platform currently do not offer a distributed computing framework, other than the simple queue based model.\par
Goal of our model is to provide and process the efficient execution of Map Reduce and iterative Map Reduce applications in the Azure cloud environment.\par
Our model is a distributed decentralized Map Reduce runtime for Windows Azure cloud environment that utilizes Azure infrastructure services. Our model overcomes the latencies of cloud services by using sufficiently fine grained map and reduces tasks. It overcomes the eventual data availability of cloud storage services through re-trying and by explicitly designing the system to not rely on the immediate availability of data across all distributed workers. Our systems uses Azure Queues for map and reduce BSP task scheduling, Azure Tables for metadata storage and for monitoring data storage, Azure Blob storage for data storage (input, output and intermediate) and Compute worker roles to perform the computations. In order to with stand the breakdown/failure of cloud infrastructures and to avoid single point of failures, our model was designed as a decentralized control architecture which does not rely on a client side. It provides users with the capability to scale up/down the number of computing resources such virtual machines dynamically or during runtime. The map and reduce tasks of the proposed model runtime are dynamically scheduled using azure global queues achieving efficient scheduling natural load balancing of tasks. Our system models handles BSP task failures and slower tasks through re-execution and duplications. Map Reduce infrastructure requires the reduce tasks to ensure guarantee of all the intermediate data products from Map tasks before starting the reduce phase.\par
Data Iterative computation generally relies on a set of static data that remain fixed across different iterations and a set of ephemeral dynamic data between iterations. Here we introduces an in memory co-located Data Cache to store the reusable static data across the iterations, avoiding the fetching and parsing cost of such data from Azure Blob storage for every iteration. Each worker role will have one managed collocated cache with a given memory limit. Since the existing model do not have proper mechanism which can utilize the knowledge about cached data products to assign tasks to workers, scheduling tasks to take advantage of caching presents a significant challenge. At the same time, it's important to maintain the efficient scheduling and fault tolerance of our model in the new scheduling mechanism. In order to address these issues, our model utilizes a new efficient scheduling approach using a combination of Azure Queues and Tables. The first iteration of our model will get scheduled only through Azure queues. Our model uses a special table for caching, where the tasks are retrieved from second iteration onwards. Map Workers first query this table to identify any similarity between the data items they have in their collocated cache vs the data items needed for the retrieval of tasks. With this prototype the static data for data iterative Map Reduce computations will get reused from the second iteration onwards. Meanwhile the newly joined or a worker who has completed processing all the tasks for the cached data will be able to pick up BSP tasks directly from the queue and will use the Azure Tables and the monitoring infrastructure to check the tasks processed or not. This also ensures that our model retains the fault tolerance features of efficient azure cloud structure. 
\section[{II.}]{II.} 
\section[{Existing System}]{Existing System}\par
Over the year cloud computing is growing enormously in various fields. Data intensive application is one of those fields that have been one of the popular topics. In recent research, the valuable knowledge that can be retrieved from petabyte scale datasets is known as Big Data. Using these analyses the researcher can provide better provide better result. This Big Data analysis is used in different domain such data mining, medical research etc? There exists a substantial body of research on resource allocation and scheduling in clouds and data centers that does not consider the resource utilization efficiency (e.g., \hyperref[b11]{[12]}, \hyperref[b12]{[13]}, and \hyperref[b13]{[14]}). However, here in this literature review, we only discuss briefly the studies that are directly related to resource utilization in data centers. Kaushik and M. Bhandarkar. \hyperref[b10]{[11]} Proposed a technique to segregate or divide the servers in a HDP cluster into hot zone and cold zones based on their various performance characteristics, where cold zone servers are mostly idling and hot zone are always powered on. Resource utilization/allocation and scheduling in cloud data centers. Mahadik and Hacker \hyperref[b15]{[16]} proposed scheduling algorithm policy for virtual HPC clusters. They introduced a resource prediction cloud model for each policy to assess the resources required within a cloud, the task queue wait time for requests, and the size of the additional resources required. Palanisamy et al. \hyperref[b14]{[15]}proposed a Map Reduce cloud model for creating task. Here they create cluster configurations for the Task using Map Reduce to predict and maximize performance based on deadline-perception, allowing the CSP to optimize its resource allotment and reduce the cost. Zaharia et al. \hyperref[b16]{[17]} have analyzed the problem of (slower node) speculative execution in Map Reduce. Here they developed a simple robust scheduling algorithm called LATE (Longest Approximate Time to End), which uses predicted completion times to execute the job that hurt the response time the most. Lai and Sandholm \hyperref[b17]{[18]} have developed a system for resources allocation in shared data and compute resource clusters that enhance Map Reduce job scheduling. Their technique is based on keeping apart Map Reduce clusters in VMs with a dynamically modifiable performance.  {\ref Wang et al. [19]} proposed a new job scheduling technique for Map Reduce that improves the overall throughput in jobintensive application without considering the resource consumption. Ren et al. \hyperref[b18]{[20]} proposed a task scheduling algorithm that boost the completion time of small Map Reduce jobs. Their system is based on task priorities to make sure the fast response for small tasks. Chang et al. \hyperref[b19]{[21]} proposed numerous offline and online system for the Map Reduce scheduling complication to minimize the overall task finishing times. Their system is based on resolving a linear program (LP) relaxation. Changjian Wang et al. \hyperref[b20]{[22]}, here they have presented an optimal scheduling algorithm for data map reduce application. Here they have divided algorithm into two stages which are as follows firstly to estimate the node execution time and then to produce proper or optimal task assignment time. Here they only considered map status that is idle or busy for scheduling job to mappers. This approach leads to few problems like long tail and very high scheduling overhead. Qi Chenwe et al. \hyperref[b21]{[23]}here they provide an analysis of the downfall of existing or recent speculative execution strategies in Map Reduce. Here they present model which affect the overall performance of those technique: jobs that start asynchronously, improper configuration of phase percentage, data skew and abrupt resource competiveness. Based on these terms, here they developed a new speculative execution model called MCP to handle these scenarios. It takes the task cost performance of cluster computing resources into account, aiming at not only reducing the task execution time but also improving the overall cluster throughput. Yang Wang et al. \hyperref[b23]{[24]} here they have analyzed two general constraints on budget and deadline for the scheduling of a group of Map Reduce tasks as a workflow on a set of vm'sin the cloud. Here first, they focused on the scheduling-length under budget constraints. Then they designed a new algorithm by combining greedy algorithm with dynamic programming techniques for budget allocation on per-stage basis, which was also shown to be balanced. Then, with this result, here they designed two new heuristic algorithms, GGB and GR, which are based on greedy strategies to reduce the time complexity to reduce the scheduling lengths of the workflows without affecting the budget. Our research reveal that both the algorithms exhibiting a unique or significant advantage over the other, are very close to the optimal algorithm in terms of the scheduling time but obtain much lower time overhead. Amrit Pal et al. \hyperref[b26]{[25]} here they shows the behavior of the hdp cluster with increasing number nodes. The criterion for which the performance is analyzed is the memory parameters. This research will be useful for the developing a hdpcluster. The number of interaction increases as the size of the cluster size increases. If the data size increases and there may be a chance of out of disk then the normal copy script should be used for increasing virtual disks size. Fan Yuanquan et al. \hyperref[b28]{[26]} here they shows that the existing Map Reduce platform performs poorly on heterogeneous clusters due to skew loads among the reduce jobs. Here they analyze the downfall of current task distribution method in heterogeneous systems. Here they identify two key reasons for the skew loads: and the heterogeneity of worker nodes and the native hash partitioning. Based on these facts they proposed a performance based prediction model which is based on support vector machine called PM-SVM.\par
Here they also proposed a HAP (heterogeneity-aware partitioning) algorithm based on PM-SVM. They implemented the proposed load balance approaches in the HDP. The hadoop load balancer can improve the performance of reduce jobs, and can also improve the resource utilization of hdpclusters. 
\section[{III.}]{III.} 
\section[{Proposed System}]{Proposed System}\par
A Map Reduce job divides the input data into individual chunks which are processed by the map jobs in a completely parallel synchronization manner. The output of the maps are fed as the input to the reduce tasks. Thus, the whole framework is involved in scheduling jobs, monitoring them and re-executes the failed jobss.\par
A cluster is composed of multiple engines. The number of map and reduce tasks is compromised as Map Reduce job which is executed on cluster.Every worker node applies the map function to the local data, and writes the output result to intermediateblob storage. Worker nodes distribute or schedulemap data based on the output keys (produced by the map function), such that all map data belonging to one key is located on the same azure worker node. The worker nodes now process each and every group of output map data, per key, in parallel.\par
Map Reduce allows for parallel distributed processing of the maps and reduction operation. Provided that each and every mapping operation is selfreliant of the others, all maps can be performed in parallel -though in real scenario this is limited by the number of self-reliant data sources and/or the number of VM's near each source. Similarly, a set of 'reducers' can perform the reduction phase, provided that all data outputs of the map data operation that share the same key are presented to the same reducer at the same time, or we could say that the reduction function is associative. While this method can often appear to be inefficient compared to model that are more sequential, Map Reduce can be applied to significantly larger volume of data than normal servers can handle -a large server farm can use Map Reduce to sort a petabyte of data in only a few hours. The parallelism also provide some possibility of recovering from partial failure of blob storage or server during the operation: if any one mapper or reducer fails, the work can be rescheduledassuming the input data is still available.\par
Let us consider a large data application consisting of map and reduce tasks. The Map Reduce job is executed on a cluster. The Map and Reduce functions of Map Reduce are defined with respect to data pattern/structured in (key, value) pairs. Map takes one pair of data with a type in one data format, and returns a list of pairs in a different format. Then it is processed in the reduce phase by the reduce task with the key-value pair along with the same key. Thus, the reduce phase can only begin only after the map phase ends. This large data application must be completed by deadline??. ?? and ?? represents the set of tasks of map and reduce of the application. The set of slots available for executing these map and reduce tasks are indicated by ?? 1 and ?? 2 respectively. The resource utilization is symbolized by ? ???? , where ?? is the slot ? (?? 1 , ?? 2 ) and ?? is the task ? (??, ??) executed on the respective slot. The processing time of the task ?? when executed on the slot ?? is represented as ?? ???? . The dependencies of the map and reduce tasks are characterized by the variable ? ???? , ???, ?? ? (?? ? ??), where ? ???? will possess the value 1 if ?? is assigned after the task ?? else 0.\par
The main objective is to minimize the resource utilization when executing the Map Reduce application based on the dependencies of reduce tasks on the map tasks. The resource utilization Map Reduce scheduling problem is given as:? ? ? ???? ?? ???? ????? ????? 1 + ? ? ? ? ???? ?? ???? ?? ???? ???(?? ? ??) ??? ?? ????? 2 (1)\par
The above equation has to be minimized. Each map task is assigned to a slot for execution. This is given by:? ?? ???? ????? 1 = 1, ??? ? ?? (2)\par
The each reduce task is assigned to a task which is represented by:? ? ? ???? , ?? ???? = 1 ??? ? (??) ???(?? ? ??) ????? 2 (3)\par
The processing time of the application should not exceed the deadline. Without exceeding the deadline, the scheduler will assign to the reduce tasks only after finishing the map tasks. This is established as:? ?? ???? ?? ???? ????? + ? ? ? ???? ?? ???? ? ?? ???? ? ???(?? ? ??) ??? ?? ? ?? , ??? ? ?? 1 , ??? ? ? ?? 2 (4)\par
Thus, it is interpreted as:?????? ?????? 1 ? ?? ???? ?? ???? ????? + ?????? ??? ? ??? 2 ? ?? ???? ? ?? ???? ? ????? ? ?? (5)\par
As a result, all reducetasks can be assigned after time:?????? ?????? 1 ? ?? ???? ?? ???? ?????\textbf{(6)}\par
The integrity requirements for the decision variables are given by: ?? ???? = \{0,1\}, ??? ? ??, ??? ? ?? 1\par
?? ???? = \{0,1\}, ??? ? ??, ??? ? ?? 2 (8) The resource utilization solution consists of P and Q ? where,?? ? ???? = ? ? ???? ?? ???? ???(?? ? ??) , ?? ? ?? ?????? ?? ? ?? 2\textbf{(9)}\par
Here we develop the algorithm for resource utilization which is very efficient for scheduling Map Reduce jobs. The deadline T is specified for the completion of the large data application. However, the user here will specify only the deadline of the job but not the map or reduce phase. Reduce tasks are performed only after the completion of map tasks, thus reduce tasks are completely dependent on the map tasks. Therefore, the data centre should define the deadline for map tasks based on the availability of map slots so that further tasks are carried out by reduce tasks in order to utilize the resource efficiently. Once the map tasks are done with its tasks based on the map slots, the assignments of the reduce tasks are performed based on its reduce slots meeting its deadline. Thus, the design of this proposed algorithm characterizes the resource utilization. Therefore, the resource utilization rate of the slot s is given by:? ?? ?? = ? ? ???? ?? ???? ?? ?? ?? ? , ??? ? ?? 1\textbf{(10)}? ?? ?? = ? ? ???? ?? ???? ?? ?? ?? ? , ??? ? ?? 2\textbf{(11)}\par
where, it represents the resource utilization rate of map slot ?? and reduce slot ?? respectively. The lower ? ?? ?? represents a higher priority for the slot ?? to which a task is assigned. There exists two priority queues ?? ?? , ?? ?? to keepthe order of the map and reduce slots based on their energyconsumption rates. Our proposed algorithm initializes the deadline for map tasks (?? ?? ) and reduce tasks (?? ?? ) to infinity. The complete algorithm is given below. 
\section[{Start}]{Start}\par
For Each ?? ? ?? 1 
\section[{Yes}]{Yes}\par
No Priority Queues ?? ?? and ?? ?? are createdCompute ? ?? ?? = ? ? ???? ?? ???? ?? ?? ?? ? , ??? ? ?? 1 ?? ?? . ?????????????? (??, ? ?? ?? ) For Each ?? ? ?? 2 Yes No Compute ? ?? ?? = ? ? ???? ?? ???? ?? ?? ?? ? , ??? ? ?? 2 ?? ?? . ?????????????? ???, ? ?? ?? ?\par
Assign infinity to map tasks (?? ?? ) and reduce tasks (?? ?? ) deadline\par
While the queues ?? ?? and ?? ?? are not empty\par
Compute ?? ?? = ?? ?? . ????????????????????() 
\section[{Yes}]{Yes} 
\section[{No}]{No}\par
Compute ?? ?? = ?? ?? . ????????????????????() In every iteration, the algorithm chooses the slots with lowest utilization of resource from the priority queues. For these slots, the ratio of processing timeof map tasks to that of the reduce tasks, denoted by ??, is calculated. This ratio is used in the task assignmentprocess in each iteration of the algorithm. Then, algorithm sorts the unassigned map and reduce tasks based on theirprocessing time on the selected slots. It selectsthe longest map task?? ?? and reduce task ?? ?? from the sortedsets ?? ?? and ?? ?? respectively. Then it checksthe feasibility of allocating map task?? ?? to slot?? ?? andreduce task ?? ?? to slot ?? ?? by checking the total processingtime of the tasks against the deadline??. If theassignment of map task ?? ?? and reduce task ?? ?? is feasible, the algorithm continues to select tasks from?? ?? and?? ?? , and updates the variables accordingly. To keep the assignments of the tasks in alignment withthe ratio of processing time ?? , the algorithm balances theassignment. In doing so, if ?? > 1 (i.e., the load of processingtime of map tasks is greater than that of reduce tasks) andthe ratio of the current assignment is less than ??, then thealgorithm assigns more map tasks to balance the allocatedprocessing time close to ??. If the ratio of thecurrent assignment is greater than ??, the algorithm assignsmore reduce tasks to balance the allocated processing time. After allocating the map and reduce tasks withthe largest processing time, the algorithm assigns small mapand reduce tasks while satisfying the deadline. At the end of the first iteration, the algorithm sets the mapand reduce deadlines based on the allocated tasks. The time complexity of our algorithm is polynomial in thenumber of map slots, the number of reduce slots, the numberof map tasks, and the number of reduce tasks, respectively.Compute ?? = ? ?? ???? ?? ?? ?? ? ?? ???? ?? ?? ?? ? If ?? ?? ?????? ?? ?? is ? 0 Break No Yes Compute ?? ?? = ???????????? ?????\par
IV. 
\section[{Result}]{Result}\par
Cloud provide data iterative map reduce as a infrastructure as a service which is modified and executed here. The modified data iterative protocol is used to compute data in azure cloud, which provides the better resources utilization and more importantly provides better scheduling and efficiency. The system model presented has been developed on Visual Studio 2010 framework 4.0 with C\#. The overall system has been developed and implemented with Microsoft Azure platform. We have used virtual machine type small with collocated caching. The virtual machine configurations are as follow it uses windows 2008 r2 server, 2.72 GHz with 4 cores with 1.5GB memory.\par
The developed system has been analyzed for different performance parameters like map resource utilization, Resource utilization based on our proposed model scheme compared with the existing Hadoop model. The relative study for these all factors has been performed. This system or model performance has been verified for various map size, file size with dynamic scheduling as well as performance parameters have been checked for its fault tolerant, robustness justification. The following are the performance analysis of our proposed model over Hadoop. 
\section[{a) Map Resource Utilization}]{a) Map Resource Utilization}\par
The map resource utilization of Hadoop and our proposed model is been plotted in the above graph. We have considered a maximum of 8 maps.Here we have taken the execution time by varying the map size and the analytical result proves that the proposed resource utilization time is reduced by35 secfrom 56 secapproximately over Hadoop.  V. 
\section[{Conclusion}]{Conclusion}\par
Our efficient cloud model provides Map Reduce data intensive computing runtimes for the Microsoft windows azure cloud environment. Our model provides a decentralized iterative expansion to Map Reduce computing environment, enabling the users to easily and efficiently perform task for large scale iterative data analysis/computations on Azure cloud environment. Our model utilizes a BSP scheduling mechanism based on Azure Tables and Queues to provide the caching static data across iterations in data iterative computations. Our model cloud infrastructure services effectively to deliver robust and efficient applications. Here we compared the resource utilization and execution time of our proposed model over Hadoop 2.4.0.2.1.3.0-1981. He we analyzed the performance of our model over Hadoop by increasing map size (varying 2, 4, 6, 8 respectively), file size (varying 50Mb, 100Mb, 150Mb, 200Mb respectively) and reduce size by \hyperref[b0]{(1,}\hyperref[b1]{2,}\hyperref[b2]{3,} {\ref 4)} and found that our proposed model is robust and efficient. We also found that by increasing the instance or the number of cores the performance is getting better. We also found how usage collocated caching improves the task execution time.\par
In future we would like to test this model on different domain type such as data mining, medical \begin{figure}[htbp]
\noindent\textbf{201526201527}\includegraphics[]{image-2.png}
\caption{\label{fig_0}) 2015 B 26 Global) 2015 B 27 Global}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
  			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 		 		\backmatter   			 \par
research etc? We would also further like to enhance the model by creating a dedicated cache for cache worker which will further improve the performance of our system. 			  			  				\begin{bibitemlist}{1}
\bibitem[Hadoop]{b4}\label{b4} 	 		\textit{},  		 			Apache Hadoop 		,  		 			Project 		.  		 \url{http://hadoop.apache.org}  		 	 
\bibitem[Wang]{b21}\label{b21} 	 		\textit{},  		 			Changjian Wang 		.  		 	 
\bibitem[Chen]{b23}\label{b23} 	 		\textit{},  		 			Qi Chen 		.  		 	 
\bibitem[Liu]{b24}\label{b24} 	 		\textit{},  		 			Cheng Liu 		.  		 	 
\bibitem[Wang]{b26}\label{b26} 	 		\textit{},  		 			Yang Wang 		.  		 	 
\bibitem[ Comput. Syst (2009)]{b3}\label{b3} 	 		\textit{},  	 	 		\textit{Comput. Syst}  		Jun. 2009. 25  (6)  p. .  	 
\bibitem[Reddy (2012)]{b9}\label{b9} 	 		‘A CIM (Common Information Model) Based Management Model for Clouds’.  		 			C N Reddy 		.  		 \url{http://aws.amazon.com/ec2}  	 	 		\textit{Proc. 2012 IEEE Int. Conf. Cloud Computing in Emerging Markets (CCEM)},  				 (2012 IEEE Int. Conf. Cloud Computing in Emerging Markets (CCEM)Amazon EC2)  		Oct. 2012. 2013. 10 p. .  	 
\bibitem[Li et al. (2012)]{b8}\label{b8} 	 		‘A Cost-Effective Mechanism for Cloud Data Reliability Management Based on Proactive Replica Checking’.  		 			W Li 		,  		 			Y Yang 		,  		 			J Chen 		,  		 			D Yuan 		.  	 	 		\textit{Proc. 2012 12th IEEE/ACM Int. Symp. Cluster, Cloud and Grid Computing (CCGrid)},  				 (2012 12th IEEE/ACM Int. Symp. Cluster, Cloud and Grid Computing (CCGrid))  		May 2012. p. .  	 
\bibitem[Nejad et al. ()]{b13}\label{b13} 	 		‘A family of truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds’.  		 			M M Nejad 		,  		 			L Mashayekhy 		,  		 			D Grosu 		.  	 	 		\textit{Proc. of the 6th IEEE Intl. Conf. on Cloud Computing},  				 (of the 6th IEEE Intl. Conf. on Cloud Computing)  		2013. p. .  	 
\bibitem[Wang et al. ()]{b17}\label{b17} 	 		‘A throughput driven task scheduler for improving mapreduce performance in job-intensive environments’.  		 			X Wang 		,  		 			D Shen 		,  		 			G Yu 		,  		 			T Nie 		,  		 			Y Kou 		.  	 	 		\textit{Proc. of the 2nd IEEE International 19. Congress on Big Data},  				 (of the 2nd IEEE International 19. Congress on Big Data)  		2013. p. .  	 
\bibitem[Mashayekhy et al. ()]{b12}\label{b12} 	 		‘A truthful approximation mechanism for autonomic virtual machine provisioning and allocation in clouds’.  		 			L Mashayekhy 		,  		 			M M Nejad 		,  		 			D Grosu 		.  	 	 		\textit{Proc. of the ACM Cloud and Autonomic Computing Conf},  				 (of the ACM Cloud and Autonomic Computing Conf)  		2013. p. .  	 
\bibitem[Armbrust et al. (2009)]{b0}\label{b0} 	 		\textit{Above the Clouds: A Berkeley View of Cloud Computing},  		 			M Armbrust 		,  		 			A Fox 		,  		 			R Griffith 		,  		 			A D Joseph 		,  		 			R H Katz 		,  		 			A Konwinski 		,  		 			G Lee 		,  		 			D A Patterson 		,  		 			A Rabkin 		,  		 			I Stoica 		,  		 			M Zaharia 		.  		 \url{Rep.UCB/EECS-2009-28}  		Feb. 2009. Berkeley, Tech.  		 			Dept. EECS, California Univ. 		 	 
\bibitem[Pal]{b28}\label{b28} 	 		\textit{An Experimental Approach Towards Big Data for Analyzing Memory Utilization on a Hadoop cluster using HDFS and MapReduce},  		 			Amrit Pal 		.  		 	 
\bibitem[Shi (July-Sept. 1)]{b27}\label{b27} 	 		‘Budget-Driven Scheduling Algorithms for Batches of Map Reduce Jobs in Heterogeneous Clouds’.  		 			Wei Shi 		.  		 \xref{http://dx.doi.org/10.1109/TCC.2014.2316812}{10.1109/TCC.2014.2316812}.  	 	 		\textit{IEEE Transactions on}  		July-Sept. 1. 2  (3)  p. 306.  	 	 (Cloud Computing) 
\bibitem[Vishwanath and Nagappan (2010)]{b5}\label{b5} 	 		‘Characterizing Cloud Computing Hardware Reliability’.  		 			K V Vishwanath 		,  		 			N Nagappan 		.  	 	 		\textit{Proc. ACM Symp. Cloud Computing},  				 (ACM Symp. Cloud Computing)  		Jun. 2010. p. .  	 
\bibitem[Buyya et al.]{b2}\label{b2} 	 		‘Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility’.  		 			R Buyya 		,  		 			C S Yeo 		,  		 			S Venugopal 		,  		 			J Broberg 		,  		 			I Brandic 		.  	 	 		\textit{Future Gener}  		 	 
\bibitem[Dikaiakos et al. (2009)]{b1}\label{b1} 	 		‘Cloud Computing: Distributed Internet Computing for IT and Scientific Research’.  		 			M D Dikaiakos 		,  		 			D Katsaros 		,  		 			P Mehra 		,  		 			G Pallis 		,  		 			A Vakali 		.  	 	 		\textit{IEEE Internet Comput}  		Sep. 2009. 13  (5)  p. .  	 
\bibitem[Palanisamy et al. ()]{b14}\label{b14} 	 		‘Cost-effective resource provisioning for mapreduce in a cloud’.  		 			B Palanisamy 		,  		 			A Singh 		,  		 			L Liu 		.  	 	 		\textit{IEEE Transactions on Parallel and Distributed Systems}  		2014.  	 
\bibitem[Schroeder and Gibson (2007)]{b6}\label{b6} 	 		‘Disk Failures in the Real World: What Does an MTTF of 1,000,000 Hours Mean to You?’.  		 			B Schroeder 		,  		 			G A Gibson 		.  	 	 		\textit{Proc. 5th USENIX Conf. File and Storage Technologies},  				 (5th USENIX Conf. File and Storage Technologies)  		Feb. 2007. p. .  	 
\bibitem[Kaushik et al. ()]{b10}\label{b10} 	 		‘Evaluation and analysis of greenhdfs: A selfadaptive, energy-conserving variant of the Hadoop distributed file system’.  		 			R T Kaushik 		,  		 			M Bhandarkar 		,  		 			K Nahrstedt 		.  	 	 		\textit{Proc. of the 2nd IEEE International Conf. on Cloud Computing Technology and Science},  				 (of the 2nd IEEE International Conf. on Cloud Computing Technology and Science)  		2010. p. .  	 
\bibitem[Hacker and Mahadik ()]{b15}\label{b15} 	 		‘Flexible resource allocation for reliable virtual cluster computing systems’.  		 			T J Hacker 		,  		 			K Mahadik 		.  	 	 		\textit{Proc. ACM Conf. High Perf. Comp., Networking, Storage and Analysis},  				 (ACM Conf. High Perf. Comp., Networking, Storage and Analysis)  		2011. p. 48.  	 
\bibitem[Wang et al. ()]{b7}\label{b7} 	 		‘Hadoop High Availability through Metadata Replication’.  		 			F Wang 		,  		 			J Qiu 		,  		 			J Yang 		,  		 			B Dong 		,  		 			X Li 		,  		 			Y Li 		.  	 	 		\textit{Proc. 1st Int. Workshop Cloud Data Manage},  				 (1st Int. Workshop Cloud Data Manage)  		2009. p. .  	 
\bibitem[Pastorelli et al. ()]{b19}\label{b19} 	 		‘Hfsp: size-based scheduling for Hadoop’.  		 			M Pastorelli 		,  		 			A Barbuzzi 		,  		 			D Carra 		,  		 			M Dell' Amico 		,  		 			P Michiardi 		.  	 	 		\textit{Proc. of IEEE International Conference on Big Data},  				 (of IEEE International Conference on Big Data)  		2013. p. .  	 
\bibitem[Yuanquan et al.]{b29}\label{b29} 	 		\textit{Improving Map Reduce Performance by Balancing Skewed Loads},  		 			Fan Yuanquan 		,  		 			Wu Weiguo 		,  		 			Chen Xu Yunlong 		,  		 			Heng 		.  		 	 
\bibitem[Xiao (2014)]{b25}\label{b25} 	 		‘Improving Map Reduce Performance Using Smart Speculative Execution Strategy’.  		 			Zhen Xiao 		.  		 \xref{http://dx.doi.org/10.1109/TC.2013.15}{10.1109/TC.2013.15}.  	 	 		\textit{IEEE Transactions on}  		April 2014doi. 63  (4)  p. 954.  	 	 (Computers) 
\bibitem[Sandholm and Lai ()]{b16}\label{b16} 	 		‘Mapreduce optimization using regulated dynamic prioritization’.  		 			T Sandholm 		,  		 			K Lai 		.  	 	 		\textit{Proc. 11th ACM Int'l Conf. on Measurement and Modeling of Computer Syst},  				 (11th ACM Int'l Conf. on Measurement and Modeling of Computer Syst)  		2009. p. .  	 
\bibitem[Moseley et al. ()]{b11}\label{b11} 	 		‘On scheduling in map-reduce and flow-shops’.  		 			B Moseley 		,  		 			A Dasgupta 		,  		 			R Kumar 		,  		 			T Sarlos 		.  	 	 		\textit{Proc. Of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures},  				 (Of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures)  		2011. p. .  	 
\bibitem[Peng and You (2014)]{b22}\label{b22} 	 		‘Optimal Task Scheduling in Map Reduce’.  		 			Yuxing Peng 		,  		 			; Junyi Liu; Mingxing Tang; Guangming Liu; Jinghua Feng; Pengfei You 		.  	 	 		\textit{Networking, Architecture, and Storage (NAS)},  				2014. Aug. 2014. 122 p. .  	 	 (9th IEEE International Conference on) 
\bibitem[Chang et al. ()]{b20}\label{b20} 	 		‘Scheduling in mapreduce-like systems for fast completion time’.  		 			H Chang 		,  		 			M S Kodialam 		,  		 			R R Kompella 		,  		 			T V Lakshman 		,  		 			M Lee 		,  		 			S Mukherjee 		.  	 	 		\textit{Proc. of the 30th IEEE International Conference on Computer Communications},  				 (of the 30th IEEE International Conference on Computer Communications)  		2011. p. .  	 
\bibitem[Ren et al. ()]{b18}\label{b18} 	 		‘Workload analysis, implications and optimization on a production hadoop cluster: A case study on taobao’.  		 			Z Ren 		,  		 			X Xu 		,  		 			M Zhou 		,  		 			J Wan 		,  		 			W Shi 		.  	 	 		\textit{IEEE Transactions on Services Computing}  		2014. 7  (2)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
