What is the correct scheduling function in Uniprocessor systems Question 2 options: Long term scheduling Medium term scheduling Short term scheduling
Added by Nicholas H.
Step 1
In uniprocessor systems, there are three main types of scheduling: long-term scheduling, medium-term scheduling, and short-term scheduling. Show more…
Show all steps
Your feedback will help us improve your experience
James Kiss and 58 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Select the correct alternative from the given choices. The correct matching for the following pairs is (A) Disk scheduling (1) Round Robin (B) Batch processing (2) SCAN (C) Time sharing (3) LIFO (D) Interrupt processing (4) FIFO (A) $\mathrm{A}-3, \mathrm{~B}-4, \mathrm{C}-2, \mathrm{D}-1$ (B) $A-4, B-3, C-2, D-1$ (C) $A-2, B-4, C-1, D-3$ (D) $\mathrm{A}-2, \mathrm{~B}-1, \mathrm{C}-4, \mathrm{D}-3$
OPERATING SYSTEM
FILE SYSTEMS, I/O SYSTEMS, PROTECTION AND SECURITY
This project involves implementing several different process scheduling algorithms. The scheduler will be assigned a predefined set of tasks and will schedule the tasks based on the selected scheduling algorithm. Each task is assigned a priority and CPU burst. The following scheduling algorithms will be implemented: - First-come, first-served (FCFS) - Shortest-job-first (SJF) - Round-robin (RR) - The quantum is set to 10 milliseconds - Priority Scheduling (PS). Priorities range from 1 to 10, where a higher numeric value indicates a higher relative priority. This algorithm uses round-robin scheduling for tasks with equal priority. Your program should first read the schedule of tasks, insert the tasks into a list, and invoke the scheduler. The schedule of tasks has the form [task name] [priority] [CPU burst], with the following example format: T1 4 20 T2 2 25 T3 3 25 T4 3 15 T5 10 10 Thus, task T1 has priority 4 and a CPU burst of 20 milliseconds, and so forth. It is assumed that all tasks arrive at the same time, so your scheduler algorithms do not have to support higher-priority processes preempting processes with lower priorities. To simulate the execution of a task burst in the CPU, you may write a function (say execute()) where it simply increments a counter by the amount of the burst time. Your program should also take into consideration the context switch time by adding it to the overall time. Context switch time should be a command line parameter that is passed to your program along with the file name containing the list of tasks. Your program should be written in C (or C++) and output the average turnaround time, waiting time, response time for the scheduling algorithm along with the CPU utilization. An example of the command that executes your program may look like: scheduler -a RR -c 2 -f tasks.txt This should run the round robin (RR) algorithm with a context switch of 2 milliseconds for the tasks in file tasks.txt. The command options are as follows. Note that options may be provided in any order. - -a should be followed by the abbreviation of the scheduling algorithm. If this option is not followed by the abbreviation of the scheduling algorithm, the program should apply all scheduling algorithms to the provided file. - -c is followed by the context switch time - -f is followed by the file name of the tasks.
Akash M.
CPU Scheduling: The table below describes the CPU-I/O Burst cycles for processes P1, P2, and P3. Assume the processes arrived in the order P1, P2, P3, all at time 0. Process | Priority | CPU Burst 1 | I/O Burst 1 | CPU Burst 2 | I/O Burst 2 | CPU Burst 3 --- | --- | --- | --- | --- | --- | --- P1 | 1 | 12 | 4 | 12 | - | - P2 | 1 | 2 | 10 | 2 | 12 | 3 P3 | 0 | 6 | 2 | 6 | - | - (a) Draw the Gantt chart timeline, illustrating the interleaving of processes, and calculate the average waiting time for each process under 1. a non-preemptive priority scheduling algorithm 2. a round-robin scheduling algorithm with a quantum = 4. (b) Should you increase the time quantum? Explain your answer.
Madhur L.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD