Consider the schedule below. Here, R(*) and W(*) stand for 'Read' and 'Write', respectively. T1, T2, T3, T4 and T5 represent five transactions and ti represents a time slot. ti t2 t3 t4 t5 t6 t7 t8 t9 ti0 t11 t12 t13 t14 t15 t16 t17 t18 T1 R(A) R(B) W(A) W(B) T2 R(C) W(C) T3 R(B) R(C) W(B) W(C) T4 R(D) W(D) R(A) W(A) T5 R(C) R(A) W(C) W(A) Each transaction begins at the time slot of its first Read and commits right after its last Write (same time slot). Regarding the following questions, give and justify your answers. 3) Construct a schedule (which is different from above) of these five transactions which causes deadlock when using two-phase locking protocol. You should clearly indicate all the locks and the corresponding unlocks in your schedule. If no such schedule exists, explain why. 4) Construct a schedule (which is different from above) of these five transactions which does not cause deadlock when using two-phase locking protocol. You should clearly indicate all the locks and the corresponding unlocks in vour schedule. If no such schedule exists explain why.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider the schedule below. Here, R(*) and W(*) stand for 'Read' and 'Write',
respectively. T1, T2, T3, T4 and T5 represent five transactions and ti represents a
time slot.
ti
t2
t3
t4
t5
t6
t7
t8
t9
ti0 t11 t12 t13 t14 t15 t16 t17 t18
T1
R(A)
R(B)
W(A)
W(B)
T2
R(C)
W(C)
T3
R(B)
R(C)
W(B) W(C)
T4
R(D)
W(D) R(A)
W(A)
T5
R(C)
R(A)
W(C)
W(A)
Each transaction begins at the time slot of its first Read and commits right after
its last Write (same time slot).
Regarding the following questions, give and justify your answers.
3) Construct a schedule (which is different from above) of these five
transactions which causes deadlock when using two-phase locking protocol.
You should clearly indicate all the locks and the corresponding unlocks in
your schedule. If no such schedule exists, explain why.
4) Construct a schedule (which is different from above) of these five
transactions which does not cause deadlock when using two-phase locking
protocol. You should clearly indicate all the locks and the corresponding
unlocks in your schedule. If no such schedule exists, explain why.
Transcribed Image Text:Consider the schedule below. Here, R(*) and W(*) stand for 'Read' and 'Write', respectively. T1, T2, T3, T4 and T5 represent five transactions and ti represents a time slot. ti t2 t3 t4 t5 t6 t7 t8 t9 ti0 t11 t12 t13 t14 t15 t16 t17 t18 T1 R(A) R(B) W(A) W(B) T2 R(C) W(C) T3 R(B) R(C) W(B) W(C) T4 R(D) W(D) R(A) W(A) T5 R(C) R(A) W(C) W(A) Each transaction begins at the time slot of its first Read and commits right after its last Write (same time slot). Regarding the following questions, give and justify your answers. 3) Construct a schedule (which is different from above) of these five transactions which causes deadlock when using two-phase locking protocol. You should clearly indicate all the locks and the corresponding unlocks in your schedule. If no such schedule exists, explain why. 4) Construct a schedule (which is different from above) of these five transactions which does not cause deadlock when using two-phase locking protocol. You should clearly indicate all the locks and the corresponding unlocks in your schedule. If no such schedule exists, explain why.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 5 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY