Restructuring networks to avoid deadlocks in parallel simulations

The authors introduce a novel approach for parallel discrete event simulation which reduces or eliminates the possibility of deadlock without complex time synchronization or deadlock detection protocols. Deadlock is eliminated by restructuring the logical network representing the physical system to an equivalent network which is deadlock free. For large networks, a full elimination of deadlock can concentrate messages too much, so an intermediate restructuring is used to reduce and control the possibilities of deadlock. Empirical studies show that small to medium size queueing networks for which previous conservative methods have failed can be simulated in parallel with efficiencies ranging from 30 to 80%