Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/798
Title: Checkpoint placement algorithms for mobile agent system
Authors: Yang, J
Cao, J 
Wu, W
Keywords: Algorithms
Computer systems
Input output programs
Markov processes
Mobile agents
Issue Date: 2006
Publisher: IEEE Computer Society
Source: GCC2006 : fifth International Conference on Grid and Cooperative Computing : 21-23 October 2006, Hunan, China, p. 339-346 How to cite?
Abstract: Checkpointing is a fault tolerance technique widely used in various types of computer systems. In checkpointing, an important issue is how to achieve a good trade-off between the recovery cost and the system performance. Excessive checkpointing would result in the performance degradation due to the high costly I/O operations during checkpointing. Equidistant and equicost are two well-known checkpointing strategies for addressing this issue. However, there is no study on these strategies catering for a mobile agent (MA) system, which has different characteristics with conventional systems. In this paper, based on an analysis of the behaviours of an MA system, we find that it can be modelled as a homogeneous discrete-parameter Markov chain, which is different from the models used in conventional systems. Therefore, the analytic methods and corresponding results for conventional systems cannot be adopted directly for an MA system. Based on our proposed model, we study the equidistant and equicost checkpointing strategies and propose checkpoint placement algorithms for MA systems. Through simulations we evaluate the performance of our proposed algorithms and the result shows that the equicost strategy based algorithm is most suitable for an MA system.
URI: http://hdl.handle.net/10397/798
ISBN: 0-7695-2694-2
Rights: © 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Appears in Collections:Conference Paper

Files in This Item:
File Description SizeFormat 
placement-algorithms_06.pdf262.14 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

310
Last Week
2
Last month
Checked on Aug 20, 2017

Download(s)

768
Checked on Aug 20, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.