• Title/Summary/Keyword: Fault Recovery

Search Result 311, Processing Time 0.029 seconds

Real-Time Object Model dRTO (실시간 객체 모델 dRTO)

  • Lee, Sheen;Son, Hyuk-Su;Yang, Seung-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.300-312
    • /
    • 2000
  • The application areas of embedded real-time systems are very wide and so are the requirements for real-time processing and reliability of the systems. To develop embedded real-time systems effectively with its real-time and reliability properties guaranteed, an appropriate real-time model is needed. Recently, the research on real-time object-oriented model is active, which graft the concept of object-orientation on real-time systems modeling and development. In this paper, we propose dRTO (dependable Real-Time Object) model, with 5 primitive classes. These allow designers to effectively model the characteristics of real-time systems, i.e., object-orientation, real-time-ness and dependability. The dRTO model has three main features. First, it is able to model and implement the timing constraints imposed on real-time objects as well as interactions among the objects. Second, hardware and software components (including kernel) of embedded systems can be modeled in one frame. Third, it is able to represent fault detection and recovery mechanisms explicitly.

  • PDF

On the Properties and Intersection Feature of the Ductile Shear Zone (Chonju shear zone) near Yongkwang-Eub (영광(靈光) 부근(附近) 연성전단대(延性剪斷帶)(전주전단대(全州剪斷帶))의 성질(性質)과 교차양상(交叉樣相)에 관(關)하여)

  • Jeon, Kyeong Seok;Chang, Tae Woo;Lee, Byung Joo
    • Economic and Environmental Geology
    • /
    • v.24 no.4
    • /
    • pp.435-446
    • /
    • 1991
  • Ductile shear zones developed in Jurassic granites in the Yonggwang area show NE trend at the eastern part and nearly EW trend at the western part, respectively. Judged from shear sense indicators, they have resulted from dextral strike-slip movement. The intersection of both trends is thought to be due to the truncation and offset of NE shear zone Chonju Shear zone by the brittle Yonggwang fault which runs in near EW direction with sinistral movement sense. The simple shear deformation was predominate through the deformation in this ductile shear zone. Based on this deformation mechanism, the shear strain (${\gamma}$) estimated in domain 1 increases from 0.14 at the shear zone margin to 9.41 toward the center of shear zone. Total displacement obtained only from this measured section(JK 59 to JK14) appecars to be 1434.5 meters. The sequential development of microstructures can be divided into three stages; weakly-foliated, well-foliated and banded-foliated stages. In the weakly-foliated stage dislocation glide mechanism might be predominant. In the well-foliated stage grain boundary migration and progressive misorientation of subgrains was remarkable during dynamic recovery and recrystallization. In the banded-foliated stage grain boundary sliding and microfracturing mechanisms accompanied with crushing and cracking were marked. According to strain analysis from quartzites of the metasedimentary rocks, strain intensity (${\gamma}$) of the samples within the ductile shear zone ranges from 2.7 to 5.7, while that of the samples out of the ductile shear zone appears to be about 1.7.

  • PDF

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

  • Wang, Jun;Yi, Qiong;Chen, Yunfei;Wang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.227-247
    • /
    • 2018
  • For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

An Implementation of Realtime Remote-Monitoring System for Distributed Photovoltaic Power Plants (분산형 태양광 발전 시스템을 위한 실시간 원격 모니터링 시스템 구현)

  • Kim, Chang-Joon;Kim, Jung-Ki;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2450-2456
    • /
    • 2015
  • In this paper, we propose a real-time remote monitoring system for distributed solar power generation system. The proposed system consists of PVC, UTC, OTC and monitoring server. PVC collects the operational information from the PV's inverter via serial interface. The sensing data is transmitted to the server by wireless communications and stored in the DB server. The PV's status is monitored via UTC, and the operating of PVC and UTC are managed by OTC. In addition, by providing information about the power generated by PV system and failure diagnosis in real time, the proposed system shows the possibility of reducing the maintenance costs and improved failure recovery time.

Design and Implementation of a User-based MPI Checkpointer for Portability (이식성을 고려한 사용자기반 MPI 체크포인터의 설계 및 구현)

  • Ahn Sun-Il;Han Sang-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.35-43
    • /
    • 2006
  • An MPI Checkpointer is a tool which provides fault-tolerance through checkpointing The previous researches related to the MPI checkpointer have focused on automatic checkpointing and recovery capabilities, but they haven't considered portability issues. In this paper, we discuss design and implementation issues considered for portability when we developed an MPI checkpointer called STFT. In order to increase portability, firstly STFT supports the abstraction interface for a single process checkpointer. Secondly, STFT uses a user-based checkpointing method, and limits possible checkpointing places a user can make. Thirdly, STFT lets the MPI_Init create network connections to the other MPI processes in a fixed order. With these features, we expect STFT can be easily adaptable to various platforms and MPI implementations, and confirmed STFT is easily adaptable to LAM and MPICH/P4 with the prototype Implementation.

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

A Level Group Streaming Technique for Interactive VOD based on P2P (P2P 기반 Interactive VOD를 위한 레벨 그룹 스트리밍 기법)

  • Kim, Jong-Gyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.955-962
    • /
    • 2008
  • Multicast Strategy is one of the cost-saving methods in the large scale VOD environment. However, it does involve complicated problems to implement VCR-like interactions for user's convenience in the multicast streaming system under considering the limited-server and the network's bandwidth in the multicast-transmission system. Therefore, the proper solution of settling such a problem is necessary. Thus, this paper which revised P2Patching[l] proposes LGST(Level Group Streaming Technique) which supports the VCR's function through cooperation among peers with heterogeneous bandwidth under the environment of P2P. This strategy can reduce latency by improving the acceptance of server and using the bandwidth of network efficiently. And for evaluate the proposed scheme's performance, I simulated the performance of streaming delivery topology and streaming quality in comparison with P2Patching. In evaluation to service request refusal ratio and service quality according to bandwidth decrement, the result of simulation shows that proposed LGST improves about $11{\sim}18%$ of performance than P2Patching. In the test of latency recovery according to fault probability and influence of VCR function operation duration, it shows similar performance.

An Error position detection and recovery algorithm at 3×3 matrix digital circuit by mimicking a Neuron (뉴런의 기능을 모사한 3×3배열구조의 디지털 회로에서의 오류위치 확인 및 복구 알고리즘)

  • Kim, Seok-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.11
    • /
    • pp.2193-2198
    • /
    • 2016
  • In this study, we propose an algorithm to simulate the function of the coupling structure and having two neurons to find out exactly recover the temporary or permanent position errors that can occur during operation in a digital circuit was separated by function, a $3{\times}3$ array. If any particular part in the combined cells are differentiated cells have a problem that function to other cells caused an error and perform the same function are subjected to a step of apoptosis by the surrounding cells. Designed as a function block in the function and the internal structure having a cell structure of this digital circuit proposes an algorithm. In case of error of module 4 of block 1 considered in this study, sum of all module numbers for horizontal direction, total module number sum for vertical direction, and sum of all module numbers for diagonal direction, We were able to find the location.

Taking Point Decision Mechanism of Page-level Incremental Checkpointing based on Cost Analysis of Process Execution Time (프로세스 수행 시간의 비용 분석에 기반을 둔 페이지 단위 점진적 검사점의 작성 시점 결정 기법)

  • Yi Sang-Ho;Heo Jun-Young;Hong Ji-Man
    • The KIPS Transactions:PartA
    • /
    • v.13A no.4 s.101
    • /
    • pp.289-294
    • /
    • 2006
  • Checkpointing is an effective mechanism that allows a process to resume its execution that was discontinued by a system failure without having to restart from the beginning. Especially, page-level incremental checkpointing saves only the modified pages of a process to minimize the checkpointing overhead. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages. Thus, the efficient interval of checkpointing must be determined on run-time of the process. In this paper, we present an efficient and adaptive page-level incremental checkpointing facility that is based on the cost analysis of process execution time. In our simulation, results show that the proposed mechanism significantly reduced the average process execution time compared with existing fixed-interval-based page-level incremental checkpointing.

Risk Model Development for PWR During Shutdown (원자로 정지 동안의 위해도 모델 개발)

  • Yoon, Won-Hyo;Chang, Soon-Heung
    • Nuclear Engineering and Technology
    • /
    • v.21 no.1
    • /
    • pp.1-11
    • /
    • 1989
  • Numerous losses of decay heat removal capability have occurred at U during stutodwn while its significance to safety is needless to say. A study is carried out as an attempt to assess what could be done to lower the frequency of these events and to mitigate their consequences in the unlikely event that one occurs. The shutdown risk model is developed and analyzed using Event/Fault Tree for the typical pressurized water reactor. The human cognitive reliability (HCR) model, two-stage bayesian approach and staircase function model are used to estimate human reliability, initiating event frequency and offsite power non-recovery probability given loss of offsite power, respectively. The results of this study indicate that the risk of a Pm at shutdown is not much lower than the risk when the plant is operating. By examining the dominant accident sequences obtained, several design deficiencies are identified and it is found that some proposed changes lead to significant reduction in core damage frequency due to loss of cooling events.

  • PDF