Skip to main content

Advertisement

SpringerLink
Log in

Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Non-Dominated Sorting (NDS) is the most time-consuming procedure used in the majority of evolutionary multiobjective optimization algorithms that are based on Pareto dominance ranking without regard to the computation time of the objective functions. It can be accelerated by the exploitation of its parallelism on High Performance Computing systems, that provide heterogeneous processing units, such as multicore processors and GPUs. The optimization of energy efficiency of such systems is a challenge in scientific computation since it depends on the kind of processing which is performed. Our interest is to solve NDS in an efficient way concerning both runtime and energy consumption. In literature, performance improvement has been extensively studied. Recently, a sequential Best Order Sort (BOS) algorithm for NDS has been introduced as one of the most efficient one in terms of practical performance. This work is focused on the acceleration of the NDS on modern architectures. Two efficient parallel NDS algorithms based on Best Order Sort, are introduced, MC-BOS and GPU-BOS. Both algorithms start with the fast sorting of population by objectives. MC-BOS computes in parallel the analysis of the population by objectives on the multicore processors. GPU-BOS is based on the principles of Best Order Sort, with a new scheme designed to harness the massive parallelism provided by GPUs. A wide experimental study of both algorithms on several kinds of CPU and GPU platforms has been carried out. Runtime and energy consumption are analysed to identify the best platform/algorithm of the parallel NDS for every particular population size. The analysis of obtained results defines criteria to help the user when selecting the optimal parallel version/platform for particular dimensions of NDS. The experimental results show that the new parallel NDS algorithms overcome the sequential Best Order Sort in terms of the performance and energy efficiency in relevant factors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. https://github.com/Proteek/Best-Order-Sort.

  2. https://computing.llnl.gov/tutorials/pthreads/.

  3. https://linux.die.net/man/3/qsort_r.

  4. https://nvlabs.github.io/cub/structcub_1_1_device_radix_sort.html.

  5. https://github.com/Proteek/Best-Order-Sort.

  6. https://developer.nvidia.com/nvidia-management-library-nvml.

  7. https://github.com/juanjonrg/nds.

References

  1. Brodtkorb, A.R., Hagen, T.R., Sætra, M.L.: Graphics processing unit (GPU) programming strategies and trends in GPU computing. J. Parallel Distrib. Comput. 73(1), 4–13 (2013)

    Article  Google Scholar 

  2. Buzdalov, M., Shalyto, A.: A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In: International Conference on Parallel Problem Solving from Nature, pp. 528–537. Springer, Berlin (2014)

  3. David, H., Gorbatov, E., Hanebutte, U.R., Khanna, R., Le, C.: Rapl: memory power estimation and capping. In: 2010 ACM/IEEE International Symposium on Low-Power Electronics and Design (ISLPED), pp. 189–194 (2010). https://doi.org/10.1145/1840845.1840883

  4. Deb, K., Jain, H.: An improved NSGA-II procedure for many-objective optimization, Part I: Solving problems with box constraints. KanGAL Report (2012009) (2012)

  5. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  6. Deb, K., Sundar, J., Udaya Bhaskara Rao, N., Chaudhuri, S.: Reference point based multi-objective optimization using evolutionary algorithms. Int. J. Comput. Intell. Res. 2(3), 273–286 (2006)

    Article  MathSciNet  Google Scholar 

  7. Deb, K., Tiwari, S.: Omni-optimizer: a procedure for single and multi-objective optimization. In: Evolutionary Multi-Criterion Optimization, pp. 47–61. Springer, Berlin (2005)

  8. Filatovas, E., Kurasova, O., Sindhya, K.: Reference point based multi-objective optimization using evolutionary algorithms. Informatica 26(1), 33–50 (2015)

    Article  Google Scholar 

  9. Fortin, F.A., Grenier, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO ’13, pp. 615–622. ACM, New York, NY, USA (2013). https://doi.org/10.1145/2463372.2463454

  10. Gupta, S., Tan, G.: A scalable parallel implementation of Evolutionary Algorithms for Multi-Objective optimization on GPUs. In: CEC, pp. 1567–1574. IEEE (2015)

  11. Gustavsson, P., Syberfeldt, A.: A new algorithm using the non-dominated tree to improve non-dominated sorting. Comput. Evol. (2017). https://doi.org/10.1162/EVCO_a_00204

  12. Harris, M.: Maxwell: the most advanced CUDA GPU ever made (2014). https://devblogs.nvidia.com/parallelforall/maxwell-most-advanced-cuda-gpu-ever-made/

  13. Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477–506 (2006)

    Article  MATH  Google Scholar 

  14. Ishibuchi, H., Sakane, Y., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations. In: IEE SMC, pp. 1758–1763. IEEE (2009)

  15. Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503–515 (2003)

    Article  Google Scholar 

  16. Knowles, J.D., Corne, D.W.: Approximating the non-dominated front using the Pareto archived evolution strategy. Evol. Comput. 8(2), 149–172 (2000)

    Article  Google Scholar 

  17. Markina, M., Buzdalov, M.: Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort 2017). CoRR arxiv:1704.04205

  18. Miettinen, K.: Nonlinear Multiobjective Optimization. Springer KK, Tokyo (1999)

    MATH  Google Scholar 

  19. Moreno, J.J., Ortega, G., Filatovas, E., Martínez, J.A., Garzón, E.M.: Using low-power platforms for evolutionary multi-objective optimization algorithms. J. Supercomput. 73(1), 302–315 (2017)

    Article  Google Scholar 

  20. NVIDIA: NVIDIA’s next generation CUDA compute architecture: Kepler GK110 (2012). https://www.nvidia.com/content/PDF/kepler/NVIDIA-Kepler-GK110-Architecture-Whitepaper.pdf

  21. Ortega, G., Filatovas, E., Garzón, E.M., Casado, L.G.: Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU. J. Glob. Optim. 69(3), 607–627 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ponsich, A., Jaimes, A.L., Coello, C.A.C.: A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans. Evol. Comput. 17(3), 321–344 (2013)

    Article  Google Scholar 

  23. Roy, P.C., Islam, M.M., Deb, K.: Best order sort: A new algorithm to non-dominated sorting for evolutionary multi-objective optimization. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, GECCO ’16 Companion, pp. 1113–1120. ACM, New York, NY, USA (2016). https://doi.org/10.1145/2908961.2931684

  24. Roy, P.C., Islam, M.M., Murase, K., Yao, X.: Evolutionary path control strategy for solving many-objective optimization problem. IEEE Trans. Cybern. 45(4), 702–715 (2015)

    Article  Google Scholar 

  25. Smutnicki, C., Rudy, J., Żelazny, D.: Very fast non-dominated sorting. Decis. Mak. Manuf. Serv. 8(1–2), 13–23 (2014)

    MathSciNet  MATH  Google Scholar 

  26. Srinivas, N., Deb, K.: Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221–248 (1994). https://doi.org/10.1162/evco.1994.2.3.221

    Article  Google Scholar 

  27. Tang, S., Cai, Z., Zheng, J.: A fast method of constructing the non-dominated set: Arena’s principle. ICNC 1, 391–395 (2008)

    Google Scholar 

  28. Wong, M.L.: Parallel multi-objective evolutionary algorithms on graphics processing units. In: GECCO, pp. 2515–2522. ACM (2009)

  29. Zhang, X., Ye, T., Cheng, R., Jin, Y.: An efficient approach to non-dominated sorting for evolutionary multi-objective optimization. IEEE Trans. Evol. Comput. 19(2), 201–213 (2012)

    Article  Google Scholar 

  30. Zheng, J., Ling, C.X., Shi, Z., Xie, Y.: Some discussions about mogas: Individual relations, non-dominated set, and application on automatic negotiation. In: CEC, vol. 1, pp. 706–712. IEEE (2004)

  31. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland (2001)

Download references

Author information

Authors and Affiliations

  1. Informatics Department, Agrifood Campus of International Excellence (ceiA3), University of Almería, Ctra. Sacramento s/n. La Cañada de San Urbano, 04120, Almería, Spain

    J. J. Moreno, G. Ortega, J. A. Martínez & E. M. Garzón

  2. Institute of Data Science and Digital Technologies, Vilnius University, Akademijos str. 4, Vilnius, Lithuania

    E. Filatovas

Authors
  1. J. J. Moreno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Ortega
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Filatovas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. A. Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. E. M. Garzón
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. J. Moreno.

Additional information

This work has been partially supported by the Spanish Ministry of Science throughout Project TIN2015-66680, by J. Andalucía through Projects P12-TIC-301 and P11-TIC7176, and by the European Regional Development Fund (ERDF). This research has been partially funded by a Grant (No. P-MIP-17-60) from the Research Council of Lithuania.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Moreno, J.J., Ortega, G., Filatovas, E. et al. Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms. J Glob Optim 71, 631–649 (2018). https://doi.org/10.1007/s10898-018-0669-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-018-0669-3

Keywords

Search

Navigation