Revised Pursuit Algorithm for Solving Non-stationary Linear Programming Problems on Modern Computing Clusters with Manycore Accelerators

  • Irina Sokolinskaya
  • Leonid Sokolinsky
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 687)


This paper is devoted to the new edition of the parallel Pursuit algorithm proposed the authors in previous works. The Pursuit algorithm uses Fejer’s mappings for building pseudo-projection on polyhedron. The algorithm tracks changes in input data and corrects the calculation process. The previous edition of the algorithm assumed using a cube-shaped pursuit region with the number of K cells in one dimension. The total number of cells is \(K^n\), where n is the problem dimension. This resulted in high computational complexity of the algorithm. The new edition uses a cross-shaped pursuit region with one cross-bar per dimension. Such a region consists of only \(n(K-1)+1\) cells. The new algorithm is intended for cluster computing system with Xeon Phi processors.


Non-stationary linear programming problem Fejer’s mappings Pursuit algorithm Massive parallelism Cluster computing systems MIC architecture Intel Xeon Phi Native mode OpenMP 


  1. 1.
    Ananchenko, I.V., Musaev, A.A.: Torgovye roboty i upravlenie v khaoticheskikh sredakh: obzor i kriticheskiy analiz [Trading robots and management in chaotic environments: an overview and critical analysis]. Trudy SPIIRAN [SPIIRAS Proc.] 34(3), 178–203 (2014)Google Scholar
  2. 2.
    Dyshaev, M.M., Sokolinskaya, I.M.: Predstavlenie torgovykh signalov na osnove adaptivnoy skol’zyashchey sredney Kaufmana v vide sistemy lineynykh neravenstv [Representation of trading signals based on Kaufman’s adaptive moving average as a system of linear inequalities]. Vestnik Yuzhno-Ural’skogo gosudarstvennogo universiteta 2(4), 103–108 (2013). Seriya: Vychislitel’naya matematika i informatika [Bulletin of South Ural State University. Series: Computational Mathematics and Software Engineering]Google Scholar
  3. 3.
    Eremin, I.I.: Fejerovskie metody dlya zadach linejnoj i vypukloj optimizatsii [Fejer’s Methods for Problems of Convex and Linear Optimization], 200 p. Publishing of the South Ural State University, Chelyabinsk (2009)Google Scholar
  4. 4.
    Ershova, A.V., Sokolinskaya, I.M.: O skhodimosti masshtabiruemogo algoritma postroeniya psevdoproektsii na vypukloe zamknutoe mnozhestvo [About convergence of scalable algorithm of constructing pseudo-projection on convex closed set]. Vestnik YuUrGU. Seriya “Matematicheskoe modelirovanie i programmirovanie” [Bulletin of South Ural State University. Series: Mathematical simulation and programming], vol. 10, no. 37(254), pp. 12–21 (2011)Google Scholar
  5. 5.
    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. CEURWS (2016)Google Scholar
  6. 6.
    OpenMP Application Program Interface. Version 4.0, July 2013.
  7. 7.
    Sokolinskaya, I., Sokolinsky, L.: Solving unstable linear programming problems of high dimension on cluster computing systems. In: Proceedings of the 1st Russian Conference on Supercomputing – Supercomputing Days (RuSCDays 2015), Moscow, Russian Federation, 28–29 September 2015, CEUR Workshop Proceedings, vol. 1482, pp. 420–427. CEURWS (2015)Google Scholar
  8. 8.
    Sokolinskaya, I., Sokolinsky, L.: Implementation of parallel pursuit algorithm for solving unstable linear programming problems. In: Proceedings of the 10th Annual International Scientific Conference on Parallel Computing Technologies (PCT 2016), Arkhangelsk, Russia, 29–31 March 2016, CEUR Workshop Proceedings, vol. 1576, pp. 685–698. CEURWS (2016)Google Scholar
  9. 9.
    Supalov, A., Semin, A., Klemm, M., Dahnken, C.: Optimizing HPC Applications with Intel Cluster Tools. 269 p. Apress (2014). doi: 10.1007/978-1-4302-6497-2
  10. 10.
    Thiagarajan, S.U., Congdon, C., Naik, S., Nguyen, L.Q.: Intel Xeon Phi coprocessor developer’s quick start guide. White Paper, Intel (2013)

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.South Ural State UniversityChelyabinskRussia

Personalised recommendations