Adaptive selection of protocols for strict coherency in distributed shared memory

Thierry Le Sergent and David C J Matthews

Abstract: In this paper we present a scheme for maintaining coherency between copies of objects in a distributed system. Instead of using a fixed protocol for all objects and all time, our scheme is adaptive and is able to select the best from among a set of three protocols. The protocol is selected for each object and may change over time if the pattern of accesses to that object changes. The scheme is in the process of being implemented as part of a distributed shared memory system for ML-like languages. We give a simulation of an example which demonstrates that between 30 and 40 per cent of messages can be saved by our scheme, compared with the dynamic distributed manager algorithm of Kail Li.

LFCS report ECS-LFCS-94-306, August 1994.

Previous | Index | Next