• Title/Summary/Keyword: Fault-Tolerant Computer

Search Result 195, Processing Time 0.026 seconds

Fail-safe logic for EPB (Electric Parking Brake) system (차량용 전자제어식 주차 브레이크 시스템을 위한 고장 안전 기법)

  • Chung, Han-Byul;Lee, Choong-Woo;Lee, Doo-Ho;Chung, Chung-Choo;Son, Young-Seop;Yoon, Pal-Joo
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.1836-1837
    • /
    • 2006
  • 본 논문에서는 차량용 전자제어식 주차 브레이크(Electric Parking Brake, EPB) 시스템의 고장 허용 제어(fault tolerant control)를 위한 고장 안전 기법(fail-safe logic)을 제안한다. 고장 안전 기법의 구현을 위하여 EPB 구동 모터에 흐르는 전류 리플을 측정하여 센서리스 위치 추정을 한다. 추정값과 홀 센서의 출력을 비교하여 잔차(residual)를 발생하고, 이를 이용하여 시스템 내부의 고장을 진단하고 고장 안전 기법을 통하여 전체 시스템의 오작동을 방지한다. 시스템 오작동을 방지하기 위한 고장 안전 기법에 대하여 정의하고 모의실험을 통하여 내부 시스템의 고장이 발생 시 이 기법이 고장을 진단하고 시스템을 안전하게 운영할 수 있음을 확인하였다.

  • PDF

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.148-164
    • /
    • 2015
  • The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

Identity-Based Key Agreement Protocol Employing a Symmetric Balanced Incomplete Block Design

  • Shen, Jian;Moh, Sangman;Chung, Ilyong
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.682-691
    • /
    • 2012
  • Key agreement protocol is a fundamental protocol in cryptography whereby two or more participants can agree on a common conference key in order to communicate securely among themselves. In this situation, the participants can securely send and receive messages with each other. An adversary not having access to the conference key will not be able to decrypt the messages. In this paper, we propose a novel identity-based authenticated multi user key agreement protocol employing a symmetric balanced incomplete block design. Our protocol is built on elliptic curve cryptography and takes advantage of a kind of bilinear map called Weil pairing. The protocol presented can provide an identification (ID)-based authentication service and resist different key attacks. Furthermore, our protocol is efficient and needs only two rounds for generating a common conference key. It is worth noting that the communication cost for generating a conference key in our protocol is only O($\sqrt{n}$) and the computation cost is only O($nm^2$), where $n$ implies the number of participants and m denotes the extension degree of the finite field $F_{p^m}$. In addition, in order to resist the different key attack from malicious participants, our protocol can be further extended to provide the fault tolerant property.

A Study on Diagnosis Methods for a High Available Clustering Web Server (고가용성 클러스터 웹 서버의 로드밸런스에 대한 고장진단기법 연구)

  • Lee, Sang-Moon;Ko, Soung-Jun;Kang, Sing-Jun;Kwak, Tae-Young;Kim, Hag-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2962-2964
    • /
    • 2000
  • 최근 웹의 사용이 일반화되면서 인터넷의 사용자가 급속히 증가하고 있어서. 기존의 단일 웹서버 방식에서는 막대한 접속 트래픽의 수용과 유연한 시스템 확장 등의 문제점이 예상되고 있다. 이와 함께 business-critical한 작업의 경우, 웹서버의 안정성 및 가용성 문제가 가장 중요한 문제로 지적되고 있어서 이러한 문제를 해결할 수 있는 웹전용 서버를 개발이 절대적으로 필요하다. 본 연구에서는 이를 위해. 급격한 트래픽 변화의 수용 및 웹서버의 확장성이 용이한 가상머신 개념과 고신뢰성의 시스템 운영을 위한 고장포용(fault-tolerant)기법을 적용하여 클러스터링 웹전용 서버를 구축하고, 특히 클러스터 웹서버의 부하를 분배해주는 로드밸런서의 고가용성 보장을 위해 heartbeat, fake, mon등의 기법을 이용하여 백업(backup)을 구현한다. 또한 구현된 시스템의 고성능 및 고가용성을 극대화하고. 시스템의 고장시 데이터 손실의 최소화와 이의 복구를 위해 고장 검출 및 진단 기법에 대한 방안을 제시한다.

  • PDF

Leader Decision Protocol for Dynamic Changing Topology in Mobile Ad hoc Networks (모바일 ad hoc 네트워크에서 동적인 토폴로지 변화에 따른 리더 결정)

  • Kim, Young-Lan;Han, Hyun-Goo;Park, Sung-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.11
    • /
    • pp.4543-4552
    • /
    • 2010
  • A leader is a special process who roles as the coordinator within multiple processes of a group. In a distributed system, leader election is the procedure of electing a coordinator. This is a very important issue for building fault-tolerant distributed systems. When two normal mobile ad hoc networks are merged, there are two leaders. This violates the safety property, so a mechanism to detect and handle are required. In mobile ad hoc distributed computing system, we propose a leader competition protocol and to prove the temporal logic to it. This solution is based on the group membership detection algorithm.

Fault-Tolerant Algorithm using Multi-Connectivity of Communication Networks (통신망의 다중연결성을 이용한 결함허용 알고리즘)

  • Moon, Yun-Ho;Kim, Byung-Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.53-60
    • /
    • 2000
  • The purpose of this paper is to propose new recovery algorithm for case of a system element raises communication obstacle due to faults in networks, Also we are simulate the algorithm using adjacency matrix. We recover one faulty node per each excution of proposed algorithm so that we can be reconstruct the faulty system gradually to communicatable network. For that, this paper propose a new recovery algorithm named MATRECO which connect the recovery process is simulated by use of adjacency matrix.

  • PDF

Concurrency Control Method to Provide Transactional Processing for Cloud Data Management System

  • Choi, Dojin;Song, Seokil
    • International Journal of Contents
    • /
    • v.12 no.1
    • /
    • pp.60-64
    • /
    • 2016
  • As new applications of cloud data management system (CDMS) such as online games, cooperation edit, social network, and so on, are increasing, transaction processing capabilities for CDMS are required. Several transaction processing methods for cloud data management system (CDMS) have been proposed. However, existing transaction processing methods have some problems. Some of them provide limited transaction processing capabilities. Some of them are hard to be integrated with existing CDMSs. In this paper, we proposed a new concurrency control method to support transaction processing capability for CDMS to solve these problems. The proposed method was designed and implemented based on Spark, an in-memory distributed processing framework. It uses RDD (Resilient Distributed Dataset) model to provide fault tolerant to data in the main memory. In our proposed method, database stored in CDMS is loaded to main memory managed by Spark. The loaded data set is then transformed to RDD. In addition, we proposed a multi-version concurrency control method through immutable characteristics of RDD. Finally, we performed experiments to show the feasibility of the proposed method.

The Construction of Universal Mulitple Processing Unit based on De Bruijn Graph

  • Park, Chun-Myoung;Song, Hong-Bok
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.959-962
    • /
    • 2002
  • This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on De Bruijn Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the De Bruijn graph using properties of graph. Secondly we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU is capable of constructing the De Bruijn geraph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

  • PDF

Implementation of High-Reliable MVB Network for Safety System of Nuclear Power Plant (원자력발전소 안전계통용 고신뢰성 MVB 네트워크 구현)

  • Sul, Jae-Yoon;Kim, Ki-Chang;Kim, Yoo-Sung;Park, Jae-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.6
    • /
    • pp.859-864
    • /
    • 2012
  • The computer network plays an important role in modern digital controllers within a safety system of a nuclear power plant. For the reliable and realtime data communication between controllers, this paper proposes a modified high-reliable MVB(multi-function vehicle bus) as a main control network for a safety system of a nuclear power plant. The proposed network supports the state-based communication in order to ensure the deterministic communication latency, and very fast network recovery when the bus master fails compare to the standard MVB. This paper also shows the implementation results using a FPGA-based testbed.

Reduction Characteristics of Vibration and Acoustic Noise of SRM Using Hybrid Excitation Method (하이브리드 여자방식을 이용한 SRM의 진동 소음 저감 특성)

  • Kim, Chang-Seop;O, Seok-Gyu;An, Jin-U
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.50 no.9
    • /
    • pp.438-444
    • /
    • 2001
  • The simple motor construction and low cost, fault tolerant power electronic drive has made the switched reluctance drive a strong contender for many applications. But the switched reluctance drive does exhibit higher levels of vibration and acoustic noise than that of most competing drives. The main source of vibration in the switched reluctance drive is generated by rapid change of radial force when phase current is extinguished during commutation action. In this paper, a hybrid excitation method is proposed to reduce vibration and acoustic noise of the switched reluctance drive. The hybrid excitation has 2-phase excitation by long dwell angle as well as conventional 1-phase excitation. The vibration and acoustic noise are reduced because the scheme reduces abrupt change of excitation level by distributed and balanced excitation.

  • PDF