Fragmentation of numerical algorithms for parallel subroutines library

  • Authors:
  • S. Kireev;V. Malyshkin

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

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fragmentation is a well-known method of the parallelization of numerical algorithms and programs. Algorithm fragmentation allows creating fragmented 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. Fragmentation of the often used numerical algorithms, their representation for inclusion into the library of parallel numerical subroutines and properties of the runtime system are considered.