specific reason(s) why ga with UseParallel=true is faster than expected

2 次查看（过去 30 天）

Herbert Triceratops 2021-12-1

1
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1600579-specific-reason-s-why-ga-with-useparallel-true-is-faster-than-expected

评论： Herbert Triceratops 2021-12-1

If the fitness function requires T time to execute once, the population size is P, and the number of workers is W, then a very rough/naive estimate for the time that ga requires to process one generation is T*P/W.

However, in circumstances where the per-worker overhead is minimal, the time per generation is slightly lower than the naive estimate, despite the fact that the naive estimate doesn't even include costs like selection, mutation, crossover, etc.

What is the specific, mechanical reason for this? I can make conjectures, but a real answer is better.

Possibly related to this is the curious fact that there is a very large gap of time between when ga is executed and when the fitness function is executed for the first time. Are the two questions related because MATLAB doing some kind of JIT compilation of the fitness function?

Thanks!

2 个评论
显示无隐藏无

Matt J 2021-12-1

My guess would be that the execution time of your fitness function is not the same for all population members. Your estimate of T is higher than the average execution time, in other words.

Herbert Triceratops 2021-12-1

That's a reasonable guess, but the fitness function that I am using to understand this phenomenon better is actually doing totally pseudorandom work of a constant size. Also, I am calculating T by averaging over many executions of the fitness function, and the inequality that I mention is true for 100% of the generations that I perform. So, ultimately, I don't believe what I am observing is due to luck.

请先登录，再进行评论。

请先登录，再回答此问题。