Part I: Counting Semaphore Questions:In your perspective, what makes counting semaphore primitives a good concurrency mechanism?How does the structure of counting semaphore primitives differ from binary semaphore primitives? Part II: Binary Semaphore Part III: Monitor Instructions: Analyze the given concurrency mechanismfigures and answer the corresponding questions for eachtype. Use 3-5 sentences in answering. (6 items x5 points)Part III: Monitorenteringjo anandPart I: Counting Semaphorestruct senaphore (sassaonadint count;Monitor waiting areaEntrance:anenb edkgenenbMONITORvoid semlait (semaphore s)Condition el:--1unooI to > 1unoo8) 3TCondition variablesProcedure 1(s eroudeues) teubTsues proA!++zunooSI (o =>3unoos) IT/* place process P on ready list */:Figure 1. A simple program structure of couning semaphore primibvescwait (en) Oy aunpasoQuestions:1. In your perspective, what makes counting semaphoreprimitives a good concurrency mechanism?2. How does the structure of counting semaphoreprimitives differ from binary semaphore primitives?ananb juadanPart II: Binary Semaphorestruct binary_sanaphore (미머!onTRA (ouo ozaz) unuefonanb edkIenenbFigure 3. The stucture of a monitor relative to concurrency.Questions:5. Deduce at least one (1) characteristic of a monitonbased on Figure 3. Elaborate on your answer.6. Would you agree that a monitor, as a concurrencymechanism, can support process synchronization?Why or why not?toze - onteA/* place this process in s.queue /:Grading Rubric:CriteriaPerformance In dicatorPointsContentCorrect ideas, concepts, and/orexamples were induded.Organization The presentation of idea was3.2.!/. 1STT Apeaa uo a ssapoad oerd /TOTALFigure 2. A simple program structure of binary semaphore primiivesNote: DO NOTCOPY AND PASTE. Stvdents who copy and paste heir work from any websteor her alassate wlaubmaticaly recalve a failing mark far this activity.Questions:3. Briefly explain the purpose of the semWaitB andsemSignalB functions in Figure 2.4.Based on Figures 1 and 2, which semaphorestructure is easier to implement and why?

Semaphores are the best synchronisation mechanisms. These are used for the process synchronisation.…

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

See similar textbooks

Part I: Counting Semaphore

Questions:

In your perspective, what makes counting semaphore primitives a good concurrency mechanism?
How does the structure of counting semaphore primitives differ from binary semaphore primitives?

Part II: Binary Semaphore

Part III: Monitor

Instructions: Analyze the given concurrency mechanism
figures and answer the corresponding questions for each
type. Use 3-5 sentences in answering. (6 items x5 points)
Part III: Monitor
entering
jo anand
Part I: Counting Semaphore
struct senaphore (
sassaonad
int count;
Monitor waiting area
Entrance
:anenb edkgenenb
MONITOR
void semlait (semaphore s)
Condition el
:--1unoo
I to > 1unoo8) 3T
Condition variables
Procedure 1
(s eroudeues) teubTsues proA
!++zunooS
I (o =>3unoos) IT
/* place process P on ready list */:
Figure 1. A simple program structure of couning semaphore primibves
cwait (en) O
y aunpaso
Questions:
1. In your perspective, what makes counting semaphore
primitives a good concurrency mechanism?
2. How does the structure of counting semaphore
primitives differ from binary semaphore primitives?
ananb juadan
Part II: Binary Semaphore
struct binary_sanaphore (
미머
!onTRA (ouo ozaz) unue
fonanb edkIenenb
Figure 3. The stucture of a monitor relative to concurrency.
Questions:
5. Deduce at least one (1) characteristic of a moniton
based on Figure 3. Elaborate on your answer.
6. Would you agree that a monitor, as a concurrency
mechanism, can support process synchronization?
Why or why not?
toze - onteA
/* place this process in s.queue /:
Grading Rubric:
Criteria
Performance In dicator
Points
Content
Correct ideas, concepts, and/or
examples were induded.
Organization The presentation of idea was
3.
2.
!/. 1STT Apeaa uo a ssapoad oerd /
TOTAL
Figure 2. A simple program structure of binary semaphore primiives
Note: DO NOTCOPY AND PASTE. Stvdents who copy and paste heir work from any webste
or her alassate wlaubmaticaly recalve a failing mark far this activity.
Questions:
3. Briefly explain the purpose of the semWaitB and
semSignalB functions in Figure 2.
4.
Based on Figures 1 and 2, which semaphore
structure is easier to implement and why?

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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