\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={NeuralGDFS: Neural Network Guided DFS for Progressive Cluster Performance on Large Data Set},
 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{NeuralGDFS: Neural Network Guided DFS for Progressive Cluster Performance on Large Data Set}
\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]{Suyog  Dixit}

             \author[2]{Dr. Pankaj  Dashore}

             \affil[1]{  }

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


GlusterFS is the most advanced Distributed File System. GlusterFS uses Devis Meyer?s Hashing algorithm as a one way hashing function to save file across the cluster network. Based on GlusterFS, we introduce a new kind of DFS known as NeuralGDFS. NeuralGDFS will incorporate the probabilistic neural network to identify the most probable Brick in which requested file might be located. We also studied GlusterFS performance in virtual cloud environment.

\end{abstract}


\keywords{}

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

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


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
emands for data storage capacity is increasing day by day. Proprietary DFS leading in storage industry are unable to cope up with the costing, simplicity \& customizability as per the requirements of data enterprises.\par
GlusterFS is developed to solve these problems and extended NAS for the cloud environments.\par
Gluster allows storage clustering of large number of individual computer nodes to deliver a high performance centrally managed pool. Depending on the workload, capacity and performance can be increased from few terabytes to multiple petabytes. It is possible to connect on-site nodes as well as public cloud infrastructure nodes like Amazon Web Services or Microsoft Azure. 
\section[{a) Gluster Elastic Scaling}]{a) Gluster Elastic Scaling}\par
Gluster can cluster hard-disk, processor and corresponding input/output resources of multiple thousands of inexpensive computer nodes so that an organization can create a very large storage pool. On demand, if organization wishes to add more storage, they can directly add more hard-disks. If organization needs performance, more levels of virtual RAIDs can be configured by installing more hard-disks distributed among different computer nodes.\par
Elasticity in Gluster refers to direct proportionality of number of units with the performance. Necessary requirement to achieve elasticity is not to use metadata. Scalable and reliable architecture of fully distributed Gluster server nodes uses parallelism.\par
There are scenarios with performance throughput exceeding 22GB/s \hyperref[b0]{[1]}.\par
Author ? ?: Computer Science Department, MITM, Indore, India. e-mails: suyog@suyogdixit.com, dashorepankaj@gmail.com b) No Metadata with the elastic hash algorithm All other distributed file systems keep track of physical allocation of data by indexing file system. But this creates a single point of failure and significant bottlenecks. This also results into logarithmic scaling of the whole system. To avoid this performance chokepoint, Gluster finds location of file using Elastic Hashing algorithm which is based on Davis Meyer's one-way hashing algorithm. Hence, Gluster does not require a metadata sever. With the input of directory name with filename on Davis Meyer algorithm a hash is generated. Davis Meyer's hashing algorithm has determinism and uniformity. Each pathname corresponds unique numerical value.\par
For the collision of files to the same brick, encryption operations are required (to find same hash value for two files).\par
Gluster also uses SuperFastHash whose collisions can be easily found eg, finks collides with vinic.  
\section[{How DHT Works}]{How DHT Works}\par
When open() is called, distribute translator is provided with the filename. To determine its location in GlusterFS, translator runs the filename into hashing algorithm. returnctypes.c\textunderscore uint32(glusterfs.gf\textunderscore dm\textunderscore hashfn( filename, len(filename)))\par
if\textunderscore \textunderscore name\textunderscore \textunderscore  =="\textunderscore \textunderscore main\textunderscore \textunderscore ": printhex(gf\textunderscore dm\textunderscore hashfn(sys.argv \hyperref[b0]{[1]}).value)\par
We installed GlusterFS on Virtualized environment Proxmox 3.0 KVM virtualization on 4 Ubuntu 14.04 LTS instances. We calculated hash as follows:\par
ganeshji@ubuntu2:\textasciitilde \$ python gf\textunderscore dm\textunderscore hash.py camelot.blend 0x99d1b6fL\par
Distribute translator queries to see if it has the mappings for that directory cached. If it doesn't, it looks all the distribute sub-volumes for the DHT mappings for that directory. Let's look on the mappings: The trusted.glusterfs.dht value ends in two uint32 values. By investigating start and end values, most probable location can be found. In our case 0x00000000 <= 0x099d1b6f <= 0x3ffffffe query was sent to brick b. If the file is there, great. That was pretty fast and proficient.\par
If the file's is not found there, hopefully there's a file there exists a file with the same filename of zero bytes, mode 1000 with the extended feature "trusted.glusterfs.dht.linkto". This is a sticky-pointer, also known as DHT link pointer. This tells the distribute translator that "File is moved to?" This is usually generated while renaming a file. Two network calls will be no big deal If file is not found at brick b, the client calls dht\textunderscore lookup\textunderscore everywhere. This sends queries to each distributed sub-volume. In our research setup there is 4x3 volume space, that means 4 queries out of distribute, and 3 queries each out of replicate for a total of 12 lookups. We can understand that this happens in parallel but that's still a lot of overhead.\par
Imagine a scenario in which we look for files that don't exist repeatedly, this adds a lot of wasted lookups as the client queries every distribute sub-volume every time the file doesn't exist. If that is for example a magneto app, there's commonly a long include path that gets searched for each of 1000 includes. It's common for 30000 non-existent files to be referenced for a single shop home page load.\par
Quick solutions could be including paths while querying, which practically not possible for each open() request. Next could be a use of metadata server, which is again a problem as discussed in section I[B]. Next solution could be setting a flag for future ease that this file does not exist. But none of the solution is found to be an efficient solution to be problem IV. 
\section[{Neural Network Backed DFS a) Pattern Parallel Training}]{Neural Network Backed DFS a) Pattern Parallel Training}\par
Pattern parallel training is a method in which full artificial neural network and full set of training data is replicated on each cluster node. This can also speed up the training of the network because nodes broadcasts their computed weights over the network. 
\section[{b) Probabilistic Neural Net}]{b) Probabilistic Neural Net}\par
The Probabilistic Neural Network (PNN) model, described by D.F. Specht is a neural implementation of the Parzen windows probability density approximation method, mainly (but not exclusively) oriented toward classification problems. It was originally devised to provide a neural tool capable of very fast training on real-world problems; as compared with the backpropagation, for a given level of performance, the speedup reported was about 200000:1 \hyperref[b1]{[2]} Neural network have confusion, compression and diffusion properties. We will try to classify hash function based on a neural network. Let us define our neural network as:\par
Where f i are transfer functions, W i are weights and B i (i=0,1,2) are the bias of the i th neuron layer. As we wish to have a distributed setup, no single point of failure and parallel computation, we take each of the node of Gluster as a node of neural network. The repeated iteration improves the randomness of the relation between H and D and thus strengthens the cryptosystem \hyperref[b2]{[3]}. Learning of Neural Network will be a continuous process, which also works as a cache system. We also suggested one more layer after output layer as decision layer. This will give final outcome that where a file resides. Figure \hyperref[fig_4]{2} shows the suggested neural network setup for our NeuralGDFS.  A new approach has a fundamental limitation. Let us choose a division of the bricks to store the basic directory structure. It contains directories with allocated GFIDs (GlusterFS ID). This gives "structure" to the network. Files in a given directory is then spread/hashed across many servers. But this is again a direction towards a metadata server.\par
Solutions like "directory-span" option which limits a given directory's scale-out factor are not effective or ideal because their limits restrict sub-directories' spanning and also impose on the parent directory's spanning.\par
Rebalance needs to bring the cluster into a balance state by moving data is a time consuming process. While renaming a file, name and cache do not co-reside, causing current design to put the file out of balance, and also is a very state operation triggering probable inconsistencies during its execution. E. Parzen estimated a non-parametric method of KDE (Kernal Density Estimation) for estimation of probability density estimation.\par
Where, K is kernel positive function, n integrates to one and has mean zero, h is smoothing parameter called bandwidth.\par
We used KDE.m \hyperref[b4]{[5]} on MATLAB this example, the data are a synthetic sample of 70 FileIDs drawn from the standard normal and 70 points from a normal distribution with mean 6 and variance 2.  
\section[{NeuralGDFS}]{NeuralGDFS}\par
In the NeuralGDFS, we keep training probabilistic neural network with random file calls. It is always most probable that a nearby file is called which can be easily computed by probabilistic neural network. MATLAB 2014b was used to simulate the Neuro-DFS environment. No internal tool of MATLAB was used for creation or simulation of neural network.\par
To increase the efficiency of our neural network, example vector will use cached location of last called file. These are frequently updated as per the misses of neural network. Output layer is not full connected with hidden layer. This is because we wish to have classification of file among the bricks. Hence, node for a given brick is connected only to that brick's output node and not all (See Figure \hyperref[fig_4]{2}). Brick node activation can be calculated via corresponding brick cache product with File as input feature vector. Brick output activation can be then calculated as: Where, N is the total Number of Bricks in cluster space and ? is a smoothing factor. Smoothing factor can be customized while installing NeuralGDFS. If smoothing factor is very large, it will unable to classify a file and if it's too very small, then our Neural Network will not generalize well.\par
Given with the FileID, the node's brick activations will be calculated and its sum will be forwarded to output layer via classes as bricks. From here, decision layer will take the largest activation will output the brick of FileID.\par
Almost no training is required hence it is very fast. And as our NeuralGDFS is also based on Network parallel training, rest of the layers also responds very fast. But still as everything depends on Brick's cache, network's consistency problems may arise.\par
Solution of this is in our architecture of NeuralGDFS. It has tight coupling of whole cluster system with probabilistic neural network. At first when open() is called, we will send our request to DHT module as well as PNN module. If DHT responds first with the corresponding Brick, Cache will updated and then PNN will adjust itself. If there is miss on DHT, PNN's brick will be contacted for file. If still there is a miss, broadcast request to all bricks will be sent for the search. To verify that neural network approximates a function well, we tested MATLAB with own Neural Network. Figure \hyperref[fig_5]{3} shows number of epochs taken by neural network for learning. Although our PNN will be much faster as it will not be a back propagation neural network. We studied a sample funtion learning on MATLAB.  
\section[{Benchmarking Performance}]{Benchmarking Performance}\par
In our study for Gluster, we used IOzone tool for benchmarking. We applied variety of file operations on our kernel virtualized Ubuntu machines. We used 64 MB Cache surveillance hard-disks and not SSD as most of the industrial environments do.\par
The persistent rate was less than the burst rate as it does not get advantages of cache or buffer memory in the harddrive.\par
Read and Write tests were conducted for different sizes with different number of records with number of methods. By comparing even with the two node we can obverse significant increase in the reading and writing speed with respect to a single virtual machine. It can be observed from figure \hyperref[fig_9]{5} that for similar size of file with similar number of records, higher speed are illustrated in the case of Gluster.  
\section[{Global}]{Global} 
\section[{Brick Classification}]{Brick Classification}\par
In our MATLAB experiment, we have taken FilesID as two element input vector to its associated Brick. Then we converted Brick into its vector form. We then created a new probabilistic neural network. After its testing, its vector output are converted into indices. Then our network classified this new vector with our network. See generated figure 6 which shows how our network classified the FilesID into corresponding brick.  
\section[{Conclusion}]{Conclusion}\par
Gluster filesystem is a self-integrated, multiprocol, highly scalable upto 72 brontobytes of data supporting infiniband. It can be updated to NeuralGDFS which uses neural network for alternate classification of files among bricks. We suggested procedures which can be developed for better handling of misses of files. This in turn, reduces network lookups and jams.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}DH}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Global}\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{}\includegraphics[]{image-8.png}
\caption{\label{fig_6}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{34}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 3 :HFigure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-11.png}
\caption{\label{fig_9}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-12.png}
\caption{\label{fig_10}Figure 6 :}\end{figure}
 			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 			\footnote{Global Journals Inc. (US)} 			\footnote{NeuralGDFS: Neural Network Guided DFS for Progressive Cluster Performance on Large Data Set} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Gluster ()]{b0}\label{b0} 	 		\textit{Cloud Storage for the Modern Data Center},  		 			Gluster 		.  		2011.  	 
\bibitem[Ancona et al. ()]{b1}\label{b1} 	 		‘Implementing probabilistic neural networks The PNN model’.  		 			F Ancona 		,  		 			A M Colla 		,  		 			S Rovetta 		,  		 			R Zunino 		,  		 			EB S 		.  	 	 		\textit{Neural Comput}  		1998. 51.  	 
\bibitem[Kernel Density Estimator -File Exchange -MATLAB Central (2015)]{b4}\label{b4} 	 		\textit{Kernel Density Estimator -File Exchange -MATLAB Central},  		 \url{http://www.mathworks.com/matlabcentral/fileexchange/14034-kernel-density-estimator}  		Apr-2015. p. 15.  	 
\bibitem[Lian et al. ()]{b2}\label{b2} 	 		\textit{One-way Hash Function Based on Neural Network},  		 			S Lian 		,  		 			J Sun 		,  		 			Z Wang 		.  		2007. p. .  	 	 (CoRR) 
\bibitem[Dahl et al. ()]{b3}\label{b3} 	 		‘Parallelizing neural network training for cluster systems’.  		 			G Dahl 		,  		 			T Mcavinney 		,  		 			Newhall 		.  	 	 		\textit{? Comput. Networks, ?}  		2008.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
