CGS3763_Assignment1

docx

School

University of Central Florida *

*We aren’t endorsed by this school

Course

3763

Subject

Industrial Engineering

Date

Feb 20, 2024

Type

docx

Pages

5

Uploaded by teammartinelli

Report
University of Central Florida CGS 3763 Operating Systems Assignment 1 Due, Sunday, February 11, 2024 for maximum 100% Monday, February 12, 2024 for maximum 90% Tuesday, February 13, 2024 for maximum 80% Wednesday, February 14, 2024 for maximum 70% Tasks and Deliverables   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. Average response time must be fully explained (e.g. 1 + 2 + 3 + 4 + 5 = 15 / 5 = 3) 5. Submit this completed document to Webcourses. References 1. 8_CGS3763 Operating System Process Scheduling_FCFS.pptx 2. 9_CGS3763 Operating System Process Scheduling_SJF.pptx 3. 10_CGS3763 Operating System Process Scheduling_SRTF.pptx Calculations 1. Turn   Around   Time   =   Exit   Time   -   Arrival   Time       2. Waiting   Time   =   Turn   Around   Time   -   Burst   Time 3. Response Time = Waiting Time + Arrival Time  
2 1. Consider the arrival and burst time of six jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. c. Generate a Gantt chart to show when each process is executed. d. Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. f. Calculate the average response time of the processes. Process ID Arrival Time Burst Time 1 6 9 2 1 6 3 9 5 4 0 2 5 4 3 6 12 7 Time Table Process ID Exit Time Turn Around Time Waiting Time Response Time 1 2 3 4 5 6 Gantt Chart Process ID Time 0 # # # # # # Average turn around time = Average waiting time = Average response time =
3 2. Consider the arrival time and burst time of six jobs specified in the table below. a. Apply the Shortest Job First (SJF) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. c. Generate a Gantt chart to show when each process is executed. d. Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. f. Calculate the average response time of the processes. Process ID Arrival Time Burst Time 1 6 9 2 1 6 3 9 5 4 0 2 5 4 3 6 12 7 Time Table Process ID Exit Time Turn Around Time Waiting Time Response Time 1 2 3 4 5 6 Gantt Chart Process ID Time 0 # # # # # # Average turn around time = Average waiting time = Average response time =
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
4 3. Consider the arrival time and burst time of six jobs specified in the table below. a. Apply the Shortest Remaining Time to Finish (SRTF) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, waiting time, and response time. c. Generate a Gantt chart to show when each process is executed. d. Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. f. Calculate the average response time of the processes. Process ID Arrival Time Burst Time 1 6 9 2 1 6 3 9 5 4 0 2 5 4 3 6 12 7 Time Table Process ID Exit Time Turn Around Time Waiting Time Response Time 1 2 3 4 5 6 Gantt Chart Process ID Time 0 # # # # # # # # # # # Average turn around time = Average waiting time = Average response time =
5 4. Compare and analyze the results from the three scheduling algorithms. Scheduling algorithm Average turn around time Average wait time Average response time FCFS SJF SRTF 5. Which OS process scheduling algorithm performed the best in regard to a system where user responsiveness is critical ? 6. Which metric determined the scheduling algorithm selection?