1) For the Peterson solution find a situation using pre-emption where both process get intobusy wait situation.#define N 2#idefine TRUE 1#define FASE Oint 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 producerand consumer fall asleep.#define N 100#define count=0void 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);

As per our guidelines we are supposed to answer only one question. Kindly repost other question as a…

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

See similar textbooks

Similar questions

How to answers below question for 'ATM Transaction' based on object oriented modeling: a. Case: part of that system will be modeled ?b. Specifications: concrete explanation about the flow to be modeled ?c. Identification of Actors/Roles ?d. Identify Paths (Alternative and Concurrent) ?e. Identify Node Objects ?f. Identify Exception Handling ?g. Final Charts ?
Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later…
Write short notes on, (а) Optimistic concurrency control (b) Phantom deadlock.
Simulation of bank calling system [Problem Description] Using linear list to simulate the bank's queuing business model [Basic Requirements] Suppose that the working hours of the bank are from 9 a.m. to 5 p.m The time when customers arrive at the bank is generated randomly, and the customers are queued in the order of arrival. The time required for each customer to handle business can also be generated randomly, no more than 30 minutes. If the randomly generated time length is 0, it indicates that the customer leaves early and does not handle business. When the program is running, input the number of bank windows, and then output the basic information of each customer's business in the bank according to the randomly generated customer data (arrival time, time required for business), including: customer arrival time, customer waiting time, what time the customer handled business in which window, and how long the business lasted. From this, we can observe the average waiting time of…
When and how to make use of implicit heap-dynamic variables, in addition to the reasoning for doing so.
Algorithm for Check Schedulability With LocksData: Periodic program P with locks, WCET estimates Ci for τi and Ci l,k for lock block Bi l,kResult: P schedulable or not; if schedulable, WCRT estimates for each task
i want 4 SEQUENCES DIAGRAM from this use case:- 옷 Student incorrect extend 옷 admin add course «include include login employees evalution includes reservation time include «include>> extend extend extende extende extend y extend lack of money follow up financial situation make payment include member complete training course include online «include> basic course view employee info remove empolyee promotion employee extende view std info cash not qualified include print card has no money extend extends pass the interview includes «extend- extend choose level course exten write report apply to work receive salary modify 064 employee WRON WHEN OPM
Write algorithm for Check Schedulability (No Locks):Data: Periodic program P without locks, WCET estimates Ci for τiResult: P schedulable or not, and if so WCRT estimate for each task
Given a system of 4 processes with a set of constraints described by the following precedence relation: › : {(P1, P3), (P1, P4), (P2, P4)} The processes access memory locations according to the table attached. Answer the following questions about the system (you are not required to draw any graphs): 1. Is the system determinate for all interpretations of its processes? Explain why. 2. Is the process pair (P3, P4) mutually non-interfering (MNI)? Explain why. 3. If the process pair (P3, P4) is not MNI, what modifications are necessary to guarantee that the system is determinate for all interpretations?
2. For several sets of tasks scheduled by the RM algorithm, demonstrate a sufficient feasibility condition of: 1. Liu & Layland (LL) 2. Bini-Buttazzo-Buttazzo (BBB)
In order to minimize an FA, you have to try and determine if any of the states are actually the same state. You can do this by a table a table and finally by tables that shaped table All the results are stored in a nifty "stair step" that prevents any state from being compared to
what are the deadlock avoidance approaches? hello, it seems like the ones given to me were conditions of a deadlock to occur, but not the avoidance approaches. can you help me understand what deadlock avoidance approach can be done for deadlock conditions? no handwritten answers please, no one worded, one phrased, or one sentenced answers too please. please help me understand