A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Modern CPUs are complex with hierarchical cache memory levels, vector instruction sets, instruction level parallelism and multiple processor cores. Hence, extracting the maximum performance for a given algorithm is a complex task and can require the optimisation of a number of parameters. This paper will demonstrate the use of an evolutionary approach to tune a matrix multiplication algorithm in terms of both execution speed and also cache memory usage. Moreover, it will be shown that these objectives conflict to some degree. Hence, a multi-objective evolutionary tuning approach is demonstrated that optimises for both of these objectives establishing a Pareto front of solutions.