respect that** The scripts you produce should be tested. In the case of development in C, make the development of your code on paper, as if you were a robot. If your script uses multiple parameters, test it with different data. To guarantee maximum points, it is important to test your solutions rigorously

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
*********Whoever you are. Please read the questions carefully and stop copying and pasting
instructions found on the internet or so-called random information. We are paying for a service, please
respect that****
The scripts you produce should be tested. In the case of development in C, make the development of
your code on paper, as if you were a robot. If your script uses multiple parameters, test it with different
data. To guarantee maximum points, it is important to test your solutions rigorously
Explanations of your solutions are important. Be specific in your explanations. Be factual.
Problem 1: Synchronization (deadlock)
Consider the following program, which sometimes ends in a deadlock.
Initial conditions : Process 1 Process 2
a=1
b=1
c=1
P(a);
P(b);
V(b);
P(c);
V(c);
V(a);
P(c);
P(b);
V(b);
V(c);
P(a);
V(a);
Process 3
P(c);
V(c);
P(b);
P(a);
V(a);
V(b);
3.1 Identify the semaphore pairs that each process seeks to obtain.
3.2 We want to avoid deadlocks by ordering the reservations according to the order a<b<c. Discuss the
reservations of each process according to this criterion.
3.3 Suggest a change to avoid deadlock.
Transcribed Image Text:*********Whoever you are. Please read the questions carefully and stop copying and pasting instructions found on the internet or so-called random information. We are paying for a service, please respect that**** The scripts you produce should be tested. In the case of development in C, make the development of your code on paper, as if you were a robot. If your script uses multiple parameters, test it with different data. To guarantee maximum points, it is important to test your solutions rigorously Explanations of your solutions are important. Be specific in your explanations. Be factual. Problem 1: Synchronization (deadlock) Consider the following program, which sometimes ends in a deadlock. Initial conditions : Process 1 Process 2 a=1 b=1 c=1 P(a); P(b); V(b); P(c); V(c); V(a); P(c); P(b); V(b); V(c); P(a); V(a); Process 3 P(c); V(c); P(b); P(a); V(a); V(b); 3.1 Identify the semaphore pairs that each process seeks to obtain. 3.2 We want to avoid deadlocks by ordering the reservations according to the order a<b<c. Discuss the reservations of each process according to this criterion. 3.3 Suggest a change to avoid deadlock.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
ADT and Class
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.
Similar questions
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