Optimization of tiling for mapping of algorithms onto distributed memory supercomputers strategy

A problem of tiling optimization for mapping of algorithms onto distributed memory parallel architectures is investigated. An approach of tiling optimization in LSGP mapping strategy is developed. The approach takes into account technical characteristics of computational environment: quantity of processors, processor performance, latency and bandwidth of communication channels. The method is intended for algorithms with uniform dependences.