Performance analysis of algorithms on a message passing multiprocess

The paper discusses a model for analysing the performance of algorithms executed on a message passing multiprocessor which achieve reduction in parallel execution time by domain decomposition. The model can estimate the performance of algorithms with different execution behaviours and incorporates the effect of overlapping of computation and communication, algorithmic waiting time and load imbalance. None of the earlier models incorporated the effects of all these factors but have dealt with restricted algorithmic behaviour.<<ETX>>