Simulation of distributed real-time transactions

Abstract

Distributed nested objects are considered as the building blocks for distributed real-time systems. Objects are stored in memory. Objects can be related in two ways: (1) syntactically: they have a common object from which they are invoked and (2) time-wise: the actions on the objects always occur at the same moments. The consistency of a set of related objects is assured with concurrency control algorithms originating from database systems. Three types of algorithms are considered: optimistic concurrency control, time stamp ordering and two phase locking. The performance of these three algorithms are compared.<>