Algorithms of collective operations for distributed arrays in partitioned global address space

This paper represents the heuristic algorithms for optimizing communications in parallel PGAS-programs and minimizes of its execution time. This is achieved by taking into account of hierarchical structure of computer systems while reduction. Developed algorithms are implemented for PGAS-language Cray Chapel.