• Title/Summary/Keyword: Fault-Tolerant Computer

Search Result 195, Processing Time 0.027 seconds

A New Artificial Immune System Based on the Principle of Antibody Diversity And Antigen Presenting Cell (Antibody Diversity 원리와 Antigen Presenting Cell을 구현한 새로운 인공 면역 시스템)

  • 이상형;김은태;박민용
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.51-58
    • /
    • 2004
  • This paper proposes a new artificial immune approach to on-line hardware test which is the most indispensable technique for fault tolerant hardware. A novel algorithm of generating tolerance conditions is suggested based on the principle of the antibody diversity. Tolerance conditions in artificial immune system correspond to the antibody in biological immune system. In addition, antigen presenting cell (APC) is realized by Quine-McCluskey method in this algorithm and tolerance conditions are generated through GA (Genetic Algorithm). The suggested method is applied to the on-line monitoring of a typical FSM (a decade counter) and its effectiveness is demonstrated by the computer simulation.

Design of the Kernel Hardening in USB Driver for Linux DLM Function (리눅스 운영체제에서 DLM을 이용한 USB 디바이스 커널 하드닝 설계)

  • Jang, Seung-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2579-2585
    • /
    • 2009
  • It is an important problem without system breaking. Like this, to make a computer system operate normally, various commercial fault tolerant techniques are used. Almost commercial products of fault tolerant system consume much cost. This paper proposes kernel hardening technique that are reducing panic using DLM modue in Linux USB driver. I experimented the design technique in Linux O.S. By the experiment, the suggesting technique which includes USB module with DLMis working well.

Design and Evaluation of a Fault-tolerant Publish/Subscribe System for IoT Applications (IoT 응용을 위한 결함 포용 발행/구독 시스템의 설계 및 평가)

  • Bae, Ihn-Han
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.8
    • /
    • pp.1101-1113
    • /
    • 2021
  • The rapid growth of sense-and-respond applications and the emerging cloud computing model present a new challenge: providing publish/subscribe middleware as a scalable and elastic cloud service. The publish/subscribe interaction model is a promising solution for scalable data dissemination over wide-area networks. In addition, there have been some work on the publish/subscribe messaging paradigm that guarantees reliability and availability in the face of node and link failures. These publish/subscribe systems are commonly used in information-centric networks and edge-fog-cloud infrastructures for IoT. The IoT has an edge-fog cloud infrastructure to efficiently process massive amounts of sensing data collected from the surrounding environment. In this paper. we propose a quorum-based hierarchical fault-tolerant publish/subscribe systems (QHFPS) to enable reliable delivery of messages in the presence of link and node failures. The QHFPS efficiently distributes IoT messages to the publish/subscribe brokers in fog overlay layers on the basis of proposing extended stepped grid (xS-grid) quorum for providing tolerance when faced with node failures and network partitions. We evaluate the performance of QHFPS in three aspects: number of transmitted Pub/Sub messages, average subscription delay, and subscritpion delivery rate with an analytical model.

Fault Tolerant Routing Algorithm Based On Dynamic Source Routing

  • Ummi, Masruroh Siti;Park, Yoon-Young;Um, Ik-Jung;Bae, Ji-Hye
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.223-224
    • /
    • 2009
  • A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. In this paper, we proposed new route maintenance algorithm to improve the efficiency and effective in order to reach destination node. In this algorithm we improve existing route maintenance in Dynamic Source Routing protocol, to improve the algorithm we make a new message we call Emergency Message (EMM). The emergency message used by the node moved to provide information of fault detection.

Fault Hamiltonicity of Meshes with Two Wraparound Edges (두 개의 랩어라운드 에지를 갖는 메쉬의 고장 해밀톤 성질)

  • 박경욱;이형옥;임형석
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.434-444
    • /
    • 2003
  • In this paper, we consider the hamiltonian properties of m$\times$n (m$\geq$2, n$\geq$3) mesh networks with two wraparound edges on the first row and last row, called M$_2$(m, n), in the presence of a faulty node or link. We prove that M$_2$(m, n) with odd n is hamiltonian-connected and 1-fault hamiltonian. In addition, we prove that M$_2$(m, n) with even n is strongly hamiltonian laceable and 1-vertex fault tolerant strongly hamiltonian laceable.

A Study on The Design of The Self-Checking Comparator Using Time Diversity (시간 상이점을 이용한 자체 검진 비교기의 설계에 관한 연구)

  • 신석균;양성현;이기서
    • Proceedings of the KSR Conference
    • /
    • 1998.11a
    • /
    • pp.270-279
    • /
    • 1998
  • This paper presents the design of self-checking comparator using the time diversity and the application to 8 bit CPU for the implementation of fault tolerant computer system. this self-checking comparator was designed with the different time Points in which temporary faults were raised by electrical noise between duplicated functional blocks. also this self-checking comparator was simulated in the method of the fault injection using 4 bit shift register counter. we designed the duplicated Emotional block and the self-checking comparator in the single chip using the Altera EPLD and could verify the reliability and the fault detection coverage through the modeling of temporary faults ,especially intermittent faults. at the results of this research, the reliability and the fault detection coverage were implemented through the self-checking comparator using the time diversity.

  • PDF

A recovery scheme of the Fault-tolerant Process (결함 허용 프로세스 복구 기법)

  • Kim, Sin-Ho;Rim, Seong-Rak
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.443-446
    • /
    • 2003
  • 프로세스 복구 기법은 장시간 실행을 요하는 프로세스에서 시스템 결함으로 인하여 발생하는 심각한 피해를 최소화하기 위하여 절대적으로 요구된다. 프로세스의 무결성을 지원하기 위한 예방 및 회피책은 결함 발생의 원인 규명과 예측에 의한 오버헤드가 있다. 본 논문에서는 이러한 오버헤드를 최소화하기 위한 결함 허용 프로세스 복구 기법을 제시한다. 제시한 기법은 프로세스의 실행 상태 저장 및 복구 기능을 위한 두 개의 시스템 호출을 설계하고, 리눅스 커널 2.4.18 내부에 구현하여 그 타당성을 검토하였다.

  • PDF

Design and Implementation of Network Fault-Tolerant Application Software Streaming (네트워크 고장감내 소프트웨어 스트리밍 기술의 설계 및 구현)

  • Shim, Jeong-Min;Kim, Won-Young;Choi, Wan
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.10
    • /
    • pp.126-133
    • /
    • 2006
  • Application software streaming is a virtualization technology that enables users to use applications without installation on her/his computer. With application streaming service, a client immediately starts and uses the application as if it were installed. The application can be executed while executable codes for the application may still be streamed. Since the software streaming is based on networks, its service is affected by network failures. Network failures may cause the streamed application to stop, and to make it worse, also the system may crash because executable codes for the application can't be streamed from the streaming server. Using the Pareto principle (80 vs. 20 rule), users can be served continuously with the minimum functions that are frequently used, pre-fetched and cached if we provide a more intelligent and fault-tolerant streaming technique. This paper proposes the concept and technique named Evergreen. Using the Evergreen technique, users can continue using the streamed application while a network failure occurs, although user can access only the streamed code. We also discuss the implementation of Evergreen technique in details.

  • PDF

Fault Tolerant Control Using Sliding Mode Control with Adaptation Laws for a Satellite (적응 법칙을 적용한 슬라이딩 모드 제어를 이용한 위성의 고장 허용 제어)

  • Shin, Miri;Kang, Chul Woo;Park, Chan Gook
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.41 no.2
    • /
    • pp.98-106
    • /
    • 2013
  • This paper proposes fault tolerant control laws using sliding mode control and adaptation laws for a satellite with reaction wheel faults. Considering system parameter errors and faults uncertainties in the dynamics of satellite, the control laws were designed. It was assumed that only reaction wheel failures occurred as faults. The reaction wheel faults were reflected in the multiply form. Because the proposed control laws satisfy the Lyapunov stability theorem, the stability is guaranteed. Through computer simulation, it was assured that the proposed adaptive sliding mode controller has a better performance than the existing sliding mode controller under unstable angular rates.

A Dynamic Checkpoint Scheduling Scheme for Fault Tolerant Distributed Computing Systems (결함 내성 분산 시스템에서의 동적 검사점 스케쥴링 기법)

  • Park, Tae-Soon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.75-86
    • /
    • 2002
  • The selection of the optimal checkpointing interval has been a very critical issue to implement a checkpointing recovery scheme for the fault tolerant distributed system. This paper presents a new scheme that allows a process to select the proper checkpointing interval dynamically. A process in the system evaluates the cost of checkpointing and possible rollback for each checkpointing interval and selects the proper time interval for the next checkpointing Unlike the other scheme, the overhead incurred by both of the checkpointing and rollback activities are considered for the cost evaluation and current communication pattern is reflected in the selection of the checkpointing interval. Moreover, the proposed scheme requires no extra message communication for the checkpointing interval selection and can easily be incorporated into the existing checkpointing coordination schemes.