DS_10_dist_tran_I_Tut - on Distributed Transaction I Give...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS3283 Distributed Systems Distributed Transactions Main Points What are the differences between a process and a transaction? What are the ACID requirements in processing a transaction? What are the problems in processing distributed transactions? What is the problem of concurrency control? What is a schedule? What is a serial schedule? What is a serializable schedule? What is the main purpose of the serializability theorem? What is the problem of dirty read? What is the problem of pre-mature write? What is a recoverable schedule and its implication? How a distributed transaction is generated? What are the differences between a nested distributed transaction and a flat distributed transaction? Dollimore: 13.1, 13.2, 14.1 and 14.2 Tutorial Questions Question 1 Explain the main difference between concurrency control in transaction processing and data synchronization provided by a middleware/OS. Why does the problem of concurrency control is more serious? Question 2 Explain the importance of isolation based on the definition of a transaction shown in slide #8 of the Chapter
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: on Distributed Transaction I. Give an example to show the problem of not meeting the isolation requirement. Question 3 Give an example of a concurrent schedule for a distributed system in which two transactions are serially equivalent at each server but is not serially equivalent globally. Question 4 Consider the following concurrent schedule. Draw the serialization graph for the schedule. Is it serializable? Explain your answer. If the scheduler adopts a serial execution method for executing the transactions, define the new schedule. Ta Tb Tc Read(x) Write(y) Read(y) Write(y) Write(x) Commit Write(z) Commit Commit Question 5 What is the main problem of non-serializablility? Consider the following schedule, what will be the problem if T2 is aborted instead of committed? T1 T2 Write(x) Read(x) Write(y) Write(y) Commit Commit...
View Full Document

This note was uploaded on 01/17/2011 for the course CS CS3283 taught by Professor Kylam during the Spring '10 term at City University of Hong Kong.

Page1 / 2

DS_10_dist_tran_I_Tut - on Distributed Transaction I Give...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online