One way to avoid deadlock is to schedule threads carefully. Assume the following characteristics of threads T1, T2, T3 and T4: • T1 (at some point) acquires and releases locks L1, L2 and L5 • T2 (at some point) acquires and releases locks L2, L3 and L4 • T3 (at some point) acquires and releases locks L1, L2 and L4 • T4 (at some point) acquires and releases locks L3, L4 and L5 For which schedules below is deadlock possible? (a) T4, T2, T3, and T1 run concurrently. (b) T1 and T2 run concurrently to completion, then T3 runs to completion, then T4 runs. (c) T1 and T3 run concurrently to completion, then T2 and T4 run concurrently to completion. (d) T2 and T4 run concurrently to completion, then T1 runs to completion. (e) T1 and T4 run concurrently to completion, T1 finishes first after which T4 continuous to run to completion with T2.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Quick Answer please

One way to avoid deadlock is to schedule threads carefully. Assume the following characteristics of threads T1, T2, T3 and T4:
• T1 (at some point) acquires and releases locks L1, L2 and L5
• T2 (at some point) acquires and releases locks L2, L3 and L4
• T3 (at some point) acquires and releases locks L1, L2 and L4
• T4 (at some point) acquires and releases locks L3, L4 and L5
For which schedules below is deadlock possible?
(a) T4, T2, T3, and T1 run concurrently.
(b) T1 and T2 run concurrently to completion, then T3 runs to completion, then T4 runs.
(c) T1 and T3 run concurrently to completion, then T2 and T4 run concurrently to completion.
O
(d) T2 and T4 run concurrently to completion, then T1 runs to completion.
(e) T1 and T4 run concurrently to completion, T1 finishes first after which T4 continuous to run to completion with T2.
O
Transcribed Image Text:One way to avoid deadlock is to schedule threads carefully. Assume the following characteristics of threads T1, T2, T3 and T4: • T1 (at some point) acquires and releases locks L1, L2 and L5 • T2 (at some point) acquires and releases locks L2, L3 and L4 • T3 (at some point) acquires and releases locks L1, L2 and L4 • T4 (at some point) acquires and releases locks L3, L4 and L5 For which schedules below is deadlock possible? (a) T4, T2, T3, and T1 run concurrently. (b) T1 and T2 run concurrently to completion, then T3 runs to completion, then T4 runs. (c) T1 and T3 run concurrently to completion, then T2 and T4 run concurrently to completion. O (d) T2 and T4 run concurrently to completion, then T1 runs to completion. (e) T1 and T4 run concurrently to completion, T1 finishes first after which T4 continuous to run to completion with T2. O
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Race Condition
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education