2026-05-31T06:24:13Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/99352026-02-03T11:33:08Zcom_10630_2254col_10630_37953

Sensitivity Analysis of Checkpointing Strategies for Multimemetic Algorithms on Unstable Complex Networks Cotta-Porras, Carlos Nogueras, Rafael Computación evolutiva The use of volatile decentralized computational platforms such as, e.g., peer-to-peer networks, is becoming an increasingly popular option to gain access to vast computing resources. Making an effective use of these resources requires algorithms adapted to such a changing environment, being resilient to resource volatility. We consider the use of a variant of evolutionary algorithms endowed with a classical fault-tolerance technique, namely the creation of checkpoints in a safe external storage. We analyze the sensitivity of this approach on different kind of networks (scale-free and small-world) and under different volatility scenarios. We observe that while this strategy is robust under low volatility conditions, in cases of severe volatility performance degrades sharply unless a high checkpoint frequency is used. This suggest that other fault-tolerance strategies are required in these situations. 2015-06-17T10:55:52Z 2015-06-17T10:55:52Z 2015-06-17T10:55:52Z 2015-06-17 journal article http://hdl.handle.net/10630/9935 http://orcid.org/0000-0001-8478-7549 eng 10th International Conference on Large-Scale Scientific Computations Sozopol, Bulgaria 8-12 Junio 2015 open access by-nc-nd