repository
자동으로 Cascaded TMR 구조를 찾는 알고리즘
- Alternative Title
- An Algorithm for Automatically Finding Cascaded TMR Structures
- Author(s)
- Yi HyunJoo
- Advisor
- 정태선
- Department
- 일반대학원 컴퓨터공학과
- Publisher
- The Graduate School, Ajou University
- Publication Year
- 2016-02
- Language
- eng
- Alternative Abstract
- 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.
- Fulltext
- Appears in Collections:
- Graduate School of Ajou University > Department of Computer Engineering > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :2,958,347
- Total Download :1,694
- Today View :4,733
