TEXT   25

Distributed Transaction Management

Guest on 11th May 2022 01:42:00 AM

  1. Distributed Transaction Management
  2. 1. Create another example (not payments like in slides),
  3. where nested txns seem to be reasonable in that there
  4. may be an aborting subtxn but even then the top-level
  5. txn will commit. Draw a txn tree and explain how the
  6. processing might proceed.
  7.  
  8. 2. Let us assume the following events:
  9. Server X initiates a TIP txn.
  10. X pushes the txn is to server Y.
  11. Y pushes the txn is to server Z.
  12. X initiates 2PC and all vote yes.
  13. Write down the sequence of messages exchanged.
  14.  
  15. 3. Let us assume the following events:
  16. Server X initiates a TIP txn.
  17. X pushes the txn to server Y.
  18. Y pushes the txn to server Z.
  19. Y pushes the txn to server U.
  20. U pushes the txn to server W, which can not commit
  21. the txn.
  22. X initiates 2PC and all but U vote yes.
  23. Write down the sequence of messages exchanged.
  24.  
  25.  
  26. 4. Show that one-phase commit in TIP may violate
  27. atomicity (that is, there may be someone committing
  28. and someone else aborting). For this,  you need more than
  29. two participants in the participant tree.
  30.  
  31. 5. Give a condition under which one-phase commit can be
  32. done safely in TIP.

Raw Paste


Login or Register to edit or fork this paste. It's free.