Skip to main content
SpringerLink
Log in

The Algorithm of Control Program Generation for Optimization of LuNA Program Execution

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10421))

Included in the following conference series:

  • 1088 Accesses

Abstract

LuNA fragmented programming system is a high-level declarative system of parallel programming. Such systems have the problem of achieving on appropriate program execution performance in comparison with MPI. The reasons are a high degree of parallel program execution non-determinism and execution overhead. The paper presents an algorithm of control program generation for LuNA programs. That is a step towards automatic improvement of LuNA program execution performance. Performance tests presented show effectiveness of the proposed approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Malyshkin, V.E., Perepelkin, V.A.: LuNA fragmented programming system, main functions and peculiarities of run-time subsystem. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 53–61. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23178-0_5

    Chapter  Google Scholar 

  2. Kraeva, M.A., Malyshkin, V.E.: Assembly technology for parallel realization of numerical models on MIMD-multicomputers. J. Future Gener. Comput. Syst. 17(6), 755–765 (2001)

    Article  MATH  Google Scholar 

  3. Kireev, S.E., Malyshkin, V.E.: Fragmentation of numerical algorithms for parallel subroutines library. J. Supercomput. 57(2), 161–171 (2011)

    Article  Google Scholar 

  4. Akhmed-Zaki, D.Z., Lebedev, D.V., Perepelkin, V.A.: Implementation of a three dimensional three-phase fluid flow (oilwatergas) numerical model in LuNA fragmented programming system. J. Supercomput. 73(2), 624–630 (2017)

    Article  Google Scholar 

  5. Bosilca, G., Bouteiller, A., et al.: DAGuE: a generic distributed DAG engine for high performance computing. In Proceedings of IPDPS 2011 Workshops, pp. 1151–1158 (2011)

    Google Scholar 

  6. Bosilca, G., Bouteiller, A., et al.: Flexible development of dense linear algebra algorithms on massively parallel architectures with DPLASMA. In: Proceedings of IPDPS 2011 Workshops, pp. 1432–1441 (2011)

    Google Scholar 

  7. Perez, J.M., Badia, R.M., Labarta, J.: A flexible and portable programming model for SMP and multi-cores. Technical report 03/2007, Barcelona Supercomputing Center (2007)

    Google Scholar 

  8. Kale, L.V., Krishnan, S.: CHARM++: a portable concurrent object oriented system based on C++. In: Proceedings of OOPSLA 1993, pp. 91–108. ACM, New York (1993)

    Google Scholar 

  9. Huang, C., Laxmikant, V.K.: Charisma: orchestrating migratable parallel objects. In: Proceedings of the 16th International Symposium on High Performance Distributed Computing (HPDC), pp. 75–84 (2007)

    Google Scholar 

  10. Coutts, D., Loeh, A.: Deterministic parallel programming with Haskell. Comput. Sci. Eng. 14(6), 36–43 (2012)

    Article  Google Scholar 

  11. Loogen, R., Ortega-Malln, Y., Pea-Mar, R.: Parallel functional programming in Eden. J. Funct. Program. 15(3), 431–475 (2005)

    Article  MATH  Google Scholar 

  12. Malyshkin, V.E., Perepelkin, V.A., Tkacheva, A.A.: Control flow usage to improve performance of fragmented programs execution. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 86–90. Springer, Cham (2015). doi:10.1007/978-3-319-21909-7_9

    Chapter  Google Scholar 

  13. Malyshkin, V.E., Perepelkin, V.A., Schukin, G.A.: Scalable distributed data allocation in LuNA fragmented programming system. J. Supercomput. 73(2), 726–732 (2017)

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank his supervisor Dr. Victor E. Malyshkin for his professional guidance and Vladislav A. Perepelkin for his constructive suggestions during the development of this research work.

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia

    Anastasia A. Tkacheva

  2. Novosibirsk State University, Novosibirsk, Russia

    Anastasia A. Tkacheva

Authors
  1. Anastasia A. Tkacheva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anastasia A. Tkacheva .

Editor information

Editors and Affiliations

  1. Russian Academy of Sciences, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tkacheva, A.A. (2017). The Algorithm of Control Program Generation for Optimization of LuNA Program Execution. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2017. Lecture Notes in Computer Science(), vol 10421. Springer, Cham. https://doi.org/10.1007/978-3-319-62932-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62932-2_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62931-5

  • Online ISBN: 978-3-319-62932-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation