DS_10_dist_tran_I_Tut_sol

DS_10_dist_tran_I_Tut_sol - CS3283 Distributed Systems...

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 I 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? In concurrency control, concurrent access of a data object is not allowed. The meaning of concurrent access
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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_sol - CS3283 Distributed Systems...

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