Automatic Configuration of Parallel Programs for Processor Networks

Abstract

: This paper describes the mapping algorithm for distributed memory, parallel message passing systems using the objective function to evaluate the optimality of the mapping of a task graph onto a processor graph. Our optimization method is compared with other ones, some of them issuing from artificial intelligence or operations research. In our experiments randomly generated tasks and processor graphs are used. Keywords: static and dynamic mapping, multicomputer, scheduling, load balancing, smoothing. 1 Introduction Optimal planning of parallel program execution in distributed environment of a multicomputer on the basis of message passing solves the response speed. Static and dynamic mappings can be available and effective way of solution. The theory of optimal mapping comes out from the assumption that the program execution time depends upon uniform load of the processors and upon interprocessor communication minimization. In this paper, our attention is concentrated on the diffusio..