Issue No. 05 - September (1979 vol. 5)
K.M. Chandy , Department of Computer Sciences, University of Texas
The problem of system simulation is typically solved in a sequential manner due to the wide and intensive sharing of variables by all parts of the system. We propose a distributed solution where processes communicate only through messages with their neighbors; there are no shared variables and there is no central process for message routing or process scheduling. Deadlock is avoided in this system despite the absence of global control. Each process in the solution requires only a limited amount of memory. The correctness of a distributed system is proven by proving the correctness of each of its component processes and then using inductive arguments. The proposed solution has been empirically found to be efficient in preliminary studies. The paper presents formal, detailed proofs of correctness.
simulation, Concurrent processes, distributed systems, performance, program proving
J. Misra and K. Chandy, "Distributed Simulation: A Case Study in Design and Verification of Distributed Programs," in IEEE Transactions on Software Engineering, vol. 5, no. , pp. 440-452, 1979.