The theory of Monte Carlo simulation of random geometric objects such as random walks and random surfaces is considered on a sequential and a parallel computer. The partition functions generated for simple Monte Carlo rules are derived and the difference between sequential and parallel computing is discussed for the case of random walks with fixed endpoints or for random loops. The implications for random surface calculations in parallel is considered in short.