Skip to main content

Fragmentation of Numerical Algorithms for the Parallel Subroutines Library

  • Conference paper

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

Abstract

Fragmentation of the often used numerical algorithms for inclusion into the library of parallel numerical subroutines are considered. Algorithms and programs fragmentation allow to create parallel programs that can be executed on parallel computers of different types (multiprocessors and/or multicomputers) and can be dynamically tuned to all the available resources. Programs’ fragmentation is the way of automatic providing of the dynamic properties of parallel programs, like dynamic load balancing. Algorithm’s fragmentation is a technological method of numerical algorithms parallelization which provides their effective parallel implementation.

The work was supported by the grant Rosobrazovanie, contract RNP.2.2.1.1.3653 and by the grant of the integrating program of Siberian Branch of the Russian Academy of Science IP 5.1.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glushkov, V.M., Ignatyev, M.V., Myasnikov, V.A., Torgashev, V.A.: Recursive machines and computing technologies. In: Proceedings of the IFIP Congress, vol. 1, pp. 65–70. North-Holland Publish. Co., Amsterdam (1974)

    Google Scholar 

  2. Hill, J., McColl, W., Stefanescu, D., Goudreau, M., Lang, K., Rao, S., Suel, T., Tsantilas, Th., Bisseling, R.: BSPlib: the BSP Programming Library. Parallel Computing 24, 1947–1980 (1998)

    Article  Google Scholar 

  3. Torgashev, V.A., Tsarev, I.V.: Sredstva organozatsii parallelnykh vychislenii i programmirovaniya v multiprocessorakh s dynamicheskoi architechturoi. Programmirovanie (4), 53–67 (2001)

    Google Scholar 

  4. BSPlib, http://www.bsp-worldwide.org/

  5. BLAS, http://www.netlib.org/blas/

  6. ScaLAPACK, http://www.netlib.org/scalapack/

  7. http://www.intel.com/cd/software/products/emea/rus/358876.htm

  8. Charm++, http://charm.cs.uiuc.edu/manuals/html/converse/manual.html

  9. Kraeva, M.A., Malyshkin, V.E.: Assembly Technology for Parallel Realization of Numerical Models on MIMD-Multicomputers. The Int. Journal on Future Generation Computer Systems 17(6), 755–765 (2001)

    Article  MATH  Google Scholar 

  10. Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: An Efficient Multithreaded Runtime System. ACM SIGPLAN Notices 30(8), 207–216 (1995)

    Article  Google Scholar 

  11. Foster, I., Kesselman, C., Tuecke, S.: Nexus: Runtime Support for Task-Parallel Programming Languages. Cluster Computing 1(1), 95–107 (1998)

    Article  Google Scholar 

  12. Shu, W., Kale, L.V.: Chare Kernel – a Runtime Support System for Parallel Computations. Journal of Parallel and Distributed Computing 11(3), 198–211 (1991)

    Article  Google Scholar 

  13. Chien, A.A., Karamcheti, V., Plevyak, J.: The Concert System – Compiler and Runtime Support for Efficient, Fine-Grained Concurrent Object-Oriented Programs. - UIUC DCS Tech Report R-93-1815 (1993)

    Google Scholar 

  14. Grimshaw, A.S., Weissman, J.B., Strayer, W.T.: Portable Run-Time Support for Dynamic Object-Oriented Parallel Processing. ACM Transactions on Computer Systems (TOCS) 14(2), 139–170 (1996)

    Article  Google Scholar 

  15. Benson, G.D., Olsson, R.A.: A Portable Run-Time System for the SR Concurrent Programming Language. In: Proceedings of the Workshop on Run-Time Systems for Parallel Programming (RTSPP) (April 1997)

    Google Scholar 

  16. Kalgin, K.V., Malyskin, V.E., Nechaev, S.P., Tschukin, G.A.: Runtime System for Parallel Execution of Fragmented Subroutines. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 544–552. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Valkovskii, V., Malyshkin, V.: Parallel Program Synthesis on the Basis of Computational Models. – Novosibirsk, Nauka, 129 p. (In Russian/ Sintez Parallel’nykh program ya Vychislitel’nykh modelyakh) (1988)

    Google Scholar 

  18. Faddeev, D.K., Faddeeva, V.N.: Computing methods of linear algebra. 2nd edn. Moscow, Nauka, p. 656 (In Russian/ Vychislitel’nye metody lineinoi algebry) (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malyshkin, V.E., Sorokin, S.B., Chajuk, K.G. (2009). Fragmentation of Numerical Algorithms for the Parallel Subroutines Library. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2009. Lecture Notes in Computer Science, vol 5698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03275-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03275-2_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03274-5

  • Online ISBN: 978-3-642-03275-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics