Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model

  • Sumit MishraEmail author
  • Carlos A. Coello Coello


Non-dominated sorting is a crucial component of Pareto-based multi- and many-objective evolutionary algorithms. As the number of objectives increases, the execution time of a multi-objective evolutionary algorithm increases, too. Since multi-objective evolutionary algorithms normally have a low data dependency, research-ers have increasingly adopted parallel programming techniques to reduce their execution time. Evidently, it is also desirable to parallelize non-dominated sorting. There are some recent proposals which focus on the parallelization of non-dominated sorting, with a particular emphasis on a very well-known approach called fast non-dominated sorting. In this paper, however, we explore the scope of parallelism in an approach called divide-and-conquer based non-dominated sorting (DCNS), which we recently introduced. This paper explores the parallelism from a theoretical point of view. The parallelization of the DCNS approach has been explored considering the PRAM-CREW (Parallel Random Access Machine, Concurrent Read Exclusive Write) model. The analysis of parallel algorithms is usually carried out under the assumption that an unbounded number of processors are available. So, in our analysis, we have also considered the same assumption. The time and space complexities of the parallel version of the DCNS approach is obtained in different scenarios. The time complexity of the parallel version of the DCNS approach in different scenarios is proved to be \(\mathcal {O}(\log M + N)\). We have also obtained the maximum number of processors which can be required by the parallel version of the DCNS approach. The comparison of the parallel version of the DCNS approach with respect to some other approaches is also performed.


Non-dominated sorting Dominance Parallelism 



The second author gratefully acknowledges support from CONACyT Grant No. 2016-01-1920 (Investigación en Fronteras de la Ciencia 2016).


  1. Bao, C., Xu, L., Goodman, E.D., Cao, L.: A novel non-dominated sorting algorithm for evolutionary multi-objective optimization. J. Comput. Sci. 23, 31–43 (2017)MathSciNetCrossRefGoogle Scholar
  2. Buzdalov, M., Shalyto, A.: A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In: 13th International Conference on Parallel Problem Solving from Nature—PPSN XIII, Springer. Lecture Notes in Computer Science, Ljubljana, Slovenia, vol. 8672, pp. 528–537 (2014)Google Scholar
  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009). ISBN 978-0-262-03384-8Google Scholar
  4. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182–197 (2002)CrossRefGoogle Scholar
  5. Drozdik, M., Akimoto, Y., Aguirre, H., Tanaka, K.: Computational cost reduction of nondominated sorting using the M-front. IEEE Trans. Evolut. Comput. 19(5), 659–678 (2015)CrossRefGoogle Scholar
  6. Fang, H., Wang, Q., Tu, Y.C., Horstemeyer, M.F.: An efficient non-dominated sorting method for evolutionary algorithms. Evolut. Comput. 16(3), 355–384 (2008)CrossRefGoogle Scholar
  7. Fortin, F.A., Greiner, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: 2013 Genetic and Evolutionary Computation Conference (GECCO’2013), pp. 615–622. ACM Press, New York (2013). ISBN: 978-1-4503-1963-8Google Scholar
  8. Gupta, S., Tan, G.: A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on GPUs. In: 2015 IEEE Congress on Evolutionary Computation (CEC’2015), pp. 1567–1574. IEEE Press, Sendai (2005). ISBN: 978-1-4799-7492-4Google Scholar
  9. Gustavsson, P., Syberfeldt, A.: A new algorithm using the non-dominated tree to improve non-dominated sorting. Evolut. Comput. 26(1), 89–116 (2018)CrossRefGoogle Scholar
  10. JáJá, J.: An Introduction to Parallel Algorithms, vol. 17. Addison-Wesley, Reading (1992)zbMATHGoogle Scholar
  11. Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evolut. Comput. 7(5), 503–515 (2003)CrossRefGoogle Scholar
  12. Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing: Design and Analysis of Algorithms, vol. 400. Benjamin Cummings, Redwood City (1994)zbMATHGoogle Scholar
  13. Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. JACM 22(4), 469–476 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  14. McClymont, K., Keedwell, E.: Deductive sort and climbing sort: new methods for non-dominated sorting. Evolut. Comput. 20(1), 1–26 (2012)CrossRefGoogle Scholar
  15. Mikloško, J., Kotov, V.E.: Algorithms, Software and Hardware of Parallel Computers (1984). ISBN: 978-3-662-11106-2Google Scholar
  16. Mishra, S., Coello Coello, C.A.: P-ENS: parallelism in efficient non-dominated sorting. In: 2018 IEEE Congress on Evolutionary Computation (CEC’2018), pp 508–515. IEEE Press, Rio de Janeiro (2018). ISBN: 978-1-5090-6017-7Google Scholar
  17. Mishra, S., Saha, S., Mondal, S.: Divide and conquer based non-dominated sorting for parallel environment. In: 2016 IEEE Congress on Evolutionary Computation (CEC’2016), pp 4297–4304. IEEE Press, Vancouver (2016). ISBN: 978-1-5090-0623-6Google Scholar
  18. Mishra, S., Mondal, S., Saha, S., Coello Coello, C.A.: GBOS: generalized best order sort algorithm for non-dominated sorting. Swarm Evolut. Comput. 43, 244–264 (2018a). CrossRefGoogle Scholar
  19. Mishra, S., Saha, S., Mondal, S.: MBOS: modified best order sort algorithm for performing non-dominated sorting. In: 2018 IEEE Congress on Evolutionary Computation (CEC’2018), pp 725–732. IEEE Press, Rio de Janeiro (2018b). ISBN: 978-1-5090-6017-7Google Scholar
  20. Mishra, S., Saha, S., Mondal, S., Coello Coello, C.A.: A divide-and-conquer based efficient non-dominated sorting approach. Swarm Evolut. Comput. 44, 748–773 (2019). CrossRefGoogle Scholar
  21. Moreno, J., Ortega, G., Filatovas, E., Martínez, J., Garzón, E.: Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU/CPU platforms. J. Global Optim. 71(3), 631–649 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  22. Niculescu, V.: Data-distributions in powerlist theory. In: International Colloquium on Theoretical Aspects of Computing, pp. 396–409. Springer, New York (2007)Google Scholar
  23. Ning, W., Guo, B., Yan, Y., Wu, X., Wu, J., Zhao, D.: Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm. Eng. Optim. 49(10), 1645–1664 (2017)MathSciNetCrossRefGoogle Scholar
  24. Ortega, G., Filatovas, E., Garzon, E.M., Casado, L.G.: Non-dominated sorting procedure for pareto dominance ranking on multicore CPU and/or GPU. J. Global Optim. 69(3), 607–627 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  25. Palakonda, V., Pamulapati, T., Mallipeddi, R., Biswas, P.P., Veluvolu, K.C.: Nondominated sorting based on sum of objectives. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–8 (2017)Google Scholar
  26. 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, pp. 1113–1120. ACM Press, Denver, Colorado (2016). ISBN: 978-1-4503-4323-7Google Scholar
  27. Roy, P.C., Deb, K., Islam, M.M.: An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans. Cybern. (2018). Google Scholar
  28. Smutnicki, C., Rudy, J., Zelazny, D.: Very fast non-dominated sorting. Decis. Mak. Manuf. Serv. 8(1–2), 13–23 (2014)MathSciNetzbMATHGoogle Scholar
  29. Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221–248 (1994)CrossRefGoogle Scholar
  30. Tang, S., Cai, Z., Zheng, J.: A fast method of constructing the non-dominated set: Arena’s principle. In: 2008 Fourth International Conference on Natural Computation, IEEE Computer Society Press, Jinan, China, pp. 391–395 (2008). ISBN: 978-0-7695-3304-9Google Scholar
  31. Van Veldhuizen, D.A., Zydallis, J.B., Lamont, G.B.: Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans. Evolut. Comput. 7(2), 144–173 (2003)CrossRefGoogle Scholar
  32. Zhang, X., Tian, Y., Cheng, R., Yaochu, J.: An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans. Evolut. Comput. 19(2), 201–213 (2015)CrossRefGoogle Scholar
  33. Zhang, X., Tian, Y., Cheng, R., Jin, Y.: A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans. Evolut. Comput. 22(1), 97–112 (2018)CrossRefGoogle Scholar
  34. Zhou, Y., Chen, Z., Zhang, J.: Ranking vectors by means of the dominance degree matrix. IEEE Trans. Evolut. Comput. 21(1), 34–51 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Departamento de ComputaciónCINVESTAV-IPNMexico CityMexico
  2. 2.Department of Computer Science and EngineeringIndian Institute of Information Technology GuwahatiGuwahatiIndia

Personalised recommendations