Strong definitions of performance metrics

As in many research works of parallel genetic algorithms (PGAs), claims of a super-linear speedup (super-linearity) have become so regular that some clarification is usually needed. This paper focuses on the estimation of computation characteristics from parallel computing. PGAs are stochastic based algorithms, so the application rules from parallel computing is not straightforward. We derive total (parallel) run times from population sizing, the estimation of selection intensity and convergence time. The flawless calculation of total run is essential for obtaining the characteristics such as speedup S(.) and others. However, although the process of derivation such characteristics is not simple, it is possible, as it is presented in the paper.