Optimistic and pessimistic synchronization in distributed computing

Abstract

This short article presents a part of our research results in object-based distributed computing: simulation results of optimistic and pessimistic synchronization mechanisms in distributed computing environments, where communication latency is not small. We show, for some difficult problems in distributed computing, e.g., distributed simulation of systems with tight feed back loops, any approach based on either sole optimistic synchronization or sole pessimistic synchronization does not work efficiently. For the purposes of highly efficient execution, we have to predict the degree of communication latency and the average behavior of the system and combine both synchronization mechanisms in an proper manner based on the prediction.