An optimistic algorithm for consistent replicated shared data

The authors present the Toris algorithm for implementing the shared data model of interprocess communication in a distributed environment. Data are replicated at all processing sites. An optimistic algorithm maintains consistency between replicas of shared data and ensures that the synchronization requirements of the processes are met. Transactions are used to improve the performance of the optimistic algorithm and provide a mechanism for application-level synchronization.<<ETX>>