Crowdly
Додати до Chrome
Given the following transaction sequence, complete the table by clearly indicati...
✅ Перевірена відповідь на це питання доступна нижче. Наші рішення, перевірені спільнотою, допомагають краще зрозуміти матеріал.
Given the following transaction sequence, complete the table by clearly indicating what locks are present at each of the indicated times (Time 0 to Time 10). Cell entries must have the form S(Tn) - for a shared lock by Tn, X(Tn) - for an exclusive lock by Tn, Tn wait Tm - for a wait of Tn due to Tm (where n and m are transaction numbers)
Time | Transaction | Activity | A | B | C | D |
0 | T1 | READ A |
|
|
|
|
1 | T2 | READ B |
|
|
|
|
2 | T3 | READ C |
|
|
|
|
3 | T1 | READ D |
|
|
|
|
4 | T4 | READ B |
|
|
|
|
5 | T4 | UPDATE B |
|
|
|
|
6 | T3 | UPDATE C |
|
|
|
|
7 | T3 | UPDATE A |
|
|
|
|
8 | T1 | UPDATE C |
|
|
|
|
9 | T2 | READ D |
|
|
|
|
10 | T2 | UPDATE A |
|
|
|
|
Based on your answers for this lock table, determine if a deadlock is present. Provide the reason you selected your answer.