loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth Pacific Rim International Symposium on Dependable Computing (PRDC'01)
Fault-Tolerance of Functional Programs Based on the Parallel Graph Reduction
Seoul, Korea
December 17-December 19
ISBN: 0-7695-1414-6
ASCII Text
x 
 
Masato Kitakami, Shunji Kubota, Hideo Ito, "Fault-Tolerance of Functional Programs Based on the Parallel Graph Reduction," Pacific Rim International Symposium on Dependable Computing, IEEE, pp. 319, Eighth Pacific Rim International Symposium on Dependable Computing (PRDC'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/PRDC.2001.992715,
author = {Masato Kitakami and Shunji Kubota and Hideo Ito},
title = {Fault-Tolerance of Functional Programs Based on the Parallel Graph Reduction},
journal ={Pacific Rim International Symposium on Dependable Computing, IEEE},
volume = {0},
year = {2001},
isbn = {0-7695-1414-6},
pages = {319},
doi = {http://doi.ieeecomputersociety.org/10.1109/PRDC.2001.992715},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pacific Rim International Symposium on Dependable Computing, IEEE
TI - Fault-Tolerance of Functional Programs Based on the Parallel Graph Reduction
SN - 0-7695-1414-6
SP
EP
A1 - Masato Kitakami,
A1 - Shunji Kubota,
A1 - Hideo Ito,
PY - 2001
KW - Fault tolerance
KW - functional programming
KW - graph reduction
KW - Referential transparency
KW - message logging
VL - 0
JA - Pacific Rim International Symposium on Dependable Computing, IEEE
ER -
 
Recently, parallel computing is popularly applied to many systems. Functional programming is suitable for parallel programming because of referential transparency and is applied to symbol processing systems and parallel database systems. Programs of some functional programming can be regarded as graph and are processed in terms of reduction of the corresponding graph. This paper proposes fault tolerance of functional programming based on graph reduction. The proposed methods stores the received graph as a message log and the erroneous task is recovered by using the checkpoint and the computer simulations say that time overhead of the proposed method is small. If checkpoint interval is 30 seconds and the number of tasks is 3, for example, time overhead is less than 10%
Index Terms:
Fault tolerance, functional programming, graph reduction, Referential transparency, message logging
Citation:
Masato Kitakami, Shunji Kubota, Hideo Ito, "Fault-Tolerance of Functional Programs Based on the Parallel Graph Reduction," prdc, pp.319, Eighth Pacific Rim International Symposium on Dependable Computing (PRDC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.