1. Complete requested data for each scheduling algorithm. 2. Average turn around time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 3. Average wait time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 4. Submitted this completed document to Webcourses. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. C. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. Calculate the average wait time of the processes. e. Time Table Gantt Chart Process ID Time Process ID 1 0 23456 Process ID 1 2 # Average turn around time = Average waiting time: = 23 3 4 456 6 11 Arrival Time 7 Exit Time # 8519 0 3 Burst Time 9 10 7 # 58 21 Turn Around Time # I Waiting Time # #

1. Complete requested data for each scheduling algorithm. 2. Average turn around time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 3. Average wait time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 4. Submitted this completed document to Webcourses. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. C. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. Calculate the average wait time of the processes. e. Time Table Gantt Chart Process ID Time Process ID 1 0 23456 Process ID 1 2 # Average turn around time = Average waiting time: = 23 3 4 456 6 11 Arrival Time 7 Exit Time # 8519 0 3 Burst Time 9 10 7 # 58 21 Turn Around Time # I Waiting Time # #

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 1P

See similar textbooks

Similar questions

A buddy system allocates memory from a fixed-size segment consisting of physically contiguous pages using a power-of-2 allocator. Consider a computer system that has 256M memory available. By using diagram, show the results of each memory request/release via memory layout at each stage according to the followings orders: requests 25M requests 110M requests 52M Release A Release C requests 75M Page Time Loaded Last Reference R bit M bit 2 117 212 1 1 0 130 264 0 0 3 58 240 1 0 1 86 203 1 1 In your own words, explain what happened to the memory block prior to the last request allocation. Calculate the total of internal fragmentation (in M unit) after memory allocation to request C is fulfilled.
Consider the following set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 What is the turnaround time of each process for each of the scheduling algorithms, FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1 P2 P3 P4 P5
Consider the following data [Figure].Suppose round robin scheduling is applied on the given data with time quantum=Floor (XX % 3) units. It is also given that scheduling of a process or context switch will take 1 unit of time. What is the completion time and turnaround time of process P4?Where XX is the last two digits of your roll number. XX=18
Consider the following five processes each having its own unique execution time and arrival time Process Arrival Time Execution Time A 0 6 B 3 2 C 5 4 D 7 6 E 10 3 Draw a timeline and compute the average turnaround time and average waiting time for reach of the scheduling algorithms below: 1.FCFS 2.Round Robin (time slice = 3) 3. SRT 4. SJF
4. In Optimal page algorithm, the page that will be used later is swapped-out over a page that is to be used immediately. 5. Under which of the following scenarios is page replacement algorithm required? 6. Which page replacement algorithm is associated with each page, the time when the page was brought into memory?
Assignment 11. Consider the following set of processes,with the length of the CPU burst and arrival timegiven in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrate the execution of these processes using the preemptive Shortest Job First.b. What is the turnaround time of each process?c. What is the waiting time of each process?d. What is the Average turnaround time of the execution?e. What is the Average waiting time of the execution?2. Consider the following set of processes, with the length of the CPU burst and arrival time given in seconds: Process Arrival Time Burst TimeP2 0 12P3 3 8P4 5 4P1 10 10P5 12 6 a. Draw Gantt chart that illustrates the execution of these processes using the FCFS.b. What is the Average turnaround time of the execution?c. What is the Average waiting time of the execution?
A computer has four page frames. The time of loading, time of last access, and the Referenced (R) and Modified (M) bits for each page frame are shown in Table 1 (the times are in clock ticks from the process start at time 0). A page fault to virtual page 4 has occurred at time 265. Table 1: Virtual Page Information Including the initial placement of virtual page in memory (as in Table 1) just before the page fault, consider the following virtual page reference string: 1, 2, 3, 0, 4, 0, 4, 3, 1, 2, 0, 5, 2, 4, 1 Referring to Table 1, which page should be replaced for each of the following memory management policies? Explain why the page is replaced. FIFO LRU Optimal (Refer to the reference string) How many page faults would occur if Optimal policy is used? Show clearly when each page fault would occur.
b.Start from the resource allocation state in Q 13. If a request from a process P3 arrives for (1, 2, 3), can the request be immediately granted ? Why or why not ? c.Start from the resource allocation state in Q 13. Suppose that P4 asks for 2 instances of resource B. Can the system grant this if it wants to avoid deadlock ? Explain.
QUESTION 3 A process refers to 5 pages, 1, 2, 3, 4, 5 in the order : 4,1,0,4,2,1,3,4,2,5,2,1,0,4,3,5,2,0,1,4. If the page replacement algorithm is LRU, the number of page fault with an empty internal store of 3 frames is? 18 17 16 15 14 13 12 11
A real-time system executing four different periodic tasks Ti(p,t) is given, with p and t representing the period and the execution time of the task, respectively. Each task's deadline matches its period p. The system is executing the following set of tasks: S = {T1(10,2), T2(4,1), T3(10,3), T4(7,1)}. Is this real-time system schedulable under Rate-Monotonic (RM) scheduling? Is this real-time system schedulable under Earliest Deadline First (EDF) scheduling? Explain your answers using the concept of overall CPU utilization.
Consider a system containing three periodic tasks: T1 = (10,3), T2 = (30,5), and T3 = (60,6), handled by Rate Monotonic. Solve the scheduling produced by a sporadic server with Ts = 20, Cs = 5, which is scheduled with the other tasks according to the RMA principle. Suppose there are three sporadic jobs S1 = (10,7,30) and S2 = (15,3,60), and S3 = (20,8,70). Work out a timing diagram showing the schedule of the system. Would any deadline be broken?
Use Table 11-2 to solve the problem. The requirement for computer server capacity at a particular company is expected to increase at a rate of 15% per year for the next 5 years. If the server capacity is expected to be 1,200 gigabytes in 5 years, how many gigabytes of capacity are there today? Round to the nearest whole gigabyte.