Given 3 processes A, B, and C with corresponding burst times 20, 5, and 2, what's the common waiting time with a primary (FCFS) scheduler? All processes are able to run at constant time however they arrived within the order A, B, then C.

Given 3 processes A, B, and C with corresponding burst times 20, 5, and 2, what's the common waiting time with a primary (FCFS) scheduler? All processes are able to run at constant time however they arrived within the order A, B, then C.

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

answer for part 1 is provided.I need answer for part 3 context switching At arrival time 0, we have 2 processes P1 and P2 with same priority 3 So, according to Shortest Remaining Time First policy, P1 with burst time of 15 P1 0 15 After 15 secs, no other process has arrived and Process P2 is executed for 5 secs and then new processes has arrived. But, Process P2 has the highest priority when compared to the new processes. So, it completely gets executed P1 P2 0 15 35 Now, all the processes have arrived and P3 P4 P5 has the same priority. So, according to SRTF policy, P5 is executed and then P4 and P3 P1 P2 P5 P3 P4 0 15 35 40 50 70 Now, the only remained process of P6 is executed P1 P2 P5 P3 P4 P6 0 15 35 40 50 70 85 Step 2 Thus, the…
Consider a system that implements demand paging without a TLB. The single-level page table is held in memory, and we assume that there are no free frames. Each memory access requires 100 nanoseconds. It takes 6 additional milliseconds to handle a page fault if the victim page is not “dirty” or 12 additional milliseconds if the victim page is “dirty”. Experiments show that the probability of page faulting is 0.00003 (i.e., 0.003% chance) and that the average memory access time is 400ns. What is the percent chance that a page is dirty at the time it is evicted? Hint: Call the “being dirty” probability d and write a simple equation that gives the average data access time as a function of d. Solve for d (the result should be a number between 0 and 1, which you then convert to a percentage).
Assume a process is replicated in a TIB/Rendezvous system. Give two solutions to avoid so that messages from this replicated process are not published more than once.
Assume a process is replicated in a TIB/Rendezvous system. Give two solutions to avoid so that messages from this replicated process are not published more than once.
Given 5 processes with burst time 10,8,12,2,1 and all process are available at t=0. Find which process will be scheduled last according to SJF algorithm.
The access-control matrix could be used to determine whether a process can switch from, say, domain A to domain B and enjoy the access privileges of domain B. Is this approach equivalent to including the access privileges of domain B in those of domain A?
Consider a system that implements demand paging without a TLB. The single-level page table is held in memory, and we assume that there are no free frames. Each memory access requires 100 nanoseconds. It takes 6 additional milliseconds to handle a page fault if the victim page is not "dirty" or 12 additional milliseconds if the victim page is "dirty". Experiments show that the probability of page faulting is 0.00003 (i.e., 0.03% chance) and that the average memory access time is 400ns. What is the percent chance that a page is dirty at the time it is evicted? Hint: Call the "being dirty" probability d and write a simple equation that gives the average data access time as a function of d. Solve for d (the result should be a number between 0 and 1, which you then convert to a percentage).
A distributed system may have multiple, independent resources. Imagine that process 0 wants to access resource A and process I wants to access resource B. Can Ricart and Agrawala's algorithm lead to deadlocks? Explain your answer.