This paper introduces and compares three parallel algorithms to compute general geometric image transformations on MIMD machines. We propose three variants of a parallel general scheme. We focus on the load balancing and the data redistributions. Experimental results are reported and compared. The implementation has been done using PPCM library allowing us to run the program over different parallel machines. We compare logical communication schemes for message-passing machines. Since our parallel algorithm needs global communications such as multiscatters, we study the efficiency of two different logical topologies usable with PPCM. These studies allow us to find the best combination of algorithm and virtual topology to use on a given parallel machine.
No takes yet. Share an insight, caveat, or question.
Contassot‐Vivier et al. (1999) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: