Tiling multidimensional iteration spaces for nonshared memory machines
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Integral knapsack problems: parallel algorithms and their implementations on distributed systems
ICS '95 Proceedings of the 9th international conference on Supercomputing
Optimal orthogonal tiling of 2-D iterations
Journal of Parallel and Distributed Computing
A Skeleton for Parallel Dynamic Programming
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
The Tuning Problem on Pipelines
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Adaptive Execution of Pipelines
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
| Hi-index | 0.00 |
The optimal assignment of computations to processors is a crucial factor determining the effectiveness of a parallel algorithm. We analyze the problem of finding the optimal mapping of a pipeline algorithm on a ring of processors. There are too many variables to consider, the number of virtual processes to be simulated by a physical processor and the size of the packets to be communicated. We provide an analytical model for an optimal approach to these elements. The low errors observed and the simplicity of our proposal makes this mechanism suitable for its introduction in a parallel tool that compute the parameters automatically at running time.