Distributed computing systems and checkpointing

Author

Wong, Ken ; Franklin, Mark

Author_Institution

Comput. & Commun. Res. Center, Washington Univ., St. Louis, MO, USA

fYear

1993

fDate

20-23 Jul 1993

Firstpage

224

Lastpage

233

Abstract

This paper examines the performance of synchronous checkpointing in a distributed computing environment with and without load redistribution. Performance models are developed, and optimum checkpoint intervals are determined. The analysis extends earlier work by allowing for multiple nodes, state dependent checkpoint intervals, and a performance metric which is coupled with failure-free performance and the speedup functions associated with implementation of parallel algorithms. Expressions for the optimum checkpoint intervals for synchronous checkpointing with and without load redistribution are derived and the results are then used to determine when load redistribution is advantageous

Keywords

distributed processing; parallel algorithms; performance evaluation; checkpointing; distributed computing environment; failure-free performance; load redistribution; parallel algorithms; performance; performance metric; speedup functions; state dependent checkpoint intervals; Algorithm design and analysis; Checkpointing; Computer networks; Concurrent computing; Distributed computing; Failure analysis; Measurement; Parallel algorithms; Performance analysis; Resumes;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Distributed Computing, 1993., Proceedings the 2nd International Symposium on

Conference_Location

Spokane, WA

Print_ISBN

0-8186-3900-8

Type

conf

DOI

10.1109/HPDC.1993.263838

Filename

263838