Consider a situation where 5 instances of a resource are available. That means maximum 5 processes are allowed to enter the critical section at any point in time. Please provide a solution using a counting semaphore. Write the pseudocode for each process.

Consider a situation where 5 instances of a resource are available. That means maximum 5 processes are allowed to enter the critical section at any point in time. Please provide a solution using a counting semaphore. Write the pseudocode for each process.

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm TASK2: DESCRIPTION One of the simplest methods for memory allocation is to divide memory into several fixed-sized partitions. Each partition may contain exactly one process. In this multiple-partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process. The operating system keeps a table indicating which parts of memory are available and which are occupied. Finally, when a process arrives and needs memory, a memory section large enough for this process is provided. When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, then the operating system must decide which free block to allocate. Best-fit strategy chooses the block…
You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm TASK2: DESCRIPTION One of the simplest methods for memory allocation is to divide memory into several fixed-sized partitions. Each partition may contain exactly one process. In this multiple-partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process. The operating system keeps a table indicating which parts of memory are available and which are occupied. Finally, when a process arrives and needs memory, a memory section large enough for this process is provided. When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, then the operating system must decide which free block to allocate. Best-fit strategy chooses the block…
Python Language Q2: Ginormous Campus The campus is pretty big. There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CS lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes, respectively. m lines…
Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…
Purpose of this assignment: To allow student to be able to implement a Java-based application by implementing specific algorithms. Instruction: This is an individual assignment. You have to use Java to load data from text file. The text file contains data of customer. You program will be able to perform the following: • Two sorting algorithms are implemented. The user is allow to choose the desire sorting algorithm. Then, it will show the sequence of sorting in step-by-step. Finally, it will display the sort result. Search function is simplement. It will allow the program to search specific customer data based on the usre input. The program will display the searching steps until the intended data is found.
In this project you are to design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C+), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
Question No: 06 This is a subjective question, hence you have to write your answer in the Text-Field given below. Consider P0,P1,P2 are three processes synchronised with semaphores S0=1,S1=0,S2=0 as shown initialised. The table below gives the code of the processes Process PO While (true) { Process PI Process P2 Wait(S2); print 1"; signal(S1), wait(S1); signal(S1); wait(so); print *0"; signal (S1); signal (S2); a If the sequence of processes schedule is P1,P2,P0,P0,P2,P0,P2,P0. What are the values printed? b. If the semaphores are initialised with S0-0,S1=1 ,S2=1. What are the values printed for the above sequence?
Computer Science using java The program has to evaluate arithmetic expressions using a BST for thatpurpose. The rules are the following:The program asks the user to enter an arithmetic expression in the infixformat. Then the program builds a BST for that expression. After buildingthe BST, a menu will be present to the user allowing him to: traverse the BST in inorder, traverse the BST in postorder, traverse the BST in preorder.Users will choose among the options present. The result will be thedisplay of the original arithmetic expression and the new one thatdepends on the option chosen. The program should repeat as long as theuser wants.
A declared name is only valid within a region of code known as the name's scope. Example: A variable “globalVar_1” declared in main() is only valid within main(), from the declaration to main()'s end. True or false
Purpose of this assignment: To allow student to be able to implement a Java thread-based application by loading allowing user to perform a computation operation. Instruction: This is an individual assignment. You have to use Java thread to write a program that can perform two calculation functions concurrently. One of the function will generate a series of Fibonacci number sequence. The second function will calculate the result of factiorial function. This factorial function will allow the user to input a start number, end number and number of threads. Then, function will split into thread to perform the calculation. At the end, the function will merge the result of each thread calculation and display the result.
For this task, you are to complete a program which manages a movie collection. Instructions The movie collection program found below is currently missing two important pieces of functionality---it doesn't add movies to the collection, nor is it able to print the longest movies in the collection. Provided for you is the Movie class which contains the title and duration for a particular movie, and the MovieCollection class which is responsible for maintaining a collection of movies. Your task is to implement missing functionality by a) completing the interactive loop, and b) defining a print_longest_movies method on the MovieCollection class. a) Completing the interactive loop To complete the interactive loop, you must instantiate a Movie object using the information provided by the user and add it to the MovieCollection object using the provided add_movie method. b) Defining print_longest_movies This method is to take no arguments and print the title and duration…
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".