.png){kind=icon}
返回
Characterizing fault tolerance in genetic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2010.02.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Evolutionary algorithms, including genetic programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. An approach for reducing the time-to-solution is to use parallel computing on distributed platforms. Large platforms such as these are prone to failures, which can even be commonplace events rather than rare occurrences. Thus, fault tolerance and recovery techniques are typically necessary. The aim of this article is to show the inherent ability of parallel GP to tolerate failures in distributed platforms without using any fault-tolerant technique. This ability is quantified via simulation experiments performed using failure traces from real-world distributed platforms, namely, desktop grids, for two well-known problems. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Fault tolerance
Parallel genetic programming
Desktop grids
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
分享收藏Epidemiological description of 529 families referred for French transcultural psychotherapy: A decade of experience.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Validation of a method to simulate the acquisition of mammographic images with different techniques
PREAI
分享收藏Transcultural mediation programme in a paediatric hospital in France: qualitative and quantitative study of participants’ experience and impact on hospital costsBMJ OpenOAAI
BMJ OpenIF0
OAAI分享收藏Fundamentals of fault-tolerant distributed computing in asynchronous environments异步环境中容错分布式计算的基本原理OAAI
OAAI分享收藏
查看更多内容