1) For the Peterson solution find a situation using pre-emption where both process get into busy wait situation. adefine N 2 adefine TRUE 1 ndefine FASE e int interested [N] = FALSE; int turn; void Entry-section(int process) int other; other - 1-process; interested[process] - TRUE; turn - process; while(interested other]-TRUE 8& turn = process); [CRITICAL SECTION] void Exit section(int process) interested[process] = FALSE;
1) For the Peterson solution find a situation using pre-emption where both process get into busy wait situation. adefine N 2 adefine TRUE 1 ndefine FASE e int interested [N] = FALSE; int turn; void Entry-section(int process) int other; other - 1-process; interested[process] - TRUE; turn - process; while(interested other]-TRUE 8& turn = process); [CRITICAL SECTION] void Exit section(int process) interested[process] = FALSE;
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
Related questions
Question
![1) For the Peterson solution find a situation using pre-emption where both process get into
busy wait situation.
#define N 2
#idefine TRUE 1
#define FASE O
int interested [N] = FALSE;
int turn;
void Entry-section(int process)
int other;
other = 1-process;
interested[process] - TRUE;
turn - process;
while(interested[other]=TRUE && turn = process);
[CRITICAL SECTION]
void Exit section(int process)
interested[process] = FALSE;
2) For the sleep and wake algorithm find a situation using pre-emption where both producer
and consumer fall asleep.
#define N 100
#define count=0
void producer (void)
void consumer(void)
int item;
while(True)
{
item = produce_item();
if(count =- N)
sleep();
insert_item(item);
count = count+1;
int item;
while(True)
{
if(count == 0)
sleep();
item=removeitem();
count = count -1;
if(count=-N-1)
wake_up(producer);
consumer_item(item);
if(count==1)
wake_up(consumer);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fce5dd5ba-8032-4ec5-a2e7-d63f33380aea%2F557bb365-669c-48a0-9993-9e5172cd9915%2Fhbj414_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1) For the Peterson solution find a situation using pre-emption where both process get into
busy wait situation.
#define N 2
#idefine TRUE 1
#define FASE O
int interested [N] = FALSE;
int turn;
void Entry-section(int process)
int other;
other = 1-process;
interested[process] - TRUE;
turn - process;
while(interested[other]=TRUE && turn = process);
[CRITICAL SECTION]
void Exit section(int process)
interested[process] = FALSE;
2) For the sleep and wake algorithm find a situation using pre-emption where both producer
and consumer fall asleep.
#define N 100
#define count=0
void producer (void)
void consumer(void)
int item;
while(True)
{
item = produce_item();
if(count =- N)
sleep();
insert_item(item);
count = count+1;
int item;
while(True)
{
if(count == 0)
sleep();
item=removeitem();
count = count -1;
if(count=-N-1)
wake_up(producer);
consumer_item(item);
if(count==1)
wake_up(consumer);
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 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education