• Journal of Power Electronics
• /
• 제18권1호
• /
• pp.56-69
• /
• 2018

In this paper, an improved Space Vector Modulation (SVM) based fault tolerant operation on a nine-level Cascaded H-Bridge (CHB) inverter with an additional backup circuit is proposed. Any type of fault in a power converter may result in a power interruption and productivity loss. Three different faults on H-bridge modules in all three phases based on the SVM approach are investigated with diagrams. Any fault in an inverter phase creates an unbalanced output voltage, which can lead to instability in the system. An additional auxiliary unit is connected in series to the three phase cascaded H-bridge circuit. With the help of this and the redundant switching states in SVM, the CHB inverter produces a balanced output with low harmonic distortion. This ensures high DC bus utilization under numerous fault conditions in three phases, which improves the system reliability. Simulation results are presented on three phase nine-level inverter with the automatic fault detection algorithm in the MATLAB/SIMULINK software tool, and experimental results are presented with DSP on five-level inverter to validate the practicality of the proposed SVM fault tolerance strategy on a CHB inverter with an auxiliary circuit.

• 드라이브 ㆍ 컨트롤
• /
• 제16권3호
• /
• pp.23-32
• /
• 2019

This study proposed a fault tolerant control algorithm for electro-hydraulic brake systems where permanent magnet synchronous motor (PMSM) drive is adopted to boost the braking pressure. To cope with motor position sensor faults in the PMSM drive, a braking pressure controller based on an open-loop speed control method for the PMSM was proposed. The magnitude of the current vector was determined from the target braking pressure, and motor rotational speed was derived from the pressure control error to build up the braking pressure. The position offset of the pump piston resulting from a leak in the hydraulic system is also compensated for using the open-loop speed control by moving the piston backward until it is blocked at the end of stroke position. The performance and stability of the proposed controller were experimentally verified. According to the results, the control algorithm can be utilized as an effective means of degraded control for electro-hydraulic brake systems in the case that a motor position sensor fault occurs.

• 한국정보처리학회논문지
• /
• 제4권6호
• /
• pp.1464-1480
• /
• 1997

분산 시스템은 높은 성능, 결함 허용성, 정보와 자원의 공유 등을 이룰 수 있는 환경을 제공한다. 그러나 분산 시스템 내에서 발생하는 사건과 상태들을 적절히 관리하지 못하면 이러한 장점의 혜택을 받을 수 없게 된다. 이러한 사건과 상태들은 성능 저하, 동작 오류, 수상한 행위 등의 징후가 될 수 있으므로 자세히 분석되어야 한다. 사건/상태를 적절히 관리하려면 이들을 명세하고 효율적으로 탐지할 수 있어야 한다. 본 논문에서는 사건/상태의 중앙 집중 탐지 알고리즘에 대해 설명한다. 다음 계층적 구조를 갖는 분산 시스템에서 이 탐지 알고리즘을 분산화 하는 방안에 대해 설명한다. 분산 알고리즘은 사건/상태 탐지 임무를 부임무들로 분해하는 과정과 부임무들을 적절한 노드들에 할당하는 과정으로 구성된다. 또 이 분산 탐지 알고리즘이 결함 허용성을 갖도록 하는 방안에 대해서도 설명한다.

• 전자공학회논문지CI
• /
• 제41권4호
• /
• pp.51-58
• /
• 2004

본 논문에서는 fault tolerant 하드웨어에서 가장 기본이 되는 온라인 하드웨어 테스트 시스템 구현을 위하여 새로운 인공면역 알고리즘을 제안한다. 인공 면역 알고리즘은 알려진 자기(self) 정보만을 이용하여 항체 즉 tolerance condition을 가장 최적으로 생성하는 알고리즘이다. 이를 위하여 본 논문에서는 생체 면역 시스템의 중요한 원리인 antibody diversity 원리를 적용한 새로운 tolerance condition 생성 알고리즘을 제안한다. 또한 생체 면역 시스템에서의 중요한 세포인 APC (Antigen Presenting Cell)를 Quine-McCluskey 방법으로 구현한 후 유전자 알고리즘을 통해 tolerance condition을 자동 생성하는 알고리즘을 구현한다. 이렇게 제안된 알고리즘은 FSM(Finite State Machine)의 가장 전형적인 예인 십진카운터에 적용한 후 컴퓨터 모의 실험을 통해 그 성능을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3965-3982
• /
• 2015

Event detection is one of the key issues in many wireless sensor network (WSN) applications. The uncertainties that are derived from the instability of sensor node, measurement noise and incomplete sampling would influence the performance of event detection to a large degree. Many of the present researches described the sensor readings with crisp values, which cannot adequately handle the uncertainties inhered in the imprecise sensor readings. In this paper, a fault-tolerant event detection algorithm is proposed based on Dempster-Shafer (D-S) theory (also called evidence theory). Instead of crisp values, all possible states of the event are represented by the Basic Probability Assignment (BPA) functions, with which the output of each sensor node are characterized as weighted evidences. The combination rule was subsequently applied on each sensor node to fuse the evidences gathered from the neighboring nodes to make the final decision on whether the event occurs. Simulation results show that even 20% nodes are faulty, the accuracy of the proposed algorithm is around 80% for event region detection. Moreover, 97% of the error readings have been corrected, and an improved detection capability at the boundary of the event region is gained by 75%. The proposed algorithm can enhance the detection accuracy of the event region even in high error-rate environment, which reflects good reliability and robustness. The proposed algorithm is also applicable to boundary detection as it performs well at the boundary of the event.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권10호
• /
• pp.553-561
• /
• 2004

결함 허용(fault-tolerant) 분산 시스템 구축 시 리더 선출(leader election)은 중요한 문제이다. 전통적인 방법으로 타임아웃에 기초한 동기적 분산 시스템을 위한 불리(Bully) 알고리즘이 있다. 본 논문에서는 타임아웃보다는 Failure Detector를 이용한 수정된 불리 알고리즘을 제시하고, 또한 전통적인 불리 알고리즘과 비교하여 수정된 불리 알고리즘의 수행 속도가 빠름을 보여주고 있다. 그 이유는 수정된 불리 알고리즘 수행 시 각 프로세스의 정상적인 작동 여부를 FD를 이용하여 빠르게 처리함으로써 처리 속도의 효율성이 높다는 점이다. 특히 다수의 프로세스들이 시스템으로 연결되어 있고, 각 프로세스에서 작동하는 프로세스들의 고장과 회복이 빈번히 발생하는 분산 시스템에서 FD를 이용하는 불리 알고리즘의 수행 속도는 전통적인 불리 알고리즘에 비해 훨씬 빠름을 보여 준다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.199-202
• /
• 2001

In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.

• ETRI Journal
• /
• 제42권3호
• /
• pp.388-398
• /
• 2020

We herein propose a heuristic redundancy selection algorithm that combines resubmission, replication, and checkpointing redundancies to reduce the resiliency overhead in fault-tolerant workflow scheduling. The appropriate combination of these redundancies for workflow tasks is obtained in two consecutive phases. First, to compute the replication vector (number of task replicas), we apportion the set of provisioned resources among concurrently executing tasks according to their needs. Subsequently, we obtain the optimal checkpointing interval for each task as a function of the number of replicas and characteristics of tasks and computational environment. We formulate the problem of obtaining the optimal checkpointing interval for replicated tasks in situations where checkpoint files can be exchanged among computational resources. The results of our simulation experiments, on both randomly generated workflow graphs and real-world applications, demonstrated that both the proposed replication vector computation algorithm and the proposed checkpointing scheme reduced the resiliency overhead.

• 전기학회논문지
• /
• 제57권5호
• /
• pp.896-901
• /
• 2008

This paper addresses the foot force distribution problem for quadruped robots with a failed leg. The quadruped robot has fault-tolerant straight-line gaits with one leg in locked-joint failure, and has discontinuous motion with respect to the robot body. The proposed method is operated in two folds. When the robot body stands still, we use the feature that there are always three supporting legs, and by incorporating the theory of zero-interaction force, we calculate the foot forces analytically without resort to any optimization technique. When the robot body moves, the conventional pseudo-inverse algorithm is applied to obtain the foot forces for supporting legs. Simulation results show the validity of the proposed scheme.

• 한국정보처리학회논문지
• /
• 제6권5호
• /
• pp.1203-1211
• /
• 1999

Checkpointing is the one of fault-tolerant techniques to restore faults and to restart job fast. Checkpointing algorithms in distributed systems have been studied for many years. These algorithms can be classified into synchronous Checkpointing algorithms and asynchronous Checkpoiting algorithms. In this paper, we propose an independent Checkpointing algorithm that has a minimum Checkpointing counts equal to periodic Checkpointing algorithm, and relatively short rollback distance at faulty situation. Checkpointing count is directly related to task completion time in a fault-free situation and short rollback distance is directly related to task completion time in a faulty situation. The proposed algorithm is compared with the previously proposed asynchronous Checkpointing algorithms using simulation. In the simulation, the proposed Checkpointing algorithm produces better results than other algorithms in terms of task completion time in fault-free as well as faulty situations.