Presentation on theme: "An Overview of ABFT in cloud computing"— Presentation transcript:
1An Overview of ABFT in cloud computing Shiv Kumar GuptaDepartment of Computer Science A.P.S.U., RewaM.Phil.( )
2An Overview of ABFT in cloud computing IntroductionDependabilityFault-toleranceABFTFFTConclusions
3What is cloud computing? Cloud computing gets as a metaphor for the internet.The internet is represented in network diagram as a cloud.A cloud is a type of parallel and distributed system.It is a collection of inter-connected and virtualized computers
4What is cloud computing? Which are presented as one or more unified computing resources.It is based on service – level agreements.Its communication between service provider and consumer.So, I can say in the internet of search engine like is cloud viz.,
5. G – Global O – Outsourcing O – Of G – Grounded L – Learning E – Encyclopedia/EraIs cloud computing over the internet
6Meaning of dependability Dependability is the concept of reliability ,safety or security.It is tool of attributes, means, impairmentsAttributes have availability, reliability, safety, confidentiality, integrity, and Maintainability.Means have fault prevention, fault tolerance, fault removal, fault forecastingImpairments have faults, errors, failures
7Fault -toleranceFault tolerance methods come into play the moment a fault enters the system boundaries.Fault tolerance have two sub-techniques error processing and fault treatment.Error processing aims at removing errors from the computational state.Computational state means if possible, before failure occurrence.
8Fault-toleranceIn the error processing technique task is error detection, error diagnosis, and error recovery.And fault treatment aims at preventing faults from being re-activated.
9ABFTAlgorithm-based fault tolerance technique presented by Hung and Abraham in 1984ABFT is aimed at hardening processors when executing matrix application.Hardening processor is obtained by adding ,coding information to matrices.Matrices application is working on n x m elements .
10Corresponding column check sum matrix Ac is an (n+1) x m matrix. ABFTCorresponding column check sum matrix Ac is an (n+1) x m matrix.Which consists of the matrix A in the first n rows and a column summation vectors in the (n+1)th row.AChecksumFigure 1-1. A column
11ABFT Corresponding row checksum matrix A, is an n x (m+1) matrix. Which consists of the matrix A in the first m column and a row summation vectors in the (m+1)th column.AchecksumFigure1-2. A row
12Figure 1-3. A Checksum Matrix ABFTCorresponding full checksum matrix A f is an (n+1) x (m+1) matrix.Which is the column checksum matrix of the row checksum matrix A r of A.AchecksumChecksumFigure 1-3. A Checksum Matrix
13FFTFast Fourier Transformation is another Algorithm based technique.Which is an ad hoc hardware architecture.Supported to ad hoc hardware.The main purpose to modify the algorithm to detect faults arising in the ad hoc hardware architecture.
14FFT FFT method is suitable in conventional computer. Even if the FFT algorithm is implemented in software on a conventional computer
15ConclusionAlgorithm based approach provides good results in terms of detection capability and relatively.And also in terms of memory and performance overhead.Limitation of algorithm based approach has been only applied to those algorithm for which an ABFT created.Mainly to regular data structure.