The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We consider massively parallel discrete event simulations where the communication topology among the processing elements is a complex graph. In the case of regular topologies we review recent results on virtual time horizon management. First we analyze the computational scalability of the conservative massively parallel update scheme for discrete event simulations by using the analogy with a well-known surface growth model, then we show that a simple modification of the regular PE communicationarXiv:cond-mat/0304617v1 fatcat:avdoztbwgjae7pfeigwapclnhe