• Title/Summary/Keyword: fault tolerant computing

Search Result 68, Processing Time 0.027 seconds

Design and Implementation of Reliable Distributed Programming Environment based on HORB (HORB에 기반한 신뢰성 있는 분산 프로그래밍 환경의 설계 및 구현)

  • Hyun, Mu-Yong;Kim, Shik;Kim, Myung-Jun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.2
    • /
    • pp.1-9
    • /
    • 2002
  • The use of Object-Oriented Distributed Programming(OODP) environment such as DCOM, DSOM, Java RMI, CORBA to implement distributed applications is becoming increasingly popular. However, absence of a fault-tolerance feature in these middleware platforms complicates the design and implementation of reliable distributed object-based applications, although they greatly enhance the quality and reusability of the distributed object-based applications. In this paper, we propose a fault-tolerant programming environment based on RMI, namely Evergreen, for the reliable distributed computing with checkpoints and rollback-recovery mechanism. Based on a series of experiments, we evaluate the performance of Evergreen and find its possibility of extension to fully support our optimal design goal.

Fault Tolerant System based on Recovery Agents (회복 에이전트 기반 결함 포용 시스템)

  • Lee, Hwa-Min;Jung, Soon-Young;Yu, Heon-Chang
    • The Journal of Korean Association of Computer Education
    • /
    • v.5 no.2
    • /
    • pp.21-28
    • /
    • 2002
  • This paper proposes a new approach to rollback-recovery using multi-agent in distributed computing system. Previous rollback-recovery protocols are dependent on inherent communication and operating system, which causes a decline of computing performance in distributed computing system. By using multi-agent, we propose rollback-recovery protocol that is independent on operating system. We define three kinds of agent. One is a recovery agent that performs rollback-recovery protocol after a failure. Other is an information agent that constructs domain knowledge as a rule of fault tolerance and information during failure-free operation. The other is facilitator agent that controls the efficient communication between agents. Also we propose rollback-recovery protocol using multi-agent and simulated the proposed rollback-recovery protocol using JAVA and agent communication language in CORBA environment.

  • PDF

Quick Diagnosis of Short Circuit Faults in Cascaded H-Bridge Multilevel Inverters using FPGA

  • Ouni, Saeed;Zolghadri, Mohammad Reza;Rodriguez, Jose;Shahbazi, Mahmoud;Oraee, Hashem;Lezana, Pablo;Schmeisser, Andres Ulloa
    • Journal of Power Electronics
    • /
    • v.17 no.1
    • /
    • pp.56-66
    • /
    • 2017
  • Fast and accurate fault detection is the primary step and one of the most important tasks in fault tolerant converters. In this paper, a fast and simple method is proposed to detect and diagnosis the faulty cell in a cascaded H-bridge multilevel inverter under a short circuit fault. In this method, the reference voltage is calculated using switching control pulses and DC-Link voltages. The comparison result of the output voltage and the reference voltage is used in conjunction with active cell pulses to detect the faulty cell. To achieve this goal, the cell which is active when the Fault signal turns to "0" is detected as the faulty cell. Furthermore, consideration of generating the active cell pulses is completely described. Since the main advantage of this method is its simplicity, it can be easily implemented in a programmable digital device. Experimental results obtained with an 11-level inverter prototype confirm the effectiveness of the proposed fault detection technique. In addition, they show that the diagnosis method is unaffected by variations of the modulation index.

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 and Performance Analysis of Group Communication using the CORBA & JAVA (CORBA와 JAVA를 이용한 그룹통신 구현 및 성능 분석)

  • Choe, Man-Eok;Gu, Yong-Wan
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.461-468
    • /
    • 2001
  • Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems such as load balancing, unpredictable communication delays, partial errors, and networking failures. Therefore, sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted communication. In this paper, we present our design, implementation and performance analysis of group communication using the CORBA ORB, JAVA RMI, Socket based on distributed computing. We anticipate our study may apply to the various field of applications such as fault-tolerant client/server system, groupware, scalable text retrieval system, and financial information systems.

  • PDF

Time-triggered Message-triggered Object Programming Scheme and Its Support Middleware

  • (Kane)Kim, K.H.;Kim, M.H.;Rim, K.W.
    • Korea Information Processing Society Review
    • /
    • v.11 no.6
    • /
    • pp.8-24
    • /
    • 2004
  • OO RT programming is a technology expected to flourish in this quarter of the 21st century. Currently, its youthfulness is indicated by the insufficient availability of the support middleware and the associated API, let alone language compilers. The middleware providing fault-tolerant execution support is in its infancy. The advances in OO RT distributed programming will also enable large-scale RT simulations. The research community dealing with this technology area is expected to grow continuously for foreseeable future and consequent accelerations of the technology advances will in turn accelerate the development of many new types of sophisticated RT DC applications as well as realization of advanced types of ubiquitous computing societies.

  • PDF

Computing and Reducing Transient Error Propagation in Registers

  • Yan, Jun;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.2
    • /
    • pp.121-130
    • /
    • 2011
  • Recent research indicates that transient errors will increasingly become a critical concern in microprocessor design. As embedded processors are widely used in reliability-critical or noisy environments, it is necessary to develop cost-effective fault-tolerant techniques to protect processors against transient errors. The register file is one of the critical components that can significantly affect microprocessor system reliability, since registers are typically accessed very frequently, and transient errors in registers can be easily propagated to functional units or the memory system, leading to silent data error (SDC) or system crash. This paper focuses on investigating the impact of register file soft errors on system reliability and developing cost-effective techniques to improve the register file immunity to soft errors. This paper proposes the register vulnerability factor (RVF) concept to characterize the probability that register transient errors can escape the register file and thus potentially affect system reliability. We propose an approach to compute the RVF based on register access patterns. In this paper, we also propose two compiler-directed techniques and a hybrid approach to improve register file reliability cost-effectively by lowering the RVF value. Our experiments indicate that on average, RVF can be reduced to 9.1% and 9.5% by the hyperblock-based instruction re-scheduling and the reliability-oriented register assignment respectively, which can potentially lower the reliability cost significantly, without sacrificing the register value integrity.

New Parity-Preserving Reversible Logic Gate (새로운 패리티 보존형 가역 논리게이트)

  • Kim, Sung-Kyoung;Kim, Tae-Hyun;Han, Dong-Guk;Hong, Seok-Hie
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.1
    • /
    • pp.29-34
    • /
    • 2010
  • This paper proposes a new parity-preserving reversible logic gate. It is a parity-preserving reversible logic gate, that is, the party of the outputs matches that of the inputs. In recent year, reversible logic gate has emerged as one of the important approaches for power optimization with its application in low CMOS design, quantum computing and nono-technology. We show that our proposed parity-preserving reversible logic gate is much better in terms of number of reversible logic gates, number of garbage-outputs and hardware complexity with compared ti the exiting counterpart.

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

  • Sharma, Bharti;Bhatia, Ravinder Singh;Singh, Awadhesh Kumar
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.36-54
    • /
    • 2014
  • Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

Synchronize Ethernet-based Fault Injection Algorithm Implementation for Intelligent Automotive Network (차량용 지능형 네트워크에서의 동기식 이더넷중심 오류 주입 알고리즘 구현☆)

  • Jang, Eunji;Kim, Inyoung;Lee, Woongjae
    • Journal of Internet Computing and Services
    • /
    • v.17 no.4
    • /
    • pp.43-50
    • /
    • 2016
  • In this paper, we propose the protocol of Ethernet that will receive a popular interesting in the automotive intelligent network, it also attempts to implementation and verification through simulation and experiments to propose a fault tolerance algorithm when the data transfer on it. It has proven the usefulness of the system in order to apply toward an existing automotive communication system. In the case of actual real-time data for automotive industry, we generated a randomly-generated data which is the set of payload into a standard format to complete the experiment. Among the implemented existing algorithms performance, we confirmed the effectiveness of all range from a single data to mixed (Hybrid-type) data, to verify the proposed algorithm.