• 제목/요약/키워드: fault tolerant computing

검색결과 68건 처리시간 0.023초

기저상태계산 문제에 대한 양자컴퓨팅의 성능 분석 (Quantum Computing Performance Analysis of the Ground-State Estimation Problem)

  • 최병수
    • 한국광학회지
    • /
    • 제29권2호
    • /
    • pp.58-63
    • /
    • 2018
  • 최근 양자프로세서와 관련한 연구개발이 본격화되면서 실제 수행가능 한 양자계산량도 계속 증가하고 있다. 이에 양자컴퓨팅은 본격적으로 활용화단계로 진입하고 있다고 볼 수 있다. 다만 아직은 큰 규모의 양자컴퓨팅이 가능하지 않기 때문에 작은 규모의 문제이지만 고전컴퓨팅으로는 해결하기 힘들고, 양자컴퓨팅으로는 효과적으로 계산할 수 있는 문제를 대상으로 하고 있다. 본 연구에서는 이와 관련하여 양자컴퓨터를 이용한 작은 크기의 양자시뮬레이션분야의 실질적인 계산성능에 대한 정량적인 분석 결과를 보고한다. 분석결과 현재까지의 결함허용 기반 양자컴퓨팅은 양자계산성능의 측면에서 다양한 문제점을 갖고 있음을 확인하였다. 본 연구에서는 이와 관련하여 향후 수행해야 할 연구개발 내용을 정리하였다.

Fault-Tolerant Analysis of Redundancy Techniques in VLSI Design Environment

  • Cho Jai-Rip
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 1998년도 The 12th Asia Quality Management Symposium* Total Quality Management for Restoring Competitiveness
    • /
    • pp.393-403
    • /
    • 1998
  • The advent of very large scale integration(VLSI) has had a tremendous impact on the design of fault-tolerant circuits and systems. The increasing density, decreasing power consumption, and decreasing costs of integrated circuits, due in part to VLSI, have made it possible and practical to implement the redundancy approaches used in fault-tolerant computing. The purpose of this paper is to study the many aspects of designing fault-tolerant systems in a VLSI environment. First, we expound upon the opportunities and problemes presented by VLSI technology. Second, we consider in detail the importance of design mistakes, common-mode failures, and transient faults in VLSI. Finally, we examine the techniques available to implement redundancy using VLSI and the problems associated with these techniques.

  • PDF

동기 병렬연산을 위한 응용수준의 결함 내성 연산시스템 (An Application-Level Fault Tolerant System For Synchronous Parallel Computation)

  • 박필성
    • 인터넷정보학회논문지
    • /
    • 제9권5호
    • /
    • pp.185-193
    • /
    • 2008
  • 대규모 병렬 시스템의 MTBF(moon time between failures)는 아주 짧아 겨우 수 시간 단위에 불과하여 장시간의 연산 도중 연산 실패로 끝나 소중한 계산 시간이 낭비되는 경우가 많다. 그러나 현재의 MPI(Message Passing Interface) 표준은 이에 대한 대안을 제시하지 않고 있다. 본 논문에서는, 비표준의 결함 내성 MPI 라이브러리가 아닌 MPI 표준 함수들만을 사용하여, 일반적인 동기 병렬 연산에 적용할 수 있는 응용 수준의 결함 내성 연산 시스템을 제안한다.

  • PDF

Fault-Tolerant Analysis of Redundancy Techniques in VLSI Design Environment

  • Cho, Jai Rip
    • 산업경영시스템학회지
    • /
    • 제22권53호
    • /
    • pp.111-120
    • /
    • 1999
  • The advent of very large scale integration(VLSI) has had a tremendous impact on the design of fault-tolerant circuits and systems. The increasing density, decreasing power consumption, and decreasing costs of integrated circuits, due in part to VLSI, have made it possible and practical to implement the redundancy approaches used in fault-tolerant computing. The purpose of this paper is to study the many aspects of designing fault-tolerant systems in a VLSI environment. First, we expound upon the opportunities and problems presented by VLSI technology. Second, we consider in detail the importance of design mistakes, common-mode failures, and transient faults in VLSI. Finally, we examine the techniques available to implement redundancy using VLSI and the promlems associated with these techniques.

  • PDF

양자점 큐비트 기반 양자컴퓨팅의 국외 연구 동향 분석 (Research Trend for Quantum Dot Quantum Computing)

  • 백충헌;최병수
    • 전자통신동향분석
    • /
    • 제35권2호
    • /
    • pp.79-88
    • /
    • 2020
  • Quantum computing is regarded as one of the revolutionary computing technologies, and has attracted considerable attention in various fields, such as finance, chemistry, and medicine. One of the promising candidates to realize fault tolerant quantum computing is quantum dot qubits, due to their expectation of high scalability. In this study, we briefly introduce the international tendencies for quantum dot quantum computing. First, the current status of quantum dot gate operations is summarized. In most systems, over 99% of single qubit gate operation is realized, and controlled-not and controlled-phase gates as 2-qubit entangling gates are demonstrated in quantum dots. Second, several approaches to expand the number of qubits are introduced, such as 1D and 2D arrays and long-range interaction. Finally, the current quantum dot systems are evaluated for conducting quantum computing in terms of their number of qubits and gate accuracies. Quantum dot quantum computing is expected to implement scalable quantum computing. In the noisy intermediate-scale quantum era, quantum computing will expand its applications, enabling upcoming questions such as a fault-tolerant quantum computing architecture and error correction scheme to be addressed.

Integrating Fuzzy based Fault diagnosis with Constrained Model Predictive Control for Industrial Applications

  • Mani, Geetha;Sivaraman, Natarajan
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권2호
    • /
    • pp.886-889
    • /
    • 2017
  • An active Fault Tolerant Model Predictive Control (FTMPC) using Fuzzy scheduler is developed. Fault tolerant Control (FTC) system stages are broadly classified into two namely Fault Detection and Isolation (FDI) and fault accommodation. Basically, the faults are identified by means of state estimation techniques. Then using the decision based approach it is isolated. This is usually performed using soft computing techniques. Fuzzy Decision Making (FDM) system classifies the faults. After identification and classification of the faults, the model is selected by using the information obtained from FDI. Then this model is fed into FTC in the form of MPC scheme by Takagi-Sugeno Fuzzy scheduler. The Fault tolerance is performed by switching the appropriate model for each identified faults. Thus by incorporating the fuzzy scheduled based FTC it becomes more efficient. The system will be thereafter able to detect the faults, isolate it and also able to accommodate the faults in the sensors and actuators of the Continuous Stirred Tank Reactor (CSTR) process while the conventional MPC does not have the ability to perform it.

Performance Evaluation and Analysis of Multiple Scenarios of Big Data Stream Computing on Storm Platform

  • Sun, Dawei;Yan, Hongbin;Gao, Shang;Zhou, Zhangbing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권7호
    • /
    • pp.2977-2997
    • /
    • 2018
  • In big data era, fresh data grows rapidly every day. More than 30,000 gigabytes of data are created every second and the rate is accelerating. Many organizations rely heavily on real time streaming, while big data stream computing helps them spot opportunities and risks from real time big data. Storm, one of the most common online stream computing platforms, has been used for big data stream computing, with response time ranging from milliseconds to sub-seconds. The performance of Storm plays a crucial role in different application scenarios, however, few studies were conducted to evaluate the performance of Storm. In this paper, we investigate the performance of Storm under different application scenarios. Our experimental results show that throughput and latency of Storm are greatly affected by the number of instances of each vertex in task topology, and the number of available resources in data center. The fault-tolerant mechanism of Storm works well in most big data stream computing environments. As a result, it is suggested that a dynamic topology, an elastic scheduling framework, and a memory based fault-tolerant mechanism are necessary for providing high throughput and low latency services on Storm platform.

클러스터 기반 라우팅 프로토콜을 위한 결함허용기법 (A Fault-tolerant Scheme for Clustering Routing Protocols)

  • 민홍;김봉재;정진만;김석현;윤진혁;조유근;허준영;이상호;홍지만
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제16권6호
    • /
    • pp.668-672
    • /
    • 2010
  • 무선 센서 네트워크에서의 결함 허용은 센서 노드의 취약성 보완과 신뢰성 높은 정보 제공을 위해 필요하다. 센서 노드들의 자원 제약적인 특성 때문에 오류에 노출되기 쉬우며, 기존의 체크포인팅 기법 들은 센서 네트워크의 특성을 고려하지 않고 설계되었기 때문에 이를 적용하기 어렵다. 본 논문에서는 클러스터 기반의 라우팅 프로토콜에 체크포인팅 기법을 적용하여 헤드 노드의 결함 시 발생할 수 있는 정보 손실과 높은 복구 비용 문제를 해결하는 방법을 제안한다.

프랙티컬 비잔틴 장애 허용 기반의 합의 알고리즘의 평가 프레임워크 (Evaluation Framework for Practical Byzantine Fault Tolerant based Consensus Algorithms)

  • 이은영;김남령;한채림;이일구
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2021년도 추계학술대회
    • /
    • pp.249-251
    • /
    • 2021
  • PBFT(Practical Byzantine Fault Tolerant)는 PoW(Proof of Work) 대비 높은 처리 속도를 보장하며 컴퓨팅 파워의 우위로 인한 기록이 번복되지 않는 절대적 최종성을 보장하는 합의 알고리즘이다. 하지만 메시지 복잡도로 인해 참여하는 노드의 수가 증가할수록 네트워크 부하가 지수적으로 증가한다는 한계가 있다. PBFT는 블록체인 네트워크의 성능을 결정짓는 중요한 요소이지만 평가지표와 평가 기술에 관한 연구는 부족한 실정이다. 본 논문에서는 PBFT를 평가할 수 있는 정량적 지표와 개선된 방안을 쉽게 평가할 수 있도록 합의 알고리즘 변경이 편리한 PBFT 평가 프레임워크를 제안한다.

  • PDF

Efficient Fault-Recovery Technique for CGRA-based Multi-Core Architecture

  • Kim, Yoonjin;Sohn, Seungyeon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제15권2호
    • /
    • pp.307-311
    • /
    • 2015
  • In this paper, we propose an efficient fault-recovery technique for CGRA (Coarse-Grained Reconfigurable Architecture) based multi-core architecture. The proposed technique is intra/inter-CGRA co-reconfiguration technique based on a ring-based sharing fabric (RSF) and it enables exploiting the inherent redundancy and reconfigurability of the multi-CGRA for fault-recovery. Experimental results show that the proposed approaches achieve up to 73% fault recoverability when compared with completely connected fabric (CCF).