===============================
The exercices related to this chapter content, plus some additional exercices taken from Chapter9 from the book of Ghosh.
Here you find the best solutions given by students last years, one in French, and another in English.
For those who are interested, they can study this other termination algorithm, due to Dijkstra and Scholten, published in Information Processing Letters in 1980. A nice synthesis is also available in the book of Ghosh. This is an interesting probe-echo algorithm. If you decide to summarize how it works, you can illustrate it using a simple network of processes.
You find a correction regarding exercice 5 of Ghosh's exercices here
Here Proof of the 4 counters algorithm (sorry in French) for termination detection, by Mattern, as a complement of Exercise 1.
It is encouraged to read e.g. chapter 14 of Ghosh Book which constitutes a very nice summary of key problems in distributed transactions management.
======
A Zookeper version for the 2PC: consult this interesting recipe described here
http://zookeeper.apache.org/doc/current/recipes.html#sc_recipes_twoPhasedCommit
Commment about the number of messages complexity, that is quoted as being a drawback: "There are two important drawbacks of the approach described above. One is the message complexity, which is O(nē)."
-- FrancoiseBaude - 16 Oct 2015
to top