Show intermediate steps leading to your answers for the following problem. (1) T

Question

Show intermediate steps leading to your answers for the following problem.

(1) The following shows a schedule for two transactions T1 and T2.

T1 T2
read(B)
read(B)
write(B)
write(A)
read(A)
write(A)

Use the timestamp protocol approach shown in class to show how the following sequence of operations is executed.

read(B) in T2, read(B) in T1, write(B) in T2, read(A) in T2, write(A) in T1, write(A) in T2.

We assume the following initial values.

TS(T1) = 5,
TS(T2) = 7,
R-timestamp(A) = 0,
W-timestamp(A) = 0,
R-timestamp(B) = 0,
W-timestamp(B) = 0

Explanation / Answer

W-timestamp(Y) is the largest time-stamp of any transaction that executed write(Y) successfully. R-timestamp(Y) is the largest time-stamp of any transaction that executed read(Y) successfully. A transaction performs read operation if its R-timestamp(y)

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---