Suppose there are two periodic/isochronous requests P1 and P2: P1: (35, 70) P1: (40, 95) Question 4.2.1 Please specify the process running sequence of P1 and P2 (such as, P1,P1,P2,P2 ...) using the EDF scheduling between the time t between 0 and 285, namely te [0, 285]. Question 4.2.2 Please explain the system status when te [185, 190] and explain why. Question 4.2.3 Suppose at t = 280, a new periodic request, P3 (30, 40), enters the system. According the EDF scheduling algorithm, can P3 be admitted or not? And, explain why.

Suppose there are two periodic/isochronous requests P1 and P2: P1: (35, 70) P1: (40, 95) Question 4.2.1 Please specify the process running sequence of P1 and P2 (such as, P1,P1,P2,P2 ...) using the EDF scheduling between the time t between 0 and 285, namely te [0, 285]. Question 4.2.2 Please explain the system status when te [185, 190] and explain why. Question 4.2.3 Suppose at t = 280, a new periodic request, P3 (30, 40), enters the system. According the EDF scheduling algorithm, can P3 be admitted or not? And, explain why.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Similar questions

Four processes arrive at the same time with their priorities, execution times and I/O times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn; a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time
In the working set model, the idea is to examine the most recent delta page referances. It is also known as an approximation of the Program's Locality. If the total demand is greater than the total number of available frames (D>m) then it will cause thrashing, because in this case, some processes will not have enough frames. Below you see 3 processes and their excepted memory references during their execution. When will the thrashing happen to occur according to the working set model? Assume total memory(m) is 10 and Delta is 5
In your opinion what does the term semaphore mean in terms of managing concurrent processes in operating systems. a) consider the case of a non negative counting semaphore S. During an execution, 18P(S) operations and 13 V (S) operations were carried out in some order. What is the largest initial value of S for which at least two P(S) operations are blocked?
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Real-time scheduling: In a system consisting of two processes, P1 and P2, suppose process P1 has a period p1 of 50, an execution time t1 of 25, and a deadline that matches its period (50). Further, suppose that P2 has a period p2 of 75, an execution time t2 of 30, and a deadline that matches its period (75). Is this real-time system schedulable under rate-monotonic scheduling? Explain your answer using the concept of overall CPU utilization and schedulability.
Write a program to calculate In C Or Bash Script Language Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF preemptive and RR scheduling (Quantum = 5ms, no priority based preemption). PROCESS NO Arrival time (msec) Burst time(msec) P1 2 7 P2 3 3 P3 4 5 P4 6 6 Write a program to calculate the average waiting time, average turnaround time, average response time, throughput, and CPU utilization. For what percentage of does the CPU remain idle?
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
Suppose there are 8 processes in a system which are waiting to be assigned to the ready queue. The processes have the following properties. Process P1 has burst time 15, priority 6 Process P2 has burst time 12, priority 4 Process P3 has burst time 6, priority 12 Process P4 has burst time 5, priority 11 Process P5 has burst time 8, priority 9 Process P6 has burst time 9, priority 2 Process P7 has burst time 2, priority 20 Process P8 has burst time 17, priority 6 You have to use Multilevel Feedback Queue. It has three queues. The first queue takes processes with priority value from 1 to 5, the second queue takes processes with priority value of 6 to 10 and rest of the processes go to the third queue. First queue follows Round Robin Scheduling with time quantum= 4 Second queue follows Round Robin Scheduling with time quantum = 6 Third queue follows FCFC scheduling. Draw the gantt chart and calculate the average waiting time.
You have a virtual memory system with a two-entry TLB, a 2-way set associative cache and a page table for a process P. Assume cache blocks of 8 bytes and page size of 16 bytes. In the system below, main memory is divided up into blocks, where each block is represented by a letter. Two blocks equals one frame. A) Virtual address page 3, offset 7 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s the main memory frame and what the physical address in binary? Explain your answers. B) Virtual address page 0, offset 1310 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s the main memory frame? Explain your answers. C) Virtual address page 2, offset 3 results in a TLB hit or miss? If TLB hit, what’s the main memory frame? If TLB miss, would it result in a page fault? If not a page fault, what’s…
Consider a disk queue with requests for I/O to blocks on cylinders.98 183 37 122 14 124 65 67. "Considering SSTF (shortest seek time first) scheduling", the total number of head movements is, if the disk head is initially at 53 is?
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
When feasible, what are the upsides of prioritizing the I/O queue as the place where processes would be executed? If the I/O connection suddenly goes down, what do you expect to happen? How would this affect the fastest possible CPU burst rate? I'm not quite sure I get what you're getting at here.