Abstract <p>This paper proposes practical methods for improving performance when using an evolutionary algorithm in a volunteer computing environment. The analysis showed that the low stability of some nodes leads to a delay in the creation of a new generation. The paper will propose a way to overcome this problem by maintaining a stable resource.The problem of the inability to pre-estimate task durations is also discussed and methods for overcoming it are proposed.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Experience of Applying Volunteer Computing to Solve Scientific Problems Using an Evolutionary Algorithm

  • N. P. Khrapov,
  • A. R. Oganov,
  • M. G. Kostenko

摘要

Abstract

This paper proposes practical methods for improving performance when using an evolutionary algorithm in a volunteer computing environment. The analysis showed that the low stability of some nodes leads to a delay in the creation of a new generation. The paper will propose a way to overcome this problem by maintaining a stable resource.The problem of the inability to pre-estimate task durations is also discussed and methods for overcoming it are proposed.