Consider the intersection shown in the figure below. A B Cars arrive at the intersection along the roads marked A, B, and C, and proceed to take a left or a right turn. Thus Car A taking a right turn goes to road B and taking a left turn goes to road C, etc. The intersection has no traffic light or any other traffic control signs. Each car knows the road it is on and the turn it wants to take. Cars along each road come in one at a time and execute a procedure LEFT or RIGHT to go left or right respectively, passing the identity of the road it is coming from as an argument. (Thus car coming on road B and wanting to take a left will execute LEFT(B)). A. Design the procedures LEFT and RIGHT using semaphores. The correct solution should support maximal parallelism, assure that no deadlocks occur, and there is no starvation. Of course there should be no collisions of the cars. B. How many semaphore variables does your solution require and why?

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

1

Consider the intersection shown in the figure below.
A
B
Cars arrive at the intersection along the roads marked A, B, and C, and proceed to take
a left or a right turn. Thus Car A taking a right turn goes to road B and taking a left turn
goes to road C, etc. The intersection has no traffic light or any other traffic control signs.
Each car knows the road it is on and the turn it wants to take. Cars along each road
come in one at a time and execute a procedure LEFT or RIGHT to go left or right
respectively, passing the identity of the road it is coming from as an argument. (Thus
car coming on road B and wanting to take a left will execute LEFT(B)).
A. Design the procedures LEFT and RIGHT using semaphores. The correct solution
should support maximal parallelism, assure that no deadlocks occur, and there is
no starvation. Of course there should be no collisions of the cars.
B. How many semaphore variables does your solution require and why?
C. What is the maximum number of cars that can be in the intersection in your
solution?
Transcribed Image Text:Consider the intersection shown in the figure below. A B Cars arrive at the intersection along the roads marked A, B, and C, and proceed to take a left or a right turn. Thus Car A taking a right turn goes to road B and taking a left turn goes to road C, etc. The intersection has no traffic light or any other traffic control signs. Each car knows the road it is on and the turn it wants to take. Cars along each road come in one at a time and execute a procedure LEFT or RIGHT to go left or right respectively, passing the identity of the road it is coming from as an argument. (Thus car coming on road B and wanting to take a left will execute LEFT(B)). A. Design the procedures LEFT and RIGHT using semaphores. The correct solution should support maximal parallelism, assure that no deadlocks occur, and there is no starvation. Of course there should be no collisions of the cars. B. How many semaphore variables does your solution require and why? C. What is the maximum number of cars that can be in the intersection in your solution?
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Time complexity
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
  • SEE MORE 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