자동으로 Cascaded TMR 구조를 찾는 알고리즘
An Algorithm for Automatically Finding Cascaded TMR Structures
- 주제(키워드) Atomization , Cascaded riple modular redundancy , Dependability , Maintenance , Reliability
- 발행기관 아주대학교
- 지도교수 정태선
- 발행년도 2016
- 학위수여년월 2016. 2
- 학위명 석사
- 학과 및 전공 일반대학원 컴퓨터공학과
- 실제URI http://www.dcollection.net/handler/ajou/000000021811
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
Triple Modular Redundancy (TMR) is a structure that has 3 modules and 1 voter. The voter discerns rights and wrongs among the results from modules. If the right results are more than 2, voter can produce right information as an output. If not, it means the TMR system fails. TMR can be chained together. More than 100 TMRs can be chained together, and we call it as a "Cascaded TMR". The cascaded TMR has been used in many fields like redundant Poly-Si TFT, pipeline process, and etc. A lot of related studies have been done for more reliable and cost-effective structures of cascaded TMR. Every study suggests the unique structures, which can make the optimal structure automatically. There must be a lot of circumstances for making the optimal Cascaded TMR structures. Some structures needs to be built with minimum cost. Also, some other structures were to be built with the highest reliability. In this thesis, we studied an algorithm, which automatically makes an optimal cascaded TMR structure by given circumstances.
more목차
1.INTRODUCTION 1
2.BACKGROUND AND RELATED WORK 2
3.SUGGESTED ALGORITHM 8
3.1 COST 10
3.2 RELIABILITY 12
3.3 AUTOMATICALLY FINDING THE OPTIMAL CASCADED TMR 16
4.PROOF OF THE ALGORITHM 20
4.1 CASCADED TMR WITH ALL THE STAGES HAVING ONE VOTER 21
4.2 CASCADED TMR WITH ALL THE STAGES HAVING TWO VOTERS 22
4.3 CASCADED TMR WITH STAGES HAVING ONE VOTER AND TWO VOTER ALTERNATELY 24
5.CONCLUSION 25
REFERENCE 27
