Measuring the overhead in conservative parallel simulations of multicomputer programs

It is shown that it is feasible to characterize the overheads present in conservative parallel simulations of multicomputer programs. The authors use a modified version of the parallel simulator from the Poker programming environment to empirically measure the overhead in two parallel algorithms which use three different interconnection structures. They discuss the sources of overhead and qualitatively discuss their relative importance.<
>