• BMB Reports
• /
• v.47 no.5
• /
• pp.249-255
• /
• 2014

Polo-like kinase-1 (Plk1) belongs to a family of serine-threonine kinases and plays a critical role in mitotic progression. Plk1 involves in the initiation of mitosis, centrosome maturation, bipolar spindle formation, and cytokinesis, well-reported as traditional functions of Plk1. In this review, we discuss the role of Plk1 during DNA damage response beyond the functions in mitotsis. When DNA is damaged in cells under various stress conditions, the checkpoint mechanism is activated to allow cells to have enough time for repair. When damage is repaired, cells progress continuously their division, which is called checkpoint recovery. If damage is too severe to repair, cells undergo apoptotic pathway. If damage is not completely repaired, cells undergo a process called checkpoint adaptation, and resume cell division cycle with damaged DNA. Plk1 targets and regulates many key factors in the process of damage response, and we deal with these subjects in this review.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.953-960
• /
• 2005

The Network can be easily damaged in the mobile computing environment. Mobile Support Station (MSS) which supports the Mobile Host(MH) could also be unstable too. Therefore, when a critical error occurs the repairing cost can be high. For stable repair, the hand-off strategy should be considered to save the continuing message and checkpoint information, and to reduce the cost of network repair. In this paper, we propose the Switching Trickle(ST) strategy which reduces the repairing cost for the MH's mobility. ST strategy changes the way which stores the information in connection with the number of write events(r) that occur from the hands-off strategy. Accumulated cost by increased mobility has been simulated too. From the results of simulation, the proposed strategy has shown more cost effective than the conventional strategy. The proposed strategy also has shown very supportive in saving checkpoint and message log information stably.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.112-121
• /
• 2007

In this paper, we propose a new checkpointing strategy for dual modular redundancy real-time systems. For every checkpoints the execution results from two processors, and the result saved in the previous checkpoint are compared to detect faults. We devised an operation algorithm in chectpoints to recover from transient faults as well as permanent faults. We also develop a Markov model for the optimization of the proposed checkpointing strategy. The probability of successful task execution within its deadline is derived from the Markov model. The optimal number of checkpoints is the checkpoints which makes the successful probability maximum.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.403-405
• /
• 2002

본 논문은 Recovery 기법 중의 하나인 Roll-Forward를 적용한 고가용 웹 서버의 설계 및 구현에 대해서 그 방안을 제시한다. Roll-Forward Recovery 는 복구에 드는 시간을 감소시킬 수 있다는 장점이 있다. 즉, 일반적인 중복 시스템에서 결함이 발생하면 시스템의 상태는 가장 최근의 checkpoint 지점으로 Rollback 되어야 하기 때문에 복구에 많은 시간을 소비하게 되지만, Roll-Forward를 적용함으로써 복구에 드는 시간을 감소시킬 수 있다. 단일 서버시스템 또는 Rollback Recovery를 적용한 시스템의 결함 발생 시 서비스를 제공할 수 없는 상태가 되거나 복구에 많은 시간을 소비한다. 이에 비해 Roll-Forward를 적용한 중복 서버시스템을 구성하여 동작 운용중인 서버의 결함 발생 시 즉시 다른 서버가 결과를 보여줌으로써 고가용 웹 서비스를 제공할 수 있다. 본 논문에서 제시하는 Roll-Forward를 적용한 고가용 웹 서버의 동작원리는 마스터서버에 들어오는 요청을 백업서버에서도 똑같이 수행하며, 마스터 서버가 동작 중 결함이 발생하였을 경우 백업서버가 피 결과를 보여줌으로써 고가용의 서비스가 제공되는 웹 서버를 구현하고자 한다.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.494-511
• /
• 2001

In the environment that database management systems manage disk spaces for storing databases directly, this paper proposes a correct and efficient scheme of performing pending actions for the removal of database files. As for performing pending actions, upon performing recovery, the recovery process must identify unperformed pending actions of not-yet-terminated transactions and then perform those actions completely. Making the recovery process identify those actions through the analysis of log records in the log file is the basic idea of this paper. This scheme, as an extension of the execution of transactions, fuzzy checkpoint, and recovery of ARIES, uses the following methods: First, to identify not-yet-terminated transactions during recovery, transactions perform pending actions after writing 'pa_start'log records that signify both the commit of transactions and the start of executing pending actions, and then write 'eng'log records. Second, to restore pending-actions-lists of not-yet-terminated transactions during recovery, each transaction records its pending-actions-list in 'pa_start'log record and the checkpoint process records pending-actions-lists of transactions that are decided to be committed in 'end_chkpt'log record. Third, to identify the next pending action to perform during recovery, whenever a page is updated during the execution of pending actions, transactions record the information that identifies the next pending action to perform in the log record that has the redo information against the page.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.607-614
• /
• 2006

The checkpointing schemes should reduce the process delay through managing the checkpoints of each node to fit the network load to enhance the performance of the process running on the cluster system that write the checkpoints into its global stable storage. For this reason, a cluster system with single IO space on a distributed RAID chooses a suitable checkpointng scheme to get the maximum IO performance and the best rollback recovery efficiency. In this paper, we improved the striped checkpointing scheme with dynamic stripe group size by adapting to the network bandwidth variation at the point of checkpointing. To analyze the performance of the multi striped checkpointing scheme, we applied Linpack HPC benchmark with MPI on our own cluster system with maximum 512 virtual nodes. The benchmark results showed that the multistriped checkpointing scheme has better performance than the striped checkpointing scheme on the checkpoint writing efficiency and rollback recovery at heavy system load.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.111-118
• /
• 2008

With the advance in mobile communication systems, the need for distributed applications running on multiple mobile devices also grows gradually. As such applications are subject to H/W failures of the mobile device or communication disruptions, compared to the traditional applications in fixed networks, it is crucial to develop any recovery mechanism suitable for them. For this, checkpointing is widely used to restart interrupted applications. In this paper, we devise an efficient checkpointing method that adopts the software agent executed at the mobile support station. The agent, called the checkpointing agent, is aimed at supporting the concept of rollback-distance (R-distance) that bounds the maximum number of roll-backed local checkpoints. By means of the R-distance, our method can prevent undesirable domino effects and heavy checkpoint overhead, while providing high flexibility in checkpoint creation.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.327-338
• /
• 1996

In this paper, we present a new checkpointing algorithm to preserve the consistency of resources in distributed transaction processing systems, and the error recovery algorithms to recover form the failure. In comparison with the existed algorithms, the checkpointing algorithm proposed in this paper can minimize the interference of the distributed transaction and the stroage cost during checkpointing, and does not need the extra message to make th checkpoint. Also we show that the error recovery algorithms prevent the distributed transaction with a partial fault from spreading the fault, which calls domnio-effect and prevent them from restarting cyclically. And we describe the correctness and the performane of the proposed algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.170-175
• /
• 2022

Reactive failure management techniques are required to mitigate the impact of errors in high performance computing. Checkpoint is the standard recovery technique for coping with errors. An application employing checkpoints periodically saves its state, so that when an error occurs while some task is executing, the application is rolled back to its last checkpointed task and resumes execution from that task onward. In this paper, assuming the time-to-errors are independent each other and generally distributed, we analyze the checkpointing model with instantaneous error detection. The conventional assumption that two or more errors do not take place between two consecutive checkpoints is removed. Given the checkpointing time, down-time, and recovery time, we derive the reliability of the checkpointing model. When the time-to-error follows an exponential distribution, we obtain the optimal checkpointing interval to achieve the maximum reliability.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.2 s.10
• /
• pp.69-82
• /
• 2003

Mobile transactions updating spatial objects are long transactions that update local objects of mobile clients during disconnection. Since a recovered transaction cannot read the write sets of other transactions committed before the recovery due to disconnection, the recovered transaction may conflicts with them. However, aborting of the recovered long transaction leads to the cancellation of all updates including the recovered updates. It is definitely unsuitable to cancel the recovered updates due to the conflicts. In this paper, we propose the recovery scheme to retrieve foreign conflictive objects from the write sets of other transactions for reducing aborting of a recovered transaction. The foreign conflictive objects are part of the data committed by other transactions and may conflict with the objects updated by the recovered transaction. In the scheme, since the recovered transaction can read both the foreign conflictive objects and the recently checkpoint read set, it is possible to reupdate properly the potentially conflicted objects.