Consider the following two programs in a shared address space. Remember that semaphores are signals (like the flags and lights that railroads use) item buffer [5]; semaphore full (0); semaphore empty (5); semaphore mutex; while (1) { // produce next item to store wait (empty); wait (mutex); // add item to item_buffer signal (mutex); signal (full); while (1) { wait (full); wait (mutex); // remove item from item_buffer; signal (mutex); signal (empty); 11 consume the item } Why must "wait(mutex)" be the last wait performed? • Why does the program on the left wait on the "empty" semaphore, but signal the "full" semaphore? • Why was the "mutex" semaphore added? (What is its purpose?)

Consider the following two programs in a shared address space. Remember that semaphores are signals (like the flags and lights that railroads use) item buffer [5]; semaphore full (0); semaphore empty (5); semaphore mutex; while (1) { // produce next item to store wait (empty); wait (mutex); // add item to item_buffer signal (mutex); signal (full); while (1) { wait (full); wait (mutex); // remove item from item_buffer; signal (mutex); signal (empty); 11 consume the item } Why must "wait(mutex)" be the last wait performed? • Why does the program on the left wait on the "empty" semaphore, but signal the "full" semaphore? • Why was the "mutex" semaphore added? (What is its purpose?)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Computer Science #include<cmath>#include<stdio.h>__global__voidprocess_kernel1(float *input1,float *input2,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = sinf(input1[index]) + cosf(input2[index]);}__global__voidprocess_kernel2(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = logf(input[index]);}_global__voidprocess_kernel3(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x *…
Round-Robin (RR): Write a Java program to implement a Round-Robin (RR) scheduling algorithm with quantum q that will be entered by user. Your program should first prompts the user to input a list of process ID, arrival time, and burst time (in ms) for each process to be run on the CPU. The list is terminated by 0 0 0 for the process ID, arrival time, and burst time. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the RR scheduling algorithm. Also print the turnaround, response, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
3. In the StackGuard approach to solving the buffer overflow problem, the compiler inserts a canary value on the memory location before the retum address in the stack. The canary value is randomly generated. When there is a return from the function call, the compiler checks if the canary value has been overwritten or not. Do you think this approach would work? Why or why not?
Use C++ Programming Language. Objective Define a circular buffer data structure and test it. Problem Description: A circular buffer (also called a circular queue) is circular list of nodes where data items are added on one end of the buffer and removed from the other end. Because the nodes form a circular list, the list has no end or beginning: the tail node points to the head node, creating a ring of nodes. You may think of the nodes as containers or slots that are all initially empty but can be assigned a value in their data field info. Every time a new data item is inserted (inserting to a buffer is often referred as Writing), one slot is filled and the buffer has one less empty slot. Every time a data item is removed (referred to as Reading), the buffer has one more empty slot. Since the list has no beginning and no end, a pointer (writeIndex) is used to mark the next empty slot to write to and a second pointer (readIndex) is used to mark the next node to read from. The…
Computer Science Submit your code solution in .asm files. Please also submit a screenshot showing that you ran the code inside Visual Studio. 2. Suppose you wanted a subroutine to return to an address that was 3 bytes higher in memory than the return address currently on the stack (assume the top stack frame holds the address immediately after the call in main to the procedure). Write a sequence of instructions that would be inserted just before the subroutine’s RET instruction that accomplishes this task.
How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
Implement a Multithreaded Sudoku Solution Validator using POSIX thread library in C Specifications This assignment consists of designing a multithreaded application that determines whether the solution to a Sudoku puzzle is valid. A Sudoku puzzle uses a 9×9 grid in which each column and row, as well as each of the nine 3×3 subgrids, must contain all of the digits 1 to 9. Following figure presents an example of a valid Sudoku puzzle solution. There are several different ways of multithreading this application. In this assignment, you need to implement the strategy to create multiple worker threads that check the following criteria: Nine threads to check that each of the 9 columns contains the digits 1 through 9 Nine threads to check that each of the 9 rows contains the digits 1 through 9 Nine threads to check that each of the 3×3 subgrids contains the digits 1 through 9 This would result in a total of 27 separate worker threads for validating a Sudoku puzzle solution.The parent…
A memory in which the information is stored last is on top & is retrieved first is known as Stack explain?
StackGuard is a tool for detecting buffer overflows. It modifies the compiler to place a known(pseudo)random number (a canary) on the stack just before the return address when a function is called. Additional code is added so that, just before the function returns, it pops the canary and compares it to the value thatwas placed upon the stack. If the two differ, StackGuard asserts a buffer overflow has occurred, and invokes anerror handler to terminate the program. How effective is this approach at stopping stack-based buffer overflows?Under what conditions might it fail?
CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
It is possible to demonstrate the return address of a function by using a series of instructions. Keep in mind that any modifications to the stack must not prohibit the process from returning control to the person who called it.
STACK SEGMENT STACK ENDS DATA SEGMENT DATA ENDS CODE SEGMENT assume cs:code,ds:data,ss:stack MOV AX,data MOV DS,AX MOV AH,02H MOV BH,00 MOV DH,5 MOV DL,10 INT 10H MOV Ax,4C00H INT 21H code ends END What is the output screenshots