-
Notifications
You must be signed in to change notification settings - Fork 1
System Model for Distributed Shared Memory
In general, we employ the system model described in the paper Multi-Writer Consistency Conditions for Shared Memory Registers_:
We assume a system consisting of a collection P of processes that communicate with each other through message-passing. Each process is modeled as a state machine, with an initial state and a transition function. The state machine represents the code for the register simulation that is running at the process.
Furthermore, we prefer to the client/server architecture within the system itself:
Some processes in the system play the role of "servers", which maintain replicas, while others play the role of "clients", which handle invocations of operations on the replicated data. There is one client process corresponding to each application process.
Note that the client/server architecture is just a layered edition of the system model in the paper Sharing Memory Robustly in Message-Passing Systems.
The client (representing some application thread) has to wait for a response from the operation before submitting another operation on any simulated object.