Scalability Evaluation of Cimmino Algorithm for Solving Linear Inequality Systems on Multiprocessors with Distributed Memory

Leonid B. Sokolinsky; Irina M. Sokolinskaya

doi:10.14529/jsfi180202

Authors

Leonid B. Sokolinsky South Ural State University
Irina M. Sokolinskaya South Ural State University

DOI:

https://doi.org/10.14529/jsfi180202

Abstract

The paper is devoted to a scalability study of Cimmino algorithm for linear inequality systems. This algorithm belongs to the class of iterative projection algorithms. For the analytical analysis of the scalability, the BSF (Bulk Synchronous Farm) parallel computation model is used. An implementation of the Cimmino algorithm in the form of operations on lists using higher-order functions Map and Reduce is presented. An analytical estimation of the scalability boundary of the algorithm for cluster computing systems is derived. An information about the implementation of Cimmino algorithm on lists in C++ language using the BSF program skeleton and MPI parallel programming library is given. The results of large-scale computational experiments performed on a cluster computing system are demonstrated. A conclusion about the adequacy of the analytical estimations by comparing them with the results of computational experiments is made.

References

Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Society for Industrial and Applied Mathematics (2009)

Sokolinskaya, I., Sokolinsky, L.B.: On the Solution of Linear Programming Problems in the Age of Big Data. In: Parallel Computational Technologies, PCT 2017. Communications in Computer and Information Science, vol. 753, pp. 86–100. Springer, Cham (2017), DOI: 10.1007/978-3-319-67035-5_7

Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On Diagonally Relaxed Orthogonal Projection Methods. SIAM Journal on Scientific Computing 30, 473–504 (2008), DOI: 10.1137/050639399

Zhu, J., Li, X.: The Block Diagonally-Relaxed Orthogonal Projection Algorithm for Compressed Sensing Based Tomography. In: 2011 Symposium on Photonics and Optoelectronics, SOPO. pp. 1–4. IEEE (2011), DOI: 10.1109/SOPO.2011.5780660

Censor, Y.: Mathematical optimization for the inverse problem of intensity-modulated radiation therapy. In: Palta, J.R., Mackie, T.R. (eds.) Intensity-Modulated Radiation Therapy: The State of the Art. pp. 25–49. Medical Physics Publishing, Madison, WI (2003)

Agmon, S.: The relaxation method for linear inequalities. The Canadian Journal of Mathematics 6, 382–392 (1954), DOI: 10.4153/CJM-1954-037-2

Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. The Canadian Journal of Mathematics 6, 393–404 (1954), DOI: 10.4153/CJM-1954-038-x

Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ric. Sci. XVI, Ser. II, Anno IX, 1. 326–333 (1938)

Benzi, M.: Gianfranco Cimmino’s Contributions to Numerical Mathematics. In: Atti del SemiSeminario di Analisi Matematica, Dipartimento di Matematica dell’Universit´a di Bologna (Ciclo di Conferenze in Ricordo di Gianfranco Cimmino, 2004). pp. 87–109. Tecnoprint, Bologna, Italy (2005)

Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, New York (1997)

Censor, Y., Elfving, T.: New methods for linear inequalities. Linear Algebra Appl. 42, 199–211 (1982), DOI: 10.1016/0024-3795(82)90149-5

Censor, Y.: Sequential and parallel projection algorithms for feasibility and optimization. In: Censor, Y., Ding, M. (eds.) Proc. SPIE 4553, 25 Sept. 2001. Visualization and Optimization Techniques, pp. 1–9. International Society for Optics and Photonics (2001), DOI: 10.1117/12.441550

Kelley, C.T.: Iterative Methods for Linear and Nonlinear Equations. Society for Industrial and Applied Mathematics, Philadelphia (1995)

Bilardi, G., Pietracaprina, A.: Models of Computation, Theoretical. In: Encyclopedia of Parallel Computing. pp. 1150–1158. Springer US, Boston, MA (2011), DOI: 10.1007/978-0-387-09766-4

JaJa, J.F.: PRAM (Parallel Random Access Machines). In: Encyclopedia of Parallel Computing. pp. 1608–1615. Springer US, Boston, MA (2011), DOI: 10.1007/978-0-387-09766-4_23

Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33, 103–111 (1990), DOI: 10.1145/79173.79181

Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: towards a realistic model of parallel computation. In: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, PPOPP’93. pp. 1–12. ACM Press, New York, New York, USA (1993), DOI: 10.1145/155332.155333

Forsell, M., Leppanen, V.: An extended PRAM-NUMA model of computation for TCF programming. In: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012. pp. 786–793. IEEE Computer Society, Washington, DC, USA (2012), DOI: 10.1109/IPDPSW.2012.97

Gerbessiotis, A.V.: Extending the BSP model for multi-core and out-of-core computing: MBSP. Parallel Computing 41, 90–102 (2015), DOI: 10.1016/j.parco.2014.12.002

Lu, F., Song, J., Pang, Y.: HLognGP: A parallel computation model for GPU clusters. Concurrency and Computation Practice and Experience 27, 4880–4896 (2015), DOI: 10.1002/cpe.3475

Sokolinsky, L.B.: Analytical Estimation of the Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors. Lobachevskii Journal of Mathematics 39, 571–575 (2018), DOI: 10.1134/S1995080218040121

Sokolinskaya, I., Sokolinsky, L.B.: Scalability Evaluation of NSLP Algorithm for Solving Non-Stationary Linear Programming Problems on Cluster Computing Systems. In: Supercomputing, RuSCDays 2017. Communications in Computer and Information Science, vol. 793, pp. 40–53. Springer, Cham (2017). DOI: 10.1007/978-3-319-71255-0_4

Cole, M.I.: Parallel programming with list homomorphisms. Parallel Processing Letters 05, 191–203 (1995), DOI: 10.1142/S0129626495000175

Sokolinskaya, I., Sokolinsky, L.: Revised Pursuit Algorithm for Solving Non-stationary Linear Programming Problems on Modern Computing Clusters with Manycore Accelerators. In: Supercomputing, RuSCDays 2016. Communications in Computer and Information Science, vol. 687, pp. 212–223. Springer, Cham (2016), DOI: 10.1007/978-3-319-55669-7_17

Kostenetskiy, P.S., Safonov, A.Y.: SUSU Supercomputer Resources. In: Proceedings of the 10th Annual International Scientific Conference on Parallel Computing Technologies, PCT 2016. CEUR Workshop Proceedings, vol. 1576, pp. 561–573 (2016)