Implement a replicated tuple space using the algorithm of Xu and Liskov [1989]. Explain how this
algorithm uses the semantics of tuple space operations to optimize the replication strategy.
What will be an ideal response?
This is a programming exercise left to the reader with further details of the algorithm found in the Xu and
Liskov paper. Figure 6.21. can also be used to inform this implementation.
In terms of optimization, this algorithm is based around a deep understanding of the semantics of tuples
spaces and the associated operations, recognizing that tuples are immutable, that reads do not interfere with
the tuple space and it is only necessary to find one tuple (which may be local or may be found nearby), that
take operations only need to lock tuples spaces until the appropriate tuple is selected for deletion with this
supplemented by the additional rules listed at the top of page 270, again extracted from the required semantics
associated with the concurrent execution of different operations.
You might also like to view...
All of the following are steps computer owners should take to have a positive effect on the environment, EXCEPT _____.
A. recycling ink and toner cartridges B. always making a printed copy of a document C. configuring a computer properly to reduce power consumption D. donating a computer to a charitable organization
What is UML? What are the three major elements of UML?
What will be an ideal response?