\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={Designing and Valuating System on Dependability Analysis of Cluster-based Multiprocessor System},
 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{2020-01-15 (revised: 15 January 2020)}
\def\TheID{\makeatother }
\def\TheDate{2020-01-15}
\title{Designing and Valuating System on Dependability Analysis of Cluster-based Multiprocessor System}
\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]{Pulicherla  Radhika}

             \author[2]{Dr. Sudarson  Jena}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2019 Accepted: 31 December 2019 Published: 15 January 2020}

\maketitle


\begin{abstract}
        


Analysis of dependability is a significant stage in structuring and examining the safety of protection systems and computer systems. The introduction of virtual machines and multiprocessors leads to increasing the faults of the system, particularly for the failures that are software- induced, affecting the overall dependability. Also, it is different for the successful operation of the safety system at any dynamic stage, since there is a tremendous distinction in the rate of failure among the failures that are induced by the software and the hardware. Thus this paper presents a review or different dependability analysis techniques employed in multiprocessor systems

\end{abstract}


\keywords{multiprocessor, fault-tolerant, task scheduling, dependability, reliability}

\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
istributed Systems comprise of inexactly coupled processors that communicate with each other just by transferring messages and lack of common memory among them, consequently the name multiprocessors. In the course of the most recent years, they have gained popularity as an extremely alluring alternative for quick processing of information in enormous scales data frameworks, for example, factory networking, transportation management, and defense must fulfill the standard requirements bound by service interruption, maintainability, and reliability  {\ref (Singhal,2011)}. Enhancement of the multiprocessor reliability with no equipment cost is the most conventional aim. The framework can contain a few programming upgrades with realistic deadlines and various periods where every upgrade in the software is apportioned into a lot of procedures-related by dependencies on the data. Multiprocessors frameworks have developed a ground-breaking means of computation for ongoing applications, for example, those found in atomic plants and procedure control in light of their ability for superior performance and dependability \hyperref[b1]{(Sutar et al., 2006)}.\par
The quick progression in innovation over the past decade has empowered us to create many advanced frameworks that range from omnipresent handheld gadgets (like tablets and cellphones) to top of the line processing hardware utilized in health care devices, nuclear plants and power systems. Guaranteeing the dependable working of these modern frameworks is a significant concern to significant engineers \hyperref[b2]{(Ahmad et al., 2016)}. Errors in the external factors and the designs, for example, issues in production, disturbances, and damage caused by external factors, cause changes which are not desired in the physical tent of the framework. These issues are particularly hard to display since it is difficult to anticipate their events and impacts. Hence the fault tolerance is critical for improving the dependability by empowering the PC to carry out its functions within the number of specified flaws  {\ref (Zhao et al., 2013)} Dependability is fundamentally characterized as the capacity of a framework for delivering the services that could be trusted reasonably. Dependability is a concept that has developed from considerations of availability and reliability. Various authors depict the system dependability as the set of traits, for example, integrity, confidentiality, availability, safety, maintainability and reliability. A portion of these traits, for example, availability and reliability are qualitative, while some are quantitative. Reliability investigation is a significant pat of the design and evaluation of a computing model that is fault-tolerant to faults. The primary objective of analyzing the system dependability is the development model representing the time which the entire system fails and the policies about maintaining the assemblies, subassemblies, and components from which the framework is formed \hyperref[b4]{(Distefano \& Puliafito, 2009)}. One of the important tasks of analyzing dependability of the fault -tolerant systems is predicting the system reliability for the mission time that were mentioned, which is evaluated by probabilistic measures. A general way to deal with handle this is by combining the models of fault trees and Markov chain, for example, parametric fault-tree (PFT) dynamic (DFT), fault-tree (FT). 
\section[{II.}]{II.} 
\section[{Review of Existing Studies a) Fault-tolerant multiprocessor scheduling}]{Review of Existing Studies a) Fault-tolerant multiprocessor scheduling}\par
There are many challenges in carrying out scheduling in the multiprocessor environment. The scholars are on the edge of determining answers for these difficulties. Scheduling is the specialty of assigning constrained assets to tasks that are competing over time. A practical schedule fulfills the requirements that are related to a specific sort of resources and tasks to improve the multiprocessor performance \hyperref[b5]{(Nirmala and Girijamma, 2014)}. Numerous methods like genetic and fuzzy algorithms were applied, while a few researchers have also developed probabilistic techniques \hyperref[b11]{(Berten et al., 2006)} for task scheduling in fault-tolerant systems. \hyperref[b8]{Zarinzad et al., (2008)} introduced an algorithm for fault-tolerant scheduling dependent on GA. This algorithm was intended for the planning of non-preemptive autonomous tasks for a real-time multiprocessor framework. All the tasks are periodic and expected to have backup and primary copies that are allocated to various processors since the backup is executed just if the primary fails as a result of faults. But this algorithm is appropriate for the planning of the periodic tasks.\par
Bagheri and Jervan, (2014) tended to the underusage issue by proposing a mixed critical scheduling technique with the end goal that the performance of the whole system is increased along with meeting the SC task deadlines in the existence of faults. This methodology handles mixed-criticality in assignments as well as in messages between the tasks. The experiments demonstrated the performance enhancement in various run-time execution conditions and with various MC benchmark applications, including a practical robot control framework. Irrespective of the redundancy level, NoC size, and size of the task graph, an improvement in the performance is achieved. Venkataraman et al., (2013) developed a technique for enduring permanent faults in MPSoC framework. The tasks were mapped to MPSoC that they limit the correspondence and overhead mitigation energy. Also, this study also proposed a module for migrating hardware tasks independent of a processor with predictable delay for speeding up the migration of tasks in case of permanent faults in any processor. In comparison to the existing techniques, the proposed technique was quicker when compared to that of migrating the tasks. Further, utilizing a solitary TMM for different processors can be studied, prompting a further reduction of area overhead. Peng, and Yang, (2015) proposed an algorithm RRFTGS for scheduling in faulttolerant multiprocessor frameworks and also for tests of schedule ability, RRFTGS utilizes both passive and active backups and decides without anyone else which backup should be passive or active. Compared to the approaches that just passive, RRFTGS performed better when the bound was under 0.5. RRFTGS can also manage tasks with usage bound greater than 0.5, while the technique that is just passive cannot. This paper assumed that there is no synchronization between the primary and the backup copies. However, considering synchronization that is present, the processor requesting tolerance to faults will decrease since interference overestimation is decreased. \hyperref[b10]{Chatterjee et al. (2017)} developed an improvised dynamic solution for the combined issue of scheduling and application mapping for the multicore platforms based on Noc. The introduced algorithm gives a unified technique for scheduling and mapping for realtime frameworks concentrating on fulfilling application time constraints and reducing the energy for communication; To determine the cores within the system, A prescient model is utilized that is prone to failure for which the allocation of fault-tolerant assets along with task redundancy has to be carried out. By specifically utilizing the policy of the replication, the application reliability, executed on the provided NoC stage, is enhanced. Samal et al. (2019) developed a hybrid GA for PBFTS for multiprocessor conditions. Simulation results show that the methodology has been fruitful in acquiring good outcomes for scheduling the tasks in the range of 10 to 100 and also achieved enormous processor utilization for the fault conditions being simulated. The uniqueness lays on the methodology of hybridizing customary GA utilizing the key thought and the information taken from the scheduling of RT tasks and fault tolerance. This has influenced the execution of the PBFTS by improving the genetic operator design and the complete algorithm by the adoption of chromosomal portrayal. Since there is an increase in the size of the multiprocessor system, odds of processors, turning out to be faulty rises, making it a significant issue for diagnosing the faulty nodes within the framework. Various models have been proposed and considered. Lv et al., (2019) stretched out the threshold for applying the probabilistic algorithm for multiprocessor framework based on the hypercube and analyzed the effectiveness of the algorithm. The investigation shows an exceptionally high pace of accurate diagnosis, for separate as well as a group of nodes. In spite of the examination that is accomplished for a specific standard system (the hypercube), the result can fill in as a valuable reference and can add insights into the viability of the probabilistic diagnosis for a group of multiprocessor frameworks that are free of triangles. 
\section[{b) Dependability analysis of fault-tolerant multiprocessor}]{b) Dependability analysis of fault-tolerant multiprocessor}\par
Evaluating the dependability is significant, often an indispensable stage in the process of designing and analyzing the systems  {\ref (Ditstefano \& puliafito, 2007)}. It is broadly perceived that the assessment of the features of dependability in PC frameworks is a complicated task. Conventional procedures which are dependent on simulation and analytical models must be supplemented with experimental techniques that are dependent on estimations, obtained from the models from real frameworks. The above methods including field measurements, robustness testing, injection of faults, have been broadly used to access explicit mechanism of fault tolerance, validating the robustness of the components of the software, or to evaluate the general effect of the framework  {\ref (Pinter et al., 2005)}.\par
Bertolino et al., (2011) introduced approaches for monitoring and analyzing connected framework performance and dependability along with their combined utilization. These methodologies need to represent the evolvability and dynamicity of a connected framework. This investigation covered the quantitative evaluation of the properties of performance and dependability via a technique based on the stochastic model. The study initially provided an overview of measurements related to dependability and the approaches based on the stochastic model to give an understanding of the topic. At that point, the proposition in the view of dependability analysis structure for systems that are connected dynamically was portrayed. This structure can be utilized offline for designing the systems (explicitly, in Connect, for the synthesis of Connecter), and online, to consistently to evaluate the behavior of the system and distinguish potential issues emerging at run-time.\par
Pournaghdali et al., (2013) developed a simulation tool based on the injection of multi-bit faults referred to as VHDLSFI for the model of VHDL. The main objective of this tool development was to infuse multi-bit and single bit fault in the VHDL model of computerized circuits to examine parameters of dependability, for example, error propagation and latency of error propagation. There is an increase in the number of synchronous faults because of higher frequency, lower voltage and decreased code capacitance. Along these lines, studying the impact of multi-bit faults, particularly MB, is challengeable. \hyperref[b15]{Grinschgl et al., (2013)} presented a case study on various evaluations of security and dependability. An exceptionally modularized controller for fault injection systems is utilized. The campaigns of fault injection can be executed effectively through a summed up interface with an elevated level abstraction of physical sources of fault has been demonstrated. The structure is versatile to permit both completely computerized campaigns with a larger memory of fault patterns and more clientcontrolled campaigns utilizing a little silicon impression. Such full-scale examinations require completely robotized saboteur injection procedures that are presently being developed. Considering such attacks will be important to structure, secure and effective smart card frameworks are additionally valid for a profoundly coordinated framework or framework under high stress from the environment.\par
Nguyen et al,. (2014), utilizing Petri Nets, introduced a methodology for demonstrating the CBTC framework, where the data is communicated using the LTE network. This model permits the consideration of the transmission methodology and to consider the errors or failures of communication framework. It is likewise incredible for analyzing the dependability of the CBTC framework. The outcomes featured the accessibility of the LTE-based on DCS in applications controlling the trains. Suyama and Sebe, (2014) presented another concept of "available state" and utilizing Markov models, the author described the framework for analyzing the dependability for faulttolerance, and hence it prevails with regards to improving the system practically using constrained integrators. Also, the thought can assimilate fundamental job in setting up the participation with dependability or reliability engineering. The outcomes highlighted the availability of the LTE-based DCS in train control application. 
\section[{III.}]{III.} 
\section[{Comparative Analysis}]{Comparative Analysis}\par
IV. 
\section[{Conclusion}]{Conclusion}\par
Analyzing dependability in the process of designing and evaluating the systems is crucial since the introduction of computing systems for automating the processes results in increasing the system complexity thus, affecting the dependability. This paper reviewed different dependability analysis techniques for fault-tolerant multiprocessor. It was observed that the techniques like Petri nets, Markov chains, DFT, Fuzzy theory conveniently supported the dependability analysis for fault-tolerant systems. Finally, it, ought to be focused on the hypothetical action that is identified with the advancement of models of dependability. It is crucial for adapting to the increased complexity of the faulttolerant frameworks but, for this to be fruitful and applicable, practically one must continue together with actually implementing the frameworks that are tolerant to faults and with the information on experimental data with respect to the features of performance and rate of failure of the integrated modules in the process of FT realization.\begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.08541062801932367\textwidth}P{0.1051207729468599\textwidth}P{0.11743961352657004\textwidth}P{0.17\textwidth}P{0.37202898550724633\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep The experimental outcomes\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep demonstrated the effectiveness of\\
Miele et al., (2014)\tabcellsep Error analysis and fault injection\tabcellsep Anti-lock braking framework, edge detector\tabcellsep Error propagation\tabcellsep the technique in producing a precise dependability report focusing on the criticalities of the\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep system application as well as\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep architecture.\\
\tabcellsep \tabcellsep \tabcellsep Mean values of\tabcellsep \\
Nguyen et al., (2014)\tabcellsep Petrinet modelling\tabcellsep Train control\tabcellsep Down and Up Times, Mean Time to First\tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep Failure\tabcellsep \\
Author\tabcellsep Technique\tabcellsep Applications\tabcellsep Parameters studied\tabcellsep Results obtained\\
Ter et al., (2010)\tabcellsep Self-testing techniques\tabcellsep Satellite Navigation\tabcellsep Reliability, Maintainability, Unavailability\tabcellsep The developed approach enabled quick diagnosis or detection of electronic fault and repair, thus increasing the MPSoc availability.\\
Masci et ., (2011)\tabcellsep Automatic dependability analysis\tabcellsep Dynamic and heterogeneous environments\tabcellsep Sensitivity, message retransmission\tabcellsep Defined the automated process for supporting the dependable connector synthesis.\\
Gultai et al., (2012)\tabcellsep Fuzzy theory\tabcellsep Distributed system\tabcellsep Failure rate, CPU Time, reliability\tabcellsep Increasing the no of processors.\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 2020 Global Journals} 			\footnote{© 2020 Global Journals Designing and Valuating System on Dependability Analysis of Cluster-Based Multiprocessor System} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Pinter et al.]{b12}\label{b12} 	 		\textit{},  		 			G Pinter 		,  		 			H Madeira 		,  		 			M Vieira 		,  		 			I Majzik 		.  		 	 
\bibitem[Patricza (2005)]{b13}\label{b13} 	 		‘A datamining approach to identify key factors in dependability experiments’.  		 			A Patricza 		.  	 	 		\textit{European Dependable Computing Conference},  				 (Berlin, Heidelberg)  		2005. April. Springer. p. .  	 
\bibitem[Micle ()]{b20}\label{b20} 	 		‘A fault-injection methodology for the system-level dependability analysis of Multiprocessor embedded systems’.  		 			A Micle 		.  	 	 		\textit{Microprocessors and Microsystems}  		2014. 38  (6)  p. .  	 
\bibitem[Berten et al. (2006)]{b11}\label{b11} 	 		‘A probabilistic approach for fault tolerant multiprocessor real-time scheduling’.  		 			V Berten 		,  		 			J Goossens 		,  		 			E Jeannot 		.  	 	 		\textit{Proceedings 20th IEEE International Parallel \& Distributed Processing Symposium},  				 (20th IEEE International Parallel \& Distributed Processing Symposium)  		2006. April. IEEE. p. 8.  	 
\bibitem[Gulati and Bhatia ()]{b19}\label{b19} 	 		‘A reliability model for the task scheduling in Distributed System based on Fuzzy Theory’.  		 			S Gulati 		,  		 			Yadav P K Bhatia 		,  		 			K 		.  	 	 		\textit{CIIT International Journal of Networking and Communication and Engineering}  		2012. 4  (11)  p. .  	 
\bibitem[Grinschgl et al. ()]{b15}\label{b15} 	 		\textit{Case study on multiple fault dependability and security valuations Microprocessors and Microsystems},  		 			J Grinschgl 		,  		 			A Krieg 		,  		 			C Steyer 		,  		 			R Weiss 		,  		 			H Bock 		,  		 			J Haid 		,  		 			C ?\& Ulbricht 		.  		2013. 37 p. .  	 
\bibitem[Zhu et al. ()]{b3}\label{b3} 	 		‘Dependability analysis for fault tolerant computer systems using dynamic and graphs’.  		 			F Zhu 		,  		 			H Jin 		,  		 			D Zou 		,  		 			P Qin 		.  	 	 		\textit{China Communications}  		2014. 11  (9)  p. .  	 
\bibitem[Suyama and Sebe (2014)]{b17}\label{b17} 	 		‘Dependability analysis of fault-tolerant servo systems using limited integrators’.  		 			K Suyama 		,  		 			N Sebe 		.  	 	 		\textit{European Control Conference}  		2014. June. 2014. IEEE. p. .  	 
\bibitem[Bertolino et al. (2011)]{b18}\label{b18} 	 		‘Dependability and performance assessment of dynamic connected systems’.  		 			A Bertolino 		,  		 			A Calabro 		,  		 			F Di Giandomenico 		,  		 			N Nostro 		.  	 	 		\textit{International school on formal methods for the design of computer, communication and software systems},  				 (berlin, Heidelberg)  		2011. June. Springer. p. .  	 
\bibitem[Distefano and Puliafito ()]{b4}\label{b4} 	 		‘Dependability evaluation with dynamic reliability block diagrams and dynamic fault trees’.  		 			S Distefano 		,  		 			A Puliafito 		.  	 	 		\textit{IEEE Transactions on Dependable and Secure Computing}  		2009. p. .  	 
\bibitem[Distefano and Puliafito (2007)]{b21}\label{b21} 	 		‘Dependability modeling and analysis in dynamic system’.  		 			S Distefano 		,  		 			A Puliafito 		.  	 	 		\textit{2007 IEEE International Parallel and Distributed Processing Symposium},  				2007 March. IEEE. p. .  	 
\bibitem[Singhal ()]{b0}\label{b0} 	 		‘Distributed systems computing upgradation \& reliability tecnia’.  		 			V Singhal 		.  	 	 		\textit{Journal of Management Studies}  		2011. 6  (2)  p. 61.  	 
\bibitem[Peeg (2015)]{b9}\label{b9} 	 		‘Fault Tolerant Global Scheduling for Multiprocessor Hard Real Time Systems’.  		 			H \&yang F Peeg 		.  	 	 		\textit{First International Conference on Information Sciences, Machinery, Materials and Energy},  				2015. July. Atlantis Press.  	 
\bibitem[Samal et al. ()]{b7}\label{b7} 	 		‘Fault tolerant scheduling of hard real-time tasks on multiprocessor system using a hybrid genetic algorithm’.  		 			A K Samal 		,  		 			R Mall 		,  		 			C Tripathy 		.  	 	 		\textit{Swarm and Evolutionary Computation}  		2014. 14 p. .  	 
\bibitem[Chatterjee et al. ()]{b10}\label{b10} 	 		‘Fault-tolerant dynamic task mapping and scheduling for network-on-chip-based multicore platform’.  		 			N Chatterjee 		,  		 			S Paul 		,  		 			S Chattopadhyay 		.  	 	 		\textit{ACM Transactions on Embedded Computing Systems (TECS)}  		2017. 16  (4)  p. 108.  	 
\bibitem[Bagheri and Jervan (2014)]{b24}\label{b24} 	 		‘Faulttolerant scheduling of mixed-critical application on multi-processor platforms’.  		 			M Bagheri 		,  		 			G Jervan 		.  	 	 		\textit{12th IEEE International Conference on Embedded and Ubiquitous Computing},  				2014 August. 2014. IEEE. p. .  	 
\bibitem[Ahmad and Hasan &tahar (2016)]{b2}\label{b2} 	 		‘Formal dependability modeling and analysis .A Survey’.  		 			W Ahmad 		,  		 			S Hasan \&tahar 		.  	 	 		\textit{International Conference on Intelligent Computer Mathematics},  				 (Cham)  		2016. July. Springer. p. .  	 
\bibitem[Nirmala and Girijamma ()]{b5}\label{b5} 	 		‘Fuzzy scheduling algorithm for real time multiprocessor system’.  		 			H Nirmala 		,  		 			H A Girijamma 		.  	 	 		\textit{Int. J. Sc Eng Res}  		2014.  (7)  p. 5.  	 
\bibitem[Venkataraman et al. (2015)]{b25}\label{b25} 	 		‘Hardware task migration module for improved fault tolerance and predictability’.  		 			S Venkataraman 		,  		 			R Santos 		,  		 			A Kumar 		,  		 			J Kuijsten 		.  	 	 		\textit{2015 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS)},  				2015. July. IEEE. p. .  	 
\bibitem[Masci et al. ()]{b23}\label{b23} 	 		‘March) Towards automated dependability analysis of dynamically connected systems’.  		 			P Masci 		,  		 			M Martinucci 		,  		 			F Di Giandomenico 		.  	 	 		\textit{2011 Tenth International Symposium on Autonomous Decentralized Systems},  				2011. IEEE. p. .  	 
\bibitem[Nguyen et al. ()]{b16}\label{b16} 	 		‘Modelling communication based train control system for dependability analysis of the LTE communication network in train control application’.  		 			Nguyen 		,  		 			J Beugin 		,  		 			M Berbineau 		,  		 			M Kassab 		.  	 	 		\textit{European modeling Symposium}  		2014. 2014. IEEE. p. .  	 	 (October)) 
\bibitem[Ter Braak et al. (2010)]{b22}\label{b22} 	 		‘On-line dependability enhancement of multiprocessor SoCs by resource management’.  		 			T D Ter Braak 		,  		 			S T Burgess 		,  		 			H Hurskainen 		,  		 			H G Kerkhoff 		,  		 			B Vermeulen 		,  		 			X Zhang 		.  	 	 		\textit{2010 International Symposium on System on Chip},  				2010. September. IEEE. p. .  	 
\bibitem[Zhou et al. ()]{b6}\label{b6} 	 		‘Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system’.  		 			L 		,  		 			M Zhou 		,  		 			S Sun 		,  		 			X Lian 		,  		 			G Liu 		,  		 			J D Wang 		.  	 	 		\textit{Theoretical Computer Science}  		2019. 793 p. .  	 
\bibitem[Sutar et al. ()]{b1}\label{b1} 	 		‘Task scheduling for multiprocessor systems using memetic algorithms’.  		 			S Sutar 		,  		 			J Sawant 		,  		 			J Jadhav 		.  	 	 		\textit{4th International Working Conference Performance Modeling and Evaluation of Heterogeneous Network (HETNET '06)},  				2006.  	 
\bibitem[Pournaghdali et al. (2013)]{b14}\label{b14} 	 		\textit{VHDLSFI: A simulation-based multi-bit fault injection for dependability analysis In ICCKE},  		 			F Pournaghdali 		,  		 			A Rajabzadeh 		,  		 			M Ahmadi 		.  		2013. October. 2013. IEEE. p. .  	 
\bibitem[Zarinzad et al. (2008)]{b8}\label{b8} 	 		 			G Zarinzad 		,  		 			A Masoud Rahmani 		,  		 			N Dayhim 		.  		\textit{A novel intelligent algorithm for fault-tolerant task scheduling in real-time multiprocessor system In2008 Third International Conference on Convergence and Hybrid Information Technology},  				2008. November. IEEE. 2 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
