> > > need for locks. An example of why not is creation of a resource > > called > > > "datasetA". > > > > > > 3 nodes: > > > node A sends "create datasetA" > > > node B sends "create datasetA" > > > node C sends "create datasetA" > > > > > > Only one of those nodes create dataset will arrive first. The > > > remainder > > > will arrive second and third. Also, vs requires that each node > sends > > > in > > > the same order so it may be something like on all nodes: > > > B received, C received, A received. > > > > > > In this case, B creates the dataset, C says "dataset exists" A says > > > "dataset exists". All nodes see this same ordering
But how does a node gets its initial state?? When a node joins it does not know the state of the other nodes, but it receives state change messages from other nodes. A distributed state machine only works if a node knows the state before joining the group. Is there a 'standard' solution to that problem? - Dietmar _______________________________________________ Openais mailing list Openais@lists.linux-foundation.org https://lists.linux-foundation.org/mailman/listinfo/openais
