• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1122-1129
• /
• 2007

For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.29-43
• /
• 2004

As the development of an information technique, gradually, mobile device is going to be miniaturized and operates at high speed. By such the requirements, the devices using a flash memory as a storage media are increasing. The flash memory consumes low power, is a small size, and has a fast access time like the main memory. But the flash memory must erase for recording and the erase cycle is limited. JFFS is a representative filesystem which reflects the characteristics of the flash memory. JFFS to be consisted of LSF structure, writes new data to the flash memory in sequential, which is not related to a file size. Mounting a filesystem or an error recovery is achieved through the sequential approach. Therefore, the mounting delay time is happened according to the file system size. This paper proposes a MJFFS to use a multi-checkpoint information to manage a mass flash file system efficiently. A MJFFS, which improves JFFS, divides a flash memory into the block for suitable to the block device, and stores file information of a checkpoint structure at fixed interval. Therefore mounting and error recovery processing reduce efficiently a number of filesystem access by collecting a smaller checkpoint information than capacity of actual files. A MJFFS will be suitable to a mobile device owing to accomplish fast mounting and error recovery using advantage of log foundation filesystem and overcoming defect of JFFS.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.313-318
• /
• 2004

In this paper, we suggest a checkpoint and recovery facility for the fault-tolerable process which is expected to be executed for a long time. The basic concept of the suggested facility is to allow the process to be executed continuously, when the process was stopped due to a System fault, by storing the execution status of the process periodically and recovering the execution status prior to the fault was occurred. In the suggested facility, it does not need to modify the source code for the fault-tolerable process. It was designed for the user to specify directly the file name and the checkpoint frequency, and two system calls(save, recover) were added. finally, it was implemented on the Linux environment(kernel 2.4.18) for checking the feasibility.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.26-29
• /
• 2012

Recently, to efficiently support the real-time requirements of RTLS( Real Time Location System) services, interest in the main memory DBMS is rising. In the main memory DBMS, because all data can be lost when the system failure happens, the recovery method is very important for the stability of the database. Especially, disk I/O in executing the log and the checkpoint becomes the bottleneck of letting down the total system performance. Therefore, it is urgently necessary to research about the recovery method to reduce disk I/O in the main memory DBMS. Therefore, In this paper, we analyzed existing log techniques and check point techniques and existing main memory DBMSs' recovery techniques for recovery techniques research for main memory DBMS.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.77-84
• /
• 2003

A mobile agent is a program which represents a user in a network and is capable of migrating from one node to another node, performing computations on behalf of the user. In this paper, we suggest a scheme that can safely recover mobile agent using the checkpoint that is saved at the platform that it visited previously and restart its execution from the abnormal termination point of the mobile agent. For security, mobile agent uses its public key to encrypt the checkpoint and the home platform uses the private key of the mobile agent to decrypt the encrypted checkpoints at the recovery stage. When home platform receives the checkpoint of the mobile agent, home platform verifies the checkpoint using message digest. Home platform verifies the correctness of the checkpoint by comparing the message digest generated at checkpoint mention time with the message digest generated at mobile agent recovery time.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.875-880
• /
• 2008

In this paper, a novel method to determine the optimal checkpoint interval for real-time control task is proposed considering its performance degradation according to tasks's execution time. The control task in this paper has a specific sampling period shorter than its deadline. Control performance is degraded as the control task execution time is prolonged across the sampling period and eventually zero when reached to the deadline. A new performance index is defined to represent the performance variation due to the extension of task execution time accompanying rollback fault recovery. The procedure to find the optimal checkpoint interval is addressed and several simulation examples are presented.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.1-14
• /
• 2006

Recently, to efficiently support the real-time requirements of LBS and Telematics services, interest in the spatial main memory DBMS is rising. In the spatial main memory DBMS, because all spatial data can be lost when the system failure happens, the recovery system is very important for the stability of the database. Especially, disk I/O in executing the log and the checkpoint becomes the bottleneck of letting down the total system performance. Therefore, it is urgently necessary to research about the recovery system to reduce disk I/O in the spatial main memory DBMS. In this paper, we study an efficient recovery system for the spatial main memory DBMS. First, the pre-commit log method is used for the decrement of disk I/O and the improvement of transaction concurrency. In addition, we propose the fuzzy-shadow checkpoint method for the recovery system of the spatial main memory DBMS. This method can solve the problem of duplicated disk I/O on the same page of the existing fuzzy-pingpong checkpoint method for the improvement of the whole system performance. Finally, we also report the experimental results confirming the benefit of the proposed recovery system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.216-224
• /
• 1999

In the paper we propose two recovery methods by adopting a rollback and/or roll-forward technique (S) to recover TMR failures in a TMR (structured ) system that is the simplest spatial redundancy. This technique is apparently effective to recovering TMR failures primarily caused by transient faults. The proposed policies carry out few reconfigurations at the cost of (minimal) time-overhead needed for those time-redundant schemes. The optimal checkpoint-interval vectors are derived for both methods through the likelihoods of all (possible) states of the system as well as the total execution-time. Consequently the effectiveness of our proposed policies is validated through certain numerical examples and simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.13-23
• /
• 2002

A mobile host is prone to failure due to lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life on the wireless network. Many researchers have studied to overcome these problems. For high level Availability in the cellular networks, it is necessary to consider recovery from the failures of mobile support stations as well as mobile as mobile hosts. In this paper, we present modified trickle scheme for recovery from failures of Mobile Support Station based on checkpointing scheme and analyze and compare the performance. We propose and analyze the performance of two schemes : one is waiting recovery scheme for the mobile support station having the last checkpoint and the other is searching the new path to the another mobile support station having the checkpoint.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.8
• /
• pp.748-754
• /
• 2004

In this paper, we propose the Triple Modular Redundancy (TMR) control system equipped with a checkpoint strategy. In this system, faults in a single processor are masked and faults in two or more processors are detected at each checkpoint time. When faults are detected, the rollback recovery is activated to recover from faults. The conventional TMR control system cannot overcome faults in two or more processors. The proposed system can effectively cope with correlated and independent faults in two or more processors. We develop a reliability model for this TMR control system under correlated and independent transient faults, and derive the reliability equation. Then we investigate the number of checkpoints that maximizes the reliability.