Name
Abstract | ||
|---|---|---|
Recently, parallel computing has been 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 with some functional programming can be regarded as graphs and are processed in terms of reduction of the corresponding graph. The paper proposes fault tolerance of functional programming based on graph reduction. The proposed method stores the received graph as a message log and an erroneous task is recovered by using the checkpoint and the stored graph. Computer simulations reveal that the time overhead of the proposed method is small. If the checkpoint interval is 30 seconds and the number of tasks is 3, for example, the time overhead is less than 10% |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/PRDC.2001.992715 | Seoul |
Keywords | Field | DocType |
parallel graph reduction,checkpoint intervalis,parallel database system,functional programming,regardedas graph,parallel computing,thereceived graph,graph reduction,functional programs,suitablefor parallel programming,corresponding graph,time overhead,educational technology,fault tolerance,computer simulation,parallel computer,fault tolerant,referential transparency,very large scale integration,graph theory,parallel processing,software fault tolerance,parallel programming | Graph theory,Graph database,Functional programming,Parallel database,Computer science,Parallel computing,Software fault tolerance,Theoretical computer science,Wait-for graph,Graph bandwidth,Graph reduction,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-1414-6 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masato Kitakami | 1 | 25 | 12.29 |
| Shunji Kubota | 2 | 0 | 0.34 |
| Hideo Ito | 3 | 22 | 7.95 |