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?
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?
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...
Related questions
Question
100%
Please see attached pictures
![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?
Part II: Binary Semaphore
struct binary_semaphore
enum (zero, one) value;
queueType queue
void semwaits (binary_semaphore a)
if (8.value one)
s.value = zero;
else l
/* place this process in s.queue */:
/* block this proceas */:
1.
void semsignalB (semaphore a)
if (s. queue is empty ())
s.value = one;
else i
* remove a process P trom s.queue */:
* place proces P on ready list */:
Figure 2 A simple program structure of binary semaphore primitives.
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?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F02e18d97-6dc5-49cb-a926-a13107641ec3%2F652d497c-0600-4d58-bcf1-7becac747229%2F565dcya_processed.jpeg&w=3840&q=75)
Transcribed Image Text: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?
Part II: Binary Semaphore
struct binary_semaphore
enum (zero, one) value;
queueType queue
void semwaits (binary_semaphore a)
if (8.value one)
s.value = zero;
else l
/* place this process in s.queue */:
/* block this proceas */:
1.
void semsignalB (semaphore a)
if (s. queue is empty ())
s.value = one;
else i
* remove a process P trom s.queue */:
* place proces P on ready list */:
Figure 2 A simple program structure of binary semaphore primitives.
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?
![Instructions: Analyze the given concurrency mechanism
figures and answer the corresponding questions for each
type. Use 3-5 sentences in answering.
Part I: Counting Semaphore
struct semaphore (
int count;
queueType queue;
void semwait (semaphore s)
s.count--;
if (s.count < 0)
/* place this process in s.queue /;
1* block thia process /:
void semsignal (somaphore s)
s.count++;
if (s.count<= 0) (
/* remove a process P from s.queue */1
1* place procesa P on ready 1ist */:
Figure 1. A simple program structure of counting semaphore primitives.
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?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F02e18d97-6dc5-49cb-a926-a13107641ec3%2F652d497c-0600-4d58-bcf1-7becac747229%2Fp9p9baa_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Instructions: Analyze the given concurrency mechanism
figures and answer the corresponding questions for each
type. Use 3-5 sentences in answering.
Part I: Counting Semaphore
struct semaphore (
int count;
queueType queue;
void semwait (semaphore s)
s.count--;
if (s.count < 0)
/* place this process in s.queue /;
1* block thia process /:
void semsignal (somaphore s)
s.count++;
if (s.count<= 0) (
/* remove a process P from s.queue */1
1* place procesa P on ready 1ist */:
Figure 1. A simple program structure of counting semaphore primitives.
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?
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY