[infinispan-dev] Fwd: infinispan-dev Digest, Vol 56, Issue 24

Hey guys, thank you for taking the time to watch my talk. The original paper [1] that describes the TOA algorithm, and its integration with Infinispan, has extensive performance figures comparing 2PC with Total order based commit. The results of their experiments show, that with the write/skew check in place, throughput increases and latency decreases when using the Total Order based commit in clusters containing six or more nodes. The transaction abort rate is similar to that of 2PC (when write/skew check is used). The synchronised GSN is maintained using internal synchronisation between the box members. Internal synchronisation is used, because we want the order box approach to be independent of the underlying total order protocol. Below is a brief description of how the GSN is maintained. All box members start with a GSN value of 0. Upon receiving an ordering request from an Infinispan node, a box member sends a totally ordered message (containing the id of the infinispan message that requires ordering) to all box members (including itself). Because this box message is totally ordered, it is guaranteed that all box members receive the box message in the same order, therefore each box member assigns the same GSN to the infinispan message associated with this box message. As soon as the contacted box member has delivered its own message it will know the GSN of the infinispan message, and therefore a response (containing the GSN) can be sent to the infinispan node that requested ordering. My intention is to prepare a document explaining in detail how our system works, which I will distribute to the mailing list at some point next week. Ryan [1] http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6133071