Fragmentation of Numerical Algorithms for the Parallel Subroutines Library

  • Authors:
  • Victor E. Malyshkin;Sergey B. Sorokin;Ksenia G. Chajuk

  • Affiliations:
  • Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Sciences, Novosibirsk;Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Sciences, Novosibirsk;Institute of Computational Mathematics and Mathematical Geophysics, Russian Academy of Sciences, Novosibirsk

  • Venue:
  • PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.