\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={Improving the Read Performance of the Distributed File System through Anticipated Parallel Processing},
 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{Improving the Read Performance of the Distributed File System through Anticipated Parallel Processing}
\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]{Nathan  Ragu}

             \author[2]{B.  Rangaswamy}

             \author[3]{Dr. N.  Geethanjali}

             \affil[1]{  Sri Krishnadevaraya University}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 December 2014 Accepted: 31 December 2014 Published: 15 January 2015}

\maketitle


\begin{abstract}
        


In the emerging Big Data scenario, distributed File systems (DFSs) are used for storing and accessing information in a scalable manner. Many cloud computing systems use DFS as the main storage component. The Big Data applications de-ployed in cloud computing systems more frequently perform read operations and less frequently the write operations. So, improving the performance of read access has become an im-portant research issue in DFS. In the literature, many client side caching with appropriate pre fetching techniques are proposed for improving the performance read access in the DFS. A speculation-based approach which uses client side caching is also proposed in the literature for improving the performance of read access in the DFS. In this paper, we have proposed a new read algorithm for the DFS based on anticipated parallel processing. We have evaluated the per- formance of the proposed algorithm using mathematical and simulation methods and the results indicate that the pro-posed algorithm performs better than the speculation-based algorithm proposed in the literature.

\end{abstract}


\keywords{distributed system, speculation, asynch- ronous reading performance.}

\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
ot of data (text, images, video and audio) is getting gen-erated due to the extensive use of social media applications. This phenomena is referred as Big Data in the literature.The availability of smart phones which support many at-tractive applications facilitate the users to upload the mul-timedia data into the web in a exible manner. The main problem here is the availability of scalable storage solutions which provide required storage capacity and efficient read and write facilities. Distributed File systems (DFSs) have been emerged as the scalable storage facility for storing Big Data and for accessing them in an efficient manner. Many cloud computing systems use DFS as the main storage component.\par
The Big Data applications deployed in the cloud computing environment more frequently perform read operations and less frequently carry out write operations. Hence, improving the performance of the read operations in a Big Data environment has become one of the important research is-sues. So, for the DFS which is used for storing and accessing Big Data, it is important that it carries out the read access in a faster manner so that Big Data application execution time can be reduced.\par
The DFS uses disk as the main storage device and data transfer rate of disk is very less in comparison with that of the dynamic or static random access memories used in the computer systems. To reduce the input/output (I/O) access time, many client side caching techniques have been proposed in the literature. These techniques allow the client node to download the requested Files from the server and store the same in the client side cache so that further read re-quests issued by the applications running in the client nodes will be satis read by reading the content from the local cache (client side cache). To avoid stale data problems in the client side caching techniques one of the following methods will be used: (i) Cache synchronization or cache invalidation pro-tocol (ii) Checking up with the server whether the data in the client side cache is valid or stale. If the data available in the cache is stale then the data has to be fetched from the server's disk.\par
In the literature, a speculation-based technique has been proposed for improving the performance of read access in the DFS  {\ref [6]}. In this technique, the client application reads the data from the local cache and proceed with its execution (speculative execution). Simultaneously, the server systemis also contacted to check whether the data in the local cache is stale or valid by comparing the time stamp values of the cached copy and the copy available in the sever's disk. If the data in the local cache is found to be valid, then the speculative execution is allowed to continue. If the data in the local cache is found to be stale, then the data is read from the server's disk and the speculative execution will be rolled back.\par
In this paper, we propose anticipated parallel processing-based algorithm which carries out executions by considering the local cache of the node (LN) where the client application program is getting 
\section[{Year ( )}]{Year ( )} 
\section[{2015}]{2015} 
\section[{B}]{B}\par
Improving the Performance of the Distributed file System Through Anticipated Parallel Processing executed and also the local cache of the node (NN) which is placed near to LN (where the same data is available). Based on the time stamp value available in the server for the data, the cache content of LN or NN will be considered. If the data available in LN and NN are stalethen the data will be read from the server's disk. We have evaluated the performance the proposed algorithm through mathematical analysis and simulation experiments. The re-sults indicate that our proposed algorithm performs better than the earlier speculationbased algorithm proposed in the literature.\par
This paper is organized as follows. In the next section, we describe the techniques discussed in the literature for im-proving the performance of the DFS. In section 3, we discuss our proposed approach in detail. In section 4, we have done the detailed performance evaluation of the algorithms using mathematical analysis and simulation modeling. Section 5 concludes the paper. 
\section[{II.}]{II.} 
\section[{Relatedwork}]{Relatedwork}\par
In this section, we discuss First we describe the techniques discussed in the literature for improving the performance of the DFS.\par
Many client-side caching techniques have been used to im-prove the performance of distributed File systems. A cooper-ative caching technique is discussed in the paper \hyperref[b1]{[2]}. In this type of technique, the server maintains a directory which stores the details of File blocks stored in each and every local caches available in client nodes. Whenever a client applica-tion program issues read request for a block, First the local cache is verified and then the cache directory maintained in the server is verified to see whether the requested File block is available or not. If the File block is not available in the local cache and in any of the caches maintained in the client nodes then it will be read from server's disk where the DFS is deployed. This technique is suffering from the problem known as single point of failure.\par
In order to eliminate the single point of failure, researchers have come out with a technique known as "Decentralized Caching Technique" which was proposed in  {\ref [8]}. The authors proposed a hint based approach in which the cache directory of the local cache maintains hints regarding in which local cache of the client nodes the File block probably be found. This technique proposed the meta data in the form of hints to be distributed to client nodes and hence the single point of failure can be eliminated.\par
A new type of caching technique called collective caching was discussed in \hyperref[b3]{[4]}. If the subtasks of a client application runs in multiple client nodes then the caches available in these client nodes may be logically combined to act as a single cache so that all the subtasks can read the File blocks from this uni\textunderscore ed cache provided these blocks are available there.\par
In  {\ref [7]} an aggressive proactive technique was proposed for the effective pre fetching of \textunderscore le blocks based on hints. In \hyperref[b2]{[3]}, locality aware cooperative caching was proposed.\par
The Hadoop DFS (HDFS)  {\ref [9]} is a open-source project and it is a cluster-based File system. The HDFS is an attractive File system and provides scalable storage solutions for Big Data applications.\par
In [6], a speculation-based method was proposed to improve the performance of the DFS. This technique uses only the local cache for the speculative execution purpose. 
\section[{III.}]{III.} 
\section[{Proposed Algorithm based on Anticipated Parallel Processing}]{Proposed Algorithm based on Anticipated Parallel Processing}\par
In this section we discuss regarding anticipated parallel ex-ecution, disadvantages of speculation-based algorithm and then the proposed algorithm. 
\section[{a) Anticipated Parallel Execution}]{a) Anticipated Parallel Execution}\par
The main idea behind anticipated parallel execution is to do some task before it is known whether that task will be required at all. Later we come to know that whether the task is required or not by checking various conditions. If the task is required then the effect of the task execution is used and the results produced by the task are considered. If the task is not required then the effect of the task execution is undone and the results produced by the task are not utilized. This type of task execution will reduce the waiting time for mmany cases and hence the performance can be improved.\par
Anticipated parallel execution technique is followed in mod-ern pipelined processors particularly for the efficient han-dling of conditional branch instructions. In this type of pro-cessors, the conditional branch instructions are allowed to go through the various stages of the pipeline. Here the assumption is that the condition may not satisfied and hence the branch will not take place. Whether the condition is satisfied or not for an instruction is known at the execution stage of the pipeline. If the condition is not satisfied, the instruction executions continue in the pipeline. If the con-dition is satisfied then the pipeline is drained and then the instruction will be fetched from the target address (branch address) \hyperref[b0]{[1]}. Anticipated parallel executions are used in op-timization phase of the compilation process [5]. 
\section[{b) Disadvantages of Speculation-based algorithm}]{b) Disadvantages of Speculation-based algorithm}\par
In the literature a speculation-based method has been pro-posed for improving the performance of read operations  {\ref [6]}. In this paper, the authors assumed that caches are main-tained in the client systems and the server will be contacted to check whether the content in the local (client side cache) is stale or valid by checking the time stamp of the cached copy and the copy available in the server's disk. Whenevera client application program requests for a File and if the File is available in the local cache then one speculative execution will be started which reads the content from the local cache and proceed its execution. Meanwhile the server system is contacted to know whether the cached copy of theFile is stale or valid. If the cached copy of the File is valid then the speculative execution will be allowed to continue. If the cached copy of the File is stale then the speculative execution will be rolled back and then the file content is read from the server's disk and then the execution will continue. In this algorithm, the client program checks only the local cache and if the content is not available there the it accesses the content from the server's disk. Note that, the same content may be available in other client nodes connected in the DFS environment. This speculation-based algorithm does consider the availability of data in other client nodes. So, there is a scope of proposing an improved read algorithm by considering the local caches present in other systems. 
\section[{c) Proposed Algorithm}]{c) Proposed Algorithm}\par
In this subsection, we discuss \textunderscore rst regarding the assumptions of the caching system maintained in the DFS. Next, we describe the three parts of the proposed algorithm and then the proposed algorithm.\par
i. Assumptions\par
We have considered a cluster-based DFS to propose our algorithm. In the DFS, we have assumed that one name node (name sever system) and two or more data nodes are present. The purpose of the name node is to store the meta data (global directory -File attributes and other details). The data nodes are used for storing the files and executing user (client) application programs. The name node and data nodes are connected through local area network. All the data nodes are maintaining their own local caches and cache operations are managed by a cache manager module deployed in the data nodes. The cache managers maintain cache directory (CD) in which the information regarding which Files are stored in the local cache is available. In the CD of a data node, the address of the nearest data node is also stored. Here, we have considered only the File level caching (entire File will be downloaded from the server's disk and stored in the cache). We have assumed that caching is done only during read access and write operations will not initiate any cache operation. We have also assumed that the no cache synchronization or invalidation protocol is followed in order to avoid communication delay. Each client program whenever it reads the content form the cache, it has to verify with the name node whether the content read from the cache is valid or stale. We have also assumed that three copies of the same \textunderscore le is kept in three different data nodes in order to support the reliability feature.\par
ii. Three parts of the algorithm Our algorithm consists of three parts. The first part describes the steps to be followed for the main thread of execution of the read procedure of the DFS. The second part describes the steps to be followed by the anticipated execution (AE1) and the third part describes the steps to be followed by the anticipated execution (AE2).\par
/  We have analyzed the performance of the algorithms through mathematical and simulation modeling. In this section, we discuss first regarding the assumptions. Next, we discuss regarding performance evaluation through mathematical model. Finally, we discuss regarding the results of the simulation experiments. 
\section[{a) Assumptions}]{a) Assumptions}\par
We have made the following assumptions by considering various factors related to main memory, disk and local area network. (i) Block size is 4 KB. (ii) All data and name nodes are connected in a network. (iii) Average communication delay is 4 ms. (iv) Transferring meta data from name node to requested data node is 0.125 ms (v) Average block access time for disk is 12 ms (vi) Average block access time formain memory is 0.005 ms (vii) Local cache hit ratio is lc and remote cache hit ratio is nc. 
\section[{b) Mathematical Model}]{b) Mathematical Model}\par
Based on the assumptions discussed in the above subsection we calculate the average access time for the speculation and anticipated parallel processingbased algorithms. We call average block read access time as ABRAT. We have calculated the time required to access a file block from the remote data node as 4.01 ms.\par
Average Block Read Access Time (with speculation) = lc * (Main memory access time + Time stamp collection time) + (1-lc) * (Main memory access time + Time stamp collection time + Block access time for Disk + Block transfer communication time + Main memory access time). If we apply the above equation, ABRAT for speculation-based approach is calculated as (16.26 -16.13 lc)ms. (Formula 1)\par
Note that, we have not considered overhead involved in starting the the speculative execution.\par
Average   We have Fixed the lc value as 0.3 and measured the values which is depicted in Fig.  {\ref 1}. For the nc values 0.2 and above, the proposed anticipatedparallel processing based algorithm (APA) performs better than the speculation-based algorithm (SPA). In Fig. \hyperref[fig_4]{2}. we have \textunderscore xed lc value as 0.4 and varied the nc values from 01. to 0.6. We can observe the similar trend in both the Figures (Fig.  {\ref 1} and Fig. \hyperref[fig_4]{2}). We have Fixed lc value as 0.5 and varied nc values from 0.1 to 0.5 and observed the performance of the algorithms. For the nc values 0.11 and above the proposed anticipated parallel processing-based algorithm performs better than the speculation-based algorithm which is depicted in Fig. \hyperref[fig_5]{3}. We can observe similar trends in Fig. \hyperref[fig_6]{4} and Fig.  {\ref 5}. 
\section[{c) Simulation Experiments}]{c) Simulation Experiments}\par
We simulated both speculation-and anticipated parallel processing based algorithms. We conducted the simulation experiments by Fixing the number of Files present in the data node and by varying the number of cache blocks of local and remote caches and number of blocks in the File.\par
The performance of the proposed algorithm (APA) and the speculation-based algorithm proposed in the literature (SP) are shown in Figures 6 to 10. We have Fixed the number of Files present in the DFS as 50 and capacity of LC and NC as 100 blocks and have varied number of blocks present in the Files from 25 to 100 and conducted simulation experiments. The performance is shown in Fig.  {\ref 6}. We observe that APA requires less access time than SP for all cases. Next, we have Fixed the number of Files as 50 and capacity of LC and NC as 200 blocks and varied number of blocks present in the Files from 25 to 100. The observed performance is shown in Fig.  {\ref 6}. We observe that APA performs better than SP. Similar trends can be observed in Fig.  {\ref 8}, Fig.  {\ref 9} and Fig.  {\ref 10}.\par
Both the results of evaluation through mathematical and simulation techniques indicate that the proposed anticipated V. 
\section[{Conclusion}]{Conclusion}\par
In this paper, we have proposed an anticipated parallel processing based read algorithm for improving the performance of the DFS. We have also carried out performance analysis for the speculation-based read and proposed algorithms using mathematical analysis and by conducting simulation experiments. The results of our analysis indicate that our proposed algorithm requires less read access time than the speculation based read algorithm proposed in the literature.  \begin{figure}[htbp]
\noindent\textbf{2015}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Global) 2015 B}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2015}\includegraphics[]{image-3.png}
\caption{\label{fig_1}) 2015 B}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12015}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 1 :) 2015 B}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{520156789}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 5 :) 2015 BFigure 6 :Figure 7 :Figure 8 :Figure 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-10.png}
\caption{\label{figure10}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-11.png}
\caption{\label{figure11}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-12.png}
\caption{\label{figure12}}\end{figure}
   			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Jiang et al. ()]{b2}\label{b2} 	 		‘A localityaware cooperative cache management protocol to improve network \textunderscore le system performance’.  		 			S Jiang 		,  		 			F Petrini 		,  		 			X Ding 		,  		 			X Zhang 		.  	 	 		\textit{Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on},  				2006. p. .  	 
\bibitem[Liao et al. ()]{b3}\label{b3} 	 		‘Collective caching: application-aware client-side \textunderscore le caching’.  		 			W Liao 		,  		 			K Coloma 		,  		 			A Choudhary 		,  		 			L Ward 		,  		 			E Russell 		,  		 			S Tideman 		.  	 	 		\textit{High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium on},  				2005. IEEE.  	 
\bibitem[Dahlin et al. ()]{b1}\label{b1} 	 		‘Cooperative caching: Using remote client memory to improve \textunderscore le system performance’.  		 			M D Dahlin 		,  		 			R Y Wang 		,  		 			T E Anderson 		,  		 			D A Patterson 		.  	 	 		\textit{Proceedings of the 1st USENIX Conference on Operating Systems Design and Implementation, OSDI '94},  				 (the 1st USENIX Conference on Operating Systems Design and Implementation, OSDI '94Berkeley, CA, USA)  		1994. USENIX Association.  	 
\bibitem[Bernstein et al. ()]{b0}\label{b0} 	 		‘Proving safety of speculative load instructions at compiletime’.  		 			D Bernstein 		,  		 			M Rodeh 		,  		 			M Sagiv 		.  	 	 		Lecture Notes in Computer Science  		B. Krieg-Br \textasciitilde  Aijckner (ed.)  		1992. Springer. 92 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
