Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) (1995)
Lake Placid, New York
June 14, 1995 to June 16, 1995
D. Bruce , Defence Res. Agency, Malvern, UK
Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous 'over-optimistic' computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use. I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of state in optimistic systems, but also as a simple yet general mechanism for performing the necessary state saving with minimal impact on application code. Preliminary results based on a benchmark application and an existing optimistic simulator are presented, showing that providing support for fully general object states is a realistic and practical option. In addition, I show how some existing state saving techniques-including support for shared state-can be derived, and discuss a number of ways in which the model might be extended.
data structures; discrete event simulation; optimistic systems; data structure; theory of persistence; benchmark application; optimistic simulator
D. Bruce, "The treatment of state in optimistic systems," Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)(PADS), Lake Placid, New York, 1995, pp. 40.