Performance Relevant Issues for Parallel Computation Models

摘要

It is argued that the most important property of a suitable model of parallel computation is that it correctly predicts which algorithms is the most efficient in practice, and it is shown that models that do not reward block transfers do not always fulfill this requirement. We also discuss if the algorithm developer should have to specify the order in which messages are sent, and how these issues are dealt with differently in two BSP libraries.