Abstract
The portability of parallel programs has involved lot of effort during the last decade. PVM and MPI have greatly contributed to solve this drawback and nowadays most parallel programs are portable. However, the portability of the efficiency suffers, in many cases, from inherent effects of the target architectures. The optimal mapping of a parallel program is strongly dependent on the granularity and network architecture. We broach the problem of finding the optimal mapping of pipeline MPI programs. We propose an analytical model that allows an easy estimation of the parameters needed to obtain the mapping. The model is capable to be introduced into tools to produce this mapping automatically. Both the accuracy of the model and the optimal efficiency of the algorithm found are contrasted on a pipeline algorithm for the Path Planning Problem.KeywordsParallel AlgorithmOptimal MappingParallel ProgramContext SwitchPath Planning ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call