SCALING ASPECTS FOR THE PERFORMANCE OF PARALLEL ALGORITHMS

We investigate the performance of two-dimensional cellular automata si mulations on two parallel computers of the message-passing type, namel y a small Transputer system and one SUPRENUM-cluster. The timing resul ts can be fitted with a simple modelling function with parameters dire ctly connected to properties of the algorithm and the computer system. They exhibit scaling behaviour and it can be shown that the resulting scaling function is universal in the sense that it is valid for a wid e range of algorithms.