Round Robin Algorithm.pptx
•Download as PPTX, PDF•
5 likes•2,234 views
Round Robin is a preemptive scheduling algorithm where each process is allocated an equal time slot or time quantum to execute before being preempted. It is designed for time-sharing to ensure all processes are given a fair share of CPU time without starvation. The process is added to the back of the ready queue when its time slice expires. It provides low response time on average but increased context switching overhead compared to non-preemptive algorithms. The time quantum value impacts both processor utilization and response time.
Report
Share
Report
Share
Recommended
Scheduling algorithms
The document discusses various scheduling algorithms used in operating systems including:
- First Come First Serve (FCFS) scheduling which services processes in the order of arrival but can lead to long waiting times.
- Shortest Job First (SJF) scheduling which prioritizes the shortest processes first to minimize waiting times. It can be preemptive or non-preemptive.
- Priority scheduling assigns priorities to processes and services the highest priority process first, which can potentially cause starvation of low priority processes.
- Round Robin scheduling allows equal CPU access to all processes by allowing each a small time quantum or slice before preempting to the next process.
Round robin scheduling
The document discusses different types of scheduling algorithms. It describes cyclic scheduling, where a set of periodic tasks are executed repeatedly in a defined cycle. Round robin scheduling is also covered, where each task gets a time slice to execute in a cyclic queue before the next task runs. The round robin algorithm aims to be fair by giving each task an equal share of CPU time. Examples of using these algorithms for orchestra robots and VoIP are provided.
Priority scheduling algorithms
This document presents an overview of priority scheduling algorithms. It discusses basic concepts of scheduling, criteria like CPU utilization and turnaround time. It provides an example of priority scheduling with and without preemption. Advantages include ease of use and suitability for varying time requirements. A disadvantage is potential indefinite blocking of low priority processes.
Operating Systems Process Scheduling Algorithms
The document discusses various CPU scheduling algorithms used in operating systems including first-come, first-served (FCFS), round robin (RR), shortest job first (SJF), and shortest remaining time first (SRTF). It explains the assumptions, goals, and tradeoffs of each algorithm such as minimizing response time, maximizing throughput, and ensuring fairness. Examples are provided to illustrate how each algorithm works and its performance compared to others under different conditions involving job lengths. Predicting future job lengths is also discussed as it can impact the performance of algorithms like SRTF.
Round Robin Scheduling Algorithm
Round robin scheduling assigns CPU bursts to processes in time quantums of 4 time units. It was analyzed that with 3 processes having arrival times of 0 and burst times of 24, 3, and 3 time units respectively, the average turnaround time was 15.66 time units and the average waiting time was 5.666 time units.
CPU Scheduling algorithms
The document discusses different CPU scheduling algorithms used in operating systems. It describes non-preemptive and preemptive scheduling and explains the key differences. It then covers four common scheduling algorithms - first come first served (FCFS), round robin, priority scheduling, and shortest job first (SJF) - and compares their advantages and disadvantages.
SCHEDULING ALGORITHMS
This document discusses different types of scheduling algorithms used by operating systems to determine which process or processes will run on the CPU. It describes preemptive and non-preemptive scheduling, and provides examples of common scheduling algorithms like first-come, first-served (FCFS), shortest job first (SJF), round robin, and priority-based scheduling. Formulas for calculating turnaround time and waiting time are also presented.
Process scheduling
Hello....
Dear views
Scheduling is most important Role in OS..... in this ppt i described very Creatively about Process Scheduling...... I hope you like it..... and easily understand it...... :-) :-)
Recommended
Scheduling algorithms
The document discusses various scheduling algorithms used in operating systems including:
- First Come First Serve (FCFS) scheduling which services processes in the order of arrival but can lead to long waiting times.
- Shortest Job First (SJF) scheduling which prioritizes the shortest processes first to minimize waiting times. It can be preemptive or non-preemptive.
- Priority scheduling assigns priorities to processes and services the highest priority process first, which can potentially cause starvation of low priority processes.
- Round Robin scheduling allows equal CPU access to all processes by allowing each a small time quantum or slice before preempting to the next process.
Round robin scheduling
The document discusses different types of scheduling algorithms. It describes cyclic scheduling, where a set of periodic tasks are executed repeatedly in a defined cycle. Round robin scheduling is also covered, where each task gets a time slice to execute in a cyclic queue before the next task runs. The round robin algorithm aims to be fair by giving each task an equal share of CPU time. Examples of using these algorithms for orchestra robots and VoIP are provided.
Priority scheduling algorithms
This document presents an overview of priority scheduling algorithms. It discusses basic concepts of scheduling, criteria like CPU utilization and turnaround time. It provides an example of priority scheduling with and without preemption. Advantages include ease of use and suitability for varying time requirements. A disadvantage is potential indefinite blocking of low priority processes.
Operating Systems Process Scheduling Algorithms
The document discusses various CPU scheduling algorithms used in operating systems including first-come, first-served (FCFS), round robin (RR), shortest job first (SJF), and shortest remaining time first (SRTF). It explains the assumptions, goals, and tradeoffs of each algorithm such as minimizing response time, maximizing throughput, and ensuring fairness. Examples are provided to illustrate how each algorithm works and its performance compared to others under different conditions involving job lengths. Predicting future job lengths is also discussed as it can impact the performance of algorithms like SRTF.
Round Robin Scheduling Algorithm
Round robin scheduling assigns CPU bursts to processes in time quantums of 4 time units. It was analyzed that with 3 processes having arrival times of 0 and burst times of 24, 3, and 3 time units respectively, the average turnaround time was 15.66 time units and the average waiting time was 5.666 time units.
CPU Scheduling algorithms
The document discusses different CPU scheduling algorithms used in operating systems. It describes non-preemptive and preemptive scheduling and explains the key differences. It then covers four common scheduling algorithms - first come first served (FCFS), round robin, priority scheduling, and shortest job first (SJF) - and compares their advantages and disadvantages.
SCHEDULING ALGORITHMS
This document discusses different types of scheduling algorithms used by operating systems to determine which process or processes will run on the CPU. It describes preemptive and non-preemptive scheduling, and provides examples of common scheduling algorithms like first-come, first-served (FCFS), shortest job first (SJF), round robin, and priority-based scheduling. Formulas for calculating turnaround time and waiting time are also presented.
Process scheduling
Hello....
Dear views
Scheduling is most important Role in OS..... in this ppt i described very Creatively about Process Scheduling...... I hope you like it..... and easily understand it...... :-) :-)
CPU Scheduling Algorithms
The document discusses various CPU scheduling algorithms including first come first served, shortest job first, priority, and round robin. It describes the basic concepts of CPU scheduling and criteria for evaluating algorithms. Implementation details are provided for shortest job first, priority, and round robin scheduling in C++.
Real time Operating System
This document discusses real-time operating systems (RTOS). It defines RTOS as operating systems that are able to respond to inputs immediately within a specified time delay. It compares RTOS to general operating systems and discusses the types, characteristics, functions, and applications of RTOS. Examples of RTOS like VxWorks are provided. The key functions of an RTOS include task management, scheduling, resource allocation, and interrupt handling. RTOS are widely used in applications that require deterministic responses like avionics, medical devices, industrial automation, and more.
Cpu scheduling in operating System.
The document discusses CPU scheduling in operating systems. It describes how the CPU scheduler selects processes that are ready to execute and allocates the CPU to one of them. The goals of CPU scheduling are to maximize CPU utilization, minimize waiting times and turnaround times. Common CPU scheduling algorithms discussed are first come first serve (FCFS), shortest job first (SJF), priority scheduling, and round robin scheduling. Multilevel queue scheduling is also mentioned. Examples are provided to illustrate how each algorithm works.
Real-Time Scheduling
This document discusses real-time scheduling algorithms. It begins by defining real-time systems and their key properties of timeliness and predictability. It then discusses two common real-time scheduling algorithms: fixed-priority Rate Monotonic scheduling and dynamic-priority Earliest Deadline First scheduling. It covers how each algorithm prioritizes and orders tasks, and analyzes their schedulability and utilization bounds. It concludes by comparing the two approaches.
Classical Planning
The document discusses classical AI planning and different planning approaches. It introduces state-space planning which searches for a sequence of state transformations, and plan-space planning which searches for a plan satisfying certain conditions. It also discusses hierarchical planning which decomposes tasks into simpler subtasks, and universal classical planning which uses different refinement techniques including state-space and plan-space refinements. Classical planning makes simplifying assumptions but its principles can still be applied to games with some workarounds.
Process scheduling
Process scheduling involves assigning system resources like CPU time to processes. There are three levels of scheduling - long, medium, and short term. The goals of scheduling are to minimize turnaround time, waiting time, and response time for users while maximizing throughput, CPU utilization, and fairness for the system. Common scheduling algorithms include first come first served, priority scheduling, shortest job first, round robin, and multilevel queue scheduling. Newer algorithms like fair share scheduling and lottery scheduling aim to prevent starvation.
Clock driven scheduling
The document discusses clock-driven scheduling for real-time systems. It covers key concepts like static schedules, cyclic executives, frame size constraints, job slicing, and algorithms for constructing static schedules. Notations are introduced to represent periodic tasks, and assumptions made for clock-driven scheduling are explained. Methods to improve the average response time of aperiodic jobs through slack stealing are also summarized.
Greedy algorithm
The document discusses greedy algorithms and their application to optimization problems. It provides examples of problems that can be solved using greedy approaches, such as fractional knapsack and making change. However, it notes that some problems like 0-1 knapsack and shortest paths on multi-stage graphs cannot be solved optimally with greedy algorithms. The document also describes various greedy algorithms for minimum spanning trees, single-source shortest paths, and fractional knapsack problems.
Operating System-Process Scheduling
Process Scheduling : Scheduling criteria, preemptive & non-preemptive scheduling, scheduling algorithms
Shortest job first Scheduling (SJF)
This document describes the Shortest Job First (SJF) CPU scheduling algorithm. SJF prioritizes processes in the ready queue based on the shortest estimated CPU burst time so that the process with the shortest burst time is selected first. SJF aims to minimize average waiting times and turnaround times. However, it requires accurate predictions of burst times and cannot always be implemented in practice due to lack of future knowledge.
Divide and conquer
The document discusses divide and conquer algorithms. It describes divide and conquer as a design strategy that involves dividing a problem into smaller subproblems, solving the subproblems recursively, and combining the solutions. It provides examples of divide and conquer algorithms like merge sort, quicksort, and binary search. Merge sort works by recursively sorting halves of an array until it is fully sorted. Quicksort selects a pivot element and partitions the array into subarrays of smaller and larger elements, recursively sorting the subarrays. Binary search recursively searches half-intervals of a sorted array to find a target value.
Cocomo model
The COCOMO model is a widely used software cost estimation model that predicts development effort and schedule based on project attributes. It includes basic, intermediate, and detailed models of increasing complexity. The intermediate model estimates effort as a function of source lines of code and cost drivers. The detailed model further incorporates the impact of cost drivers on development phases. COCOMO 2 expands on this with application composition, early design, reuse, and post-architecture models for different project stages.
Deadlock ppt
This document discusses deadlocks, including the four conditions required for a deadlock, methods to avoid deadlocks like using safe states and Banker's Algorithm, ways to detect deadlocks using wait-for graphs and detection algorithms, and approaches to recover from deadlocks such as terminating processes or preempting resources.
MULTILEVEL QUEUE SCHEDULING
Multilevel queue scheduling divides processes into groups based on properties like type and resource usage. These groups are placed into multiple queues, each with a different priority level. Higher priority queues like the system process queue use scheduling algorithms like FCFS, while lower priority queues like the student process queue use priority scheduling. This approach allows different scheduling optimizations based on the process type compared to a single queue approach. A disadvantage is the potential for lower priority processes to starve if higher priority processes monopolize resources.
CPU Scheduling in OS Presentation
CPU scheduling allows processes to share the CPU by pausing execution of some processes to allow others to run. The scheduler selects which process in memory runs on the CPU. There are four types of scheduling decisions: when a process pauses for I/O, switches from running to ready, finishes I/O, or terminates. Scheduling can be preemptive, where a higher priority process interrupts a running one, or non-preemptive. Common algorithms are first come first serve, shortest job first, priority, and round robin. Real-time scheduling aims to process data without delays and ensures the highest priority tasks run first.
Operating System: Deadlock
Deadlock is a very important topic in operating system. In this presentation slide, try to relate deadlock with real life scenario and find out some solution with two main algorithm- Safety and Banker's Algorithm.
Introduction to Dynamic Programming, Principle of Optimality
Introduction
Dynamic Programming
How Dynamic Programming reduces computation
Steps in Dynamic Programming
Dynamic Programming Properties
Principle of Optimality
Problem solving using Dynamic Programming
Semaphores
1) A semaphore consists of a counter, a waiting list, and wait() and signal() methods. Wait() decrements the counter and blocks if it becomes negative, while signal() increments the counter and resumes a blocked process if the counter becomes positive.
2) The dining philosophers problem is solved using semaphores to lock access to shared chopsticks, with one philosopher designated as a "weirdo" to avoid deadlock by acquiring locks in a different order.
3) The producer-consumer problem uses three semaphores - one to limit buffer size, one for empty slots, and one for locks - to coordinate producers adding to a bounded buffer
Parsing
what is Parsing
different types of parsing
what is parser and role of parser
what is top-down parsing and bottom-up parsing
what is the problem in top-down parsing
design of top-down parsing and bottom-up parsing
examples of top-down parsing and bottom-up parsing
SRS(software requirement specification)
The document defines an SRS as the official statement of what system developers should implement, providing a complete description of the system behavior. An SRS precisely defines the software product and is used to understand requirements to design the software. It includes the purpose, product scope, features, interfaces, and other functional and non-functional requirements. The SRS benefits include establishing agreement between customers and suppliers, reducing development effort, and providing a baseline for validation.
Process scheduling in Light weight weight and Heavy weight processes.
This slide basically refers to the various kinds of Process Scheduling algorithms along with there explanation and Gantt charts.
ch_scheduling (1).ppt
CPU scheduling determines which process will be assigned to the CPU for execution. There are several types of scheduling algorithms:
First-come, first-served (FCFS) assigns processes in the order they arrive without preemption. Shortest-job-first (SJF) selects the process with the shortest estimated run time, but may result in starvation of longer processes. Priority scheduling assigns priorities to processes and selects the highest priority process, but low priority processes risk starvation.
More Related Content
What's hot
CPU Scheduling Algorithms
The document discusses various CPU scheduling algorithms including first come first served, shortest job first, priority, and round robin. It describes the basic concepts of CPU scheduling and criteria for evaluating algorithms. Implementation details are provided for shortest job first, priority, and round robin scheduling in C++.
Real time Operating System
This document discusses real-time operating systems (RTOS). It defines RTOS as operating systems that are able to respond to inputs immediately within a specified time delay. It compares RTOS to general operating systems and discusses the types, characteristics, functions, and applications of RTOS. Examples of RTOS like VxWorks are provided. The key functions of an RTOS include task management, scheduling, resource allocation, and interrupt handling. RTOS are widely used in applications that require deterministic responses like avionics, medical devices, industrial automation, and more.
Cpu scheduling in operating System.
The document discusses CPU scheduling in operating systems. It describes how the CPU scheduler selects processes that are ready to execute and allocates the CPU to one of them. The goals of CPU scheduling are to maximize CPU utilization, minimize waiting times and turnaround times. Common CPU scheduling algorithms discussed are first come first serve (FCFS), shortest job first (SJF), priority scheduling, and round robin scheduling. Multilevel queue scheduling is also mentioned. Examples are provided to illustrate how each algorithm works.
Real-Time Scheduling
This document discusses real-time scheduling algorithms. It begins by defining real-time systems and their key properties of timeliness and predictability. It then discusses two common real-time scheduling algorithms: fixed-priority Rate Monotonic scheduling and dynamic-priority Earliest Deadline First scheduling. It covers how each algorithm prioritizes and orders tasks, and analyzes their schedulability and utilization bounds. It concludes by comparing the two approaches.
Classical Planning
The document discusses classical AI planning and different planning approaches. It introduces state-space planning which searches for a sequence of state transformations, and plan-space planning which searches for a plan satisfying certain conditions. It also discusses hierarchical planning which decomposes tasks into simpler subtasks, and universal classical planning which uses different refinement techniques including state-space and plan-space refinements. Classical planning makes simplifying assumptions but its principles can still be applied to games with some workarounds.
Process scheduling
Process scheduling involves assigning system resources like CPU time to processes. There are three levels of scheduling - long, medium, and short term. The goals of scheduling are to minimize turnaround time, waiting time, and response time for users while maximizing throughput, CPU utilization, and fairness for the system. Common scheduling algorithms include first come first served, priority scheduling, shortest job first, round robin, and multilevel queue scheduling. Newer algorithms like fair share scheduling and lottery scheduling aim to prevent starvation.
Clock driven scheduling
The document discusses clock-driven scheduling for real-time systems. It covers key concepts like static schedules, cyclic executives, frame size constraints, job slicing, and algorithms for constructing static schedules. Notations are introduced to represent periodic tasks, and assumptions made for clock-driven scheduling are explained. Methods to improve the average response time of aperiodic jobs through slack stealing are also summarized.
Greedy algorithm
The document discusses greedy algorithms and their application to optimization problems. It provides examples of problems that can be solved using greedy approaches, such as fractional knapsack and making change. However, it notes that some problems like 0-1 knapsack and shortest paths on multi-stage graphs cannot be solved optimally with greedy algorithms. The document also describes various greedy algorithms for minimum spanning trees, single-source shortest paths, and fractional knapsack problems.
Operating System-Process Scheduling
Process Scheduling : Scheduling criteria, preemptive & non-preemptive scheduling, scheduling algorithms
Shortest job first Scheduling (SJF)
This document describes the Shortest Job First (SJF) CPU scheduling algorithm. SJF prioritizes processes in the ready queue based on the shortest estimated CPU burst time so that the process with the shortest burst time is selected first. SJF aims to minimize average waiting times and turnaround times. However, it requires accurate predictions of burst times and cannot always be implemented in practice due to lack of future knowledge.
Divide and conquer
The document discusses divide and conquer algorithms. It describes divide and conquer as a design strategy that involves dividing a problem into smaller subproblems, solving the subproblems recursively, and combining the solutions. It provides examples of divide and conquer algorithms like merge sort, quicksort, and binary search. Merge sort works by recursively sorting halves of an array until it is fully sorted. Quicksort selects a pivot element and partitions the array into subarrays of smaller and larger elements, recursively sorting the subarrays. Binary search recursively searches half-intervals of a sorted array to find a target value.
Cocomo model
The COCOMO model is a widely used software cost estimation model that predicts development effort and schedule based on project attributes. It includes basic, intermediate, and detailed models of increasing complexity. The intermediate model estimates effort as a function of source lines of code and cost drivers. The detailed model further incorporates the impact of cost drivers on development phases. COCOMO 2 expands on this with application composition, early design, reuse, and post-architecture models for different project stages.
Deadlock ppt
This document discusses deadlocks, including the four conditions required for a deadlock, methods to avoid deadlocks like using safe states and Banker's Algorithm, ways to detect deadlocks using wait-for graphs and detection algorithms, and approaches to recover from deadlocks such as terminating processes or preempting resources.
MULTILEVEL QUEUE SCHEDULING
Multilevel queue scheduling divides processes into groups based on properties like type and resource usage. These groups are placed into multiple queues, each with a different priority level. Higher priority queues like the system process queue use scheduling algorithms like FCFS, while lower priority queues like the student process queue use priority scheduling. This approach allows different scheduling optimizations based on the process type compared to a single queue approach. A disadvantage is the potential for lower priority processes to starve if higher priority processes monopolize resources.
CPU Scheduling in OS Presentation
CPU scheduling allows processes to share the CPU by pausing execution of some processes to allow others to run. The scheduler selects which process in memory runs on the CPU. There are four types of scheduling decisions: when a process pauses for I/O, switches from running to ready, finishes I/O, or terminates. Scheduling can be preemptive, where a higher priority process interrupts a running one, or non-preemptive. Common algorithms are first come first serve, shortest job first, priority, and round robin. Real-time scheduling aims to process data without delays and ensures the highest priority tasks run first.
Operating System: Deadlock
Deadlock is a very important topic in operating system. In this presentation slide, try to relate deadlock with real life scenario and find out some solution with two main algorithm- Safety and Banker's Algorithm.
Introduction to Dynamic Programming, Principle of Optimality
Introduction
Dynamic Programming
How Dynamic Programming reduces computation
Steps in Dynamic Programming
Dynamic Programming Properties
Principle of Optimality
Problem solving using Dynamic Programming
Semaphores
1) A semaphore consists of a counter, a waiting list, and wait() and signal() methods. Wait() decrements the counter and blocks if it becomes negative, while signal() increments the counter and resumes a blocked process if the counter becomes positive.
2) The dining philosophers problem is solved using semaphores to lock access to shared chopsticks, with one philosopher designated as a "weirdo" to avoid deadlock by acquiring locks in a different order.
3) The producer-consumer problem uses three semaphores - one to limit buffer size, one for empty slots, and one for locks - to coordinate producers adding to a bounded buffer
Parsing
what is Parsing
different types of parsing
what is parser and role of parser
what is top-down parsing and bottom-up parsing
what is the problem in top-down parsing
design of top-down parsing and bottom-up parsing
examples of top-down parsing and bottom-up parsing
SRS(software requirement specification)
The document defines an SRS as the official statement of what system developers should implement, providing a complete description of the system behavior. An SRS precisely defines the software product and is used to understand requirements to design the software. It includes the purpose, product scope, features, interfaces, and other functional and non-functional requirements. The SRS benefits include establishing agreement between customers and suppliers, reducing development effort, and providing a baseline for validation.
What's hot (20)
Introduction to Dynamic Programming, Principle of Optimality
Introduction to Dynamic Programming, Principle of Optimality
Similar to Round Robin Algorithm.pptx
Process scheduling in Light weight weight and Heavy weight processes.
This slide basically refers to the various kinds of Process Scheduling algorithms along with there explanation and Gantt charts.
ch_scheduling (1).ppt
CPU scheduling determines which process will be assigned to the CPU for execution. There are several types of scheduling algorithms:
First-come, first-served (FCFS) assigns processes in the order they arrive without preemption. Shortest-job-first (SJF) selects the process with the shortest estimated run time, but may result in starvation of longer processes. Priority scheduling assigns priorities to processes and selects the highest priority process, but low priority processes risk starvation.
Lecture 4 process cpu scheduling
The document discusses various aspects of process scheduling and CPU scheduling. It describes the different queues that an operating system maintains for processes in different states. These include ready queues for processes ready to execute, and device queues for processes waiting on I/O. It also covers schedulers for long term, short term, and medium term scheduling and different scheduling algorithms like FCFS, priority scheduling, and round robin scheduling. Context switching is described as the mechanism to store and restore process states to enable time sharing of the CPU between processes.
CPU Scheduling Part-III.pdf
CPU scheduling is the basis of multiprogrammed operating systems. By switching the CPU among processes, the operating system can make the computer more productive
- To introduce CPU scheduling, which is the basis for multiprogrammed operating systems
- To describe various CPU-scheduling algorithms
- To discuss evaluation criteria for selecting a CPU-scheduling algorithm for a particular system
- To examine the scheduling algorithms of several operating systems
CPU Scheduling.pptx
1. CPU scheduling is the process of distributing the CPU time among the active processes in the ready queue. It becomes necessary when there are more processes waiting to use the CPU than there are CPUs.
2. There are different states that a process can be in such as ready, running, waiting, terminated etc. The short term scheduler selects a process from the ready queue to run on the CPU based on the scheduling algorithm used.
3. Common scheduling algorithms include First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin. Each has its own merits and demerits in terms of CPU utilization, waiting time, response time and throughput.
operating system (1).pdf
Here are the answers to your short questions on CPU scheduling:
1. The base of CPU scheduling is multiprogrammed operating systems. CPU scheduling allows multiple processes to share the CPU.
2. The purpose of CPU scheduling is to make efficient use of CPU time by executing multiple processes in a fair manner. It aims to optimize CPU utilization and improve turnaround time and waiting time of processes.
3. The fastest CPU scheduling algorithm is shortest job first (SJF) as it prioritizes the shortest job. However, it requires knowledge of future which is not practical.
4. We need scheduling to allocate scarce system resources like CPU, memory among competing processes in an efficient manner.
5. FIFO is
UNIPROCESS SCHEDULING.pptx
FCFS (First Come First Serve) is a non-preemptive scheduling algorithm where processes are executed in the order of their arrival. It uses a first-in first-out queue and is simple to implement. However, it can result in longer waiting times, especially for I/O bound processes. It also favors CPU-intensive processes as they can monopolize the CPU once started. The document then provides an example of FCFS scheduling along with the calculation of turnaround time and waiting time for each process.
programming .pptx
The document discusses different types of schedulers and scheduling algorithms used in operating systems. It describes:
1) Primary and secondary schedulers that prioritize threads and increase priority of non-executing threads.
2) Four states a process can be in: new, ready, running, waiting, terminated. This helps the scheduler respond to each process.
3) Scheduling algorithms like FCFS, SJF, SRTN, priority, and round robin - discussing their approach, advantages, disadvantages.
4) Concepts like arrival time, burst time, completion time, turnaround time, waiting time used in CPU scheduling.
Operating system 30 preemptive scheduling
In non-preemptive scheduling once a process has been allocated the CPU it runs uninterrupted until it finishes execution.
On the other hand, in preemptive schedule algorithms, the running process may be interrupted by a higher priority process in between its execution.
Whenever a process gets into ready state or the currently running finishes execution, the priority of the ready state process is checked against that of the running process.
If the priority of the ready process is more it is allowed to be allocated to the CPU.
Therefore, in these schemes, the CPU is allocated to the process with the highest priority all the time.
This gives rise to frequent context switching, which can become very costly in terms of CPU time wasted in switching. In the following sections we will explore some of such scheduling algorithms
Cpu scheduling
The document discusses CPU scheduling techniques used in operating systems to improve CPU utilization. It describes how multiprogramming allows multiple processes to share the CPU by switching between processes when one is waiting for I/O. Common scheduling algorithms like first-come first-served (FCFS), priority scheduling, round robin, and shortest job first are explained. The goal of scheduling is to maximize throughput and minimize average wait times for processes.
Section05 scheduling
This document discusses CPU scheduling in operating systems. It covers basic scheduling concepts like multiprogramming and preemptive scheduling. It then describes the role of the scheduler and dispatcher in selecting which process runs on the CPU. Several common scheduling algorithms are explained like first-come first-served, shortest job first, priority scheduling, and round robin. Factors for evaluating scheduling performance and examples of scheduling in Linux and real-time systems are also summarized.
Scheduling algorithms
Scheduling Algorithms
1.First-Come, First-Served Scheduling (FCFS)
2.Shortest-Job-First Scheduling (SJF)
3.Priority Scheduling
4.Round-Robin Scheduling (RR)
5.Multilevel Queue Scheduling
6.Multilevel Feedback Queue Scheduling
May14ProcessScheduling.ppt
This document discusses different approaches to CPU scheduling. It describes three levels of scheduling: long-term, medium-term, and short-term. For short-term scheduling, which determines the next ready process to execute, it covers scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), shortest remaining time (SRT), and round-robin. It analyzes the advantages and disadvantages of each approach with respect to criteria like CPU utilization, waiting time, response time, and turnaround time.
pscheduling.ppt
This document discusses different approaches to CPU scheduling. It describes three levels of scheduling: long-term, medium-term, and short-term. For short-term scheduling, which determines the next ready process to execute, it covers scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), shortest remaining time (SRT), and round-robin. It analyzes the advantages and disadvantages of each approach with regards to criteria like CPU utilization, waiting time, throughput, response time and turnaround time.
PROCESS.pptx
A process represents a program in execution. It progresses sequentially through different states from start to termination. A process has sections for stack, heap, text, and data in memory. Shortest Job First (SJF) scheduling allocates the CPU to the process with the shortest estimated run time remaining. It aims to minimize average waiting times but requires knowing future process durations. First Come First Served (FCFS) scheduling handles processes in the order they arrive without preemption, but is prone to the convoy effect where short jobs wait behind long ones.
scheduling Uni processor Long-term .ppt
This document discusses different types of processor scheduling techniques. It begins by explaining the goals of processor scheduling and breaking it down into long-term, medium-term, and short-term scheduling. It then provides details on each type of scheduling, including examples. It discusses scheduling criteria such as CPU utilization, throughput, turnaround time, waiting time, and response time. It also covers different scheduling algorithms like priority queuing, shortest job first scheduling, and multi-level feedback queue scheduling.
LM10,11,12 - CPU SCHEDULING algorithms and its processes
The document discusses CPU scheduling in operating systems. It covers key concepts like processes alternating between CPU and I/O bursts, the role of the CPU scheduler and dispatcher in selecting the next process to run. It also describes different scheduling algorithms like FCFS, SJF, priority, and round robin scheduling and compares their advantages and disadvantages in optimizing criteria like CPU utilization, wait time, and throughput.
Operating system
This document summarizes several CPU scheduling algorithms used in operating systems. It discusses the process states of ready, running, and waiting. The key scheduling algorithms covered are first come first serve (FCFS), shortest job first (SJF), priority scheduling, and round robin. For each algorithm, it describes the approach, advantages, and disadvantages. It analyzes and compares the algorithms based on average turnaround time, waiting time, and CPU utilization. FCFS is found to have the highest CPU utilization while SJF has the lowest average turnaround and waiting times.
Round-ribon algorithm presntation
Round Ribon Algorithm used in operating Scheduling is better from FCFS etc used in previous operating system
OS.pptx
This document discusses criteria for CPU scheduling and optimization in operating systems. It covers metrics like CPU utilization, throughput, turnaround time, and waiting time. The key goals of optimization are to maximize CPU usage and throughput while minimizing times. Real-time requirements can be soft or hard, with hard deadlines requiring failure prevention. Real-time kernels provide benefits like abstraction of timing, modularity, and improved efficiency. Linux uses scheduling algorithms like FIFO, round robin, and completely fair scheduling to optimize these metrics.
Similar to Round Robin Algorithm.pptx (20)
Process scheduling in Light weight weight and Heavy weight processes.
Process scheduling in Light weight weight and Heavy weight processes.
LM10,11,12 - CPU SCHEDULING algorithms and its processes
LM10,11,12 - CPU SCHEDULING algorithms and its processes
More from Sanad Bhowmik
Time Management.pptx
Time management is the process of organizing and planning how to divide time between different activities to work smarter and get more done with less time. It allows people to save time, reduce stress, function effectively, increase work output, and have more control over responsibilities. Effective time management involves costing time, making activity logs, setting goals, planning, prioritizing, and scheduling to make the most of time.
Set.pptx
The document defines and describes different types of sets including empty, finite, infinite, equal, and equivalent sets. It also explains some basic set operations such as union, complement, and Cartesian product. Specifically, an empty set contains no elements, a finite set has a countable number of members, an infinite set cannot be counted or represented in roster form, equal sets have the same elements and number of elements, and equivalent sets have the same cardinality.
Learning outcomes of system analysis and design and.pptx
System analysis and design refers to examining a business situation to improve procedures and methods through better computerized information systems. It provides structure for analyzing and designing information systems and involves a series of processes to systematically improve a business. The learning outcomes include being able to define system concepts, develop information systems using various problem-solving tools, write requirements and specifications, and work in groups on system development projects.
Importance of Numerical Methods in CSE.pptx
This document introduces numerical methods and their importance in computer science and engineering. It explains that numerical methods are used to approximate solutions to mathematical problems that cannot be solved analytically or that are too computationally expensive to solve analytically. It outlines the typical steps involved in using numerical methods which are to formulate a mathematical model, construct an appropriate numerical method, implement the method, and validate the solution. Finally, it provides some examples of how numerical methods are applied in fields like engineering, science, and modeling real-world phenomena.
Python Dictionary.pptx
This document provides an introduction to Python dictionaries. It explains that dictionaries are collections of key-value pairs that are mutable and unordered. It describes how to create a dictionary by placing key-value pairs within curly braces, with unique immutable keys and values that can be of any data type. The document also outlines how to access elements from a dictionary using keys, change and add dictionary elements using assignment, and remove elements. It notes that dictionaries can be nested inside one another to model more complex information.
Potato Disease Recognition.pptx
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise boosts blood flow, releases endorphins, and promotes changes in the brain which help enhance one's emotional well-being and mental clarity.
Web Development.pptx
This presentation provides an introduction to web development. It defines a web developer as someone who turns web designs into fully functional websites by building and maintaining sites with the user and client in mind. The presentation also describes a full stack developer as a professional who works with both the front-end and back-end of applications.
Impact and Solutions of unemployment in the present of Bangladesh
This presentation discusses unemployment in Bangladesh. It defines unemployment and outlines the main types: involuntary, voluntary, and transient. The causes of unemployment in Bangladesh include population growth, lack of investment, limited arable land, and a defective education system. Unemployment leads to issues like mental and physical disabilities, drug addiction, crime, and abuse of political power. Currently, Bangladesh has an unemployment rate of 3.7% and about 30 million unemployed people. To address this problem, the presentation recommends setting up more industries, introducing vocational training programs, encouraging respect for manual labor, honest governance, and controlling population growth.
Fake News detection.pptx
This document discusses a research project on detecting fake news. It introduces the team members working on the project and explains that the goal is to address the negative impacts of widespread fake news spread on social media. The research methodology will use techniques like naïve bayes classifier and random forest to analyze qualitative and quantitative data and identify patterns that distinguish fake from factual news. The system is still being developed and tested using various datasets including social media, search engines, and fact-checking websites. The conclusion is that this fake news detection system aims to curb the spread of misinformation online by classifying new stories as true or fake.
Bandwidth
This presentation introduces bandwidth and its importance. Bandwidth is defined as the amount of data that can be transferred from one point to another within a network in a specific amount of time, typically measured in bits per second. While bandwidth and speed are often used interchangeably, bandwidth refers to the capacity for data transmission at a given speed. The presentation discusses how bandwidth has increased access to the internet over time, its importance for downloading content quickly, and how both residential and commercial bandwidth are typically measured in megabits per second or gigabits per second.
Real life application of discrete math
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. It is necessary for computer science as computers run on binary code and discrete math is used to understand properties of objects used in software, data science, security and finance. Discrete math is also used in real life applications like determining optimal routes in Google Maps and for railway planning and scheduling.
Act
The agenda document outlines the structure and content of a presentation, including an introduction, topic one, a chart, table, names of team members, and a timeline. It also lists additional content and concludes with a summary section.
Bin packing
The document discusses algorithms for solving bin packing problems. It introduces bin packing as arranging items of different volumes into a finite number of bins to minimize the number of bins used. It then describes four key aspects: lower bounds, first-fit, first-fit decreasing, and full-bin packing. First-fit simply places items in the first bin they fit in. First-fit decreasing first sorts items by decreasing size, tending to produce better solutions. Full-bin packing aims to fully pack each bin, though it may be complex. The document provides overviews of each approach and notes first-fit decreasing generally performs better than first-fit, though not always optimally, in less time than full-bin packing.
Encapsulation
Encapsulation is one of the four fundamental object-oriented programming concepts along with inheritance, polymorphism, and abstraction. It involves wrapping code and data together into a single unit. Encapsulation hides internal implementation details of a class and protects it from accidental changes, while allowing the class to control how its data is accessed and stored. This makes the code easier to maintain and visualize.
Covid 19
The presentation discusses COVID-19 vaccines. It introduces coronaviruses and how they can cause respiratory illnesses in humans and animals. It then defines COVID-19 vaccines as vaccines aimed at providing immunity against SARS-CoV-2, the virus that causes COVID-19. The main vaccines discussed are Covishield, Sputnik V, Sinopharm, Pfizer-BioNTech, Sinovac, and Moderna. Brief descriptions of each vaccine's origins and technologies are provided.
Ai 8 puzzle problem
The document discusses the 8-puzzle problem and the A* algorithm. The 8-puzzle problem involves a 3x3 grid with 8 numbered tiles and 1 blank space that can be moved. The A* algorithm maintains a tree of paths from the initial to final state, extending the paths one step at a time until the final state is reached. It is complete and optimal but depends on the accuracy of the heuristic used to estimate costs.
Sql injection in cybersecurity
SQL injection is a code injection technique that attacks data-driven applications. It involves inserting malicious SQL statements into entry fields that are then executed by the database. There are different types of SQL injection attacks, including directly injecting code to immediately execute or injecting into persistent storage to be triggered later. Injection can occur through user input, cookies, or server variables. Prevention techniques aim to stop these types of attacks from harming databases.
More from Sanad Bhowmik (17)
Learning outcomes of system analysis and design and.pptx
Learning outcomes of system analysis and design and.pptx
Impact and Solutions of unemployment in the present of Bangladesh
Impact and Solutions of unemployment in the present of Bangladesh
Recently uploaded
Literature Review Basics and Understanding Reference Management.pptx
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building
Computational Engineering IITH Presentation
This Presentation will give you a brief idea about what Computational Engineering at IIT Hyderabad has to offer.
ACEP Magazine edition 4th launched on 05.06.2024
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Modelagem de um CSTR com reação endotermica.pdf
Modelagem em função de transferencia. CSTR não-linear.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, SerbiaOptimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
For International shipping and maritime laws all wood must contain the ISPM 15 Stamp. Here is how and why.
22CYT12-Unit-V-E Waste and its Management.ppt
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology towards Sustainable Steelmaking
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
Casting-Defect-inSlab continuous casting.pdf
Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting. Casting-Defect-inSlab continuous casting
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
原版一模一样【微信：741003700 】【美国密歇根州立大学毕业证学位证书】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
Advanced control scheme of doubly fed induction generator for wind turbine us...
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Recently uploaded (20)
Literature Review Basics and Understanding Reference Management.pptx
Literature Review Basics and Understanding Reference Management.pptx
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
ML Based Model for NIDS MSc Updated Presentation.v2.pptx
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Engineering Drawings Lecture Detail Drawings 2014.pdf
Engineering Drawings Lecture Detail Drawings 2014.pdf
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
ISPM 15 Heat Treated Wood Stamps and why your shipping must have one
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
Iron and Steel Technology Roadmap - Towards more sustainable steelmaking.pdf
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
Manufacturing Process of molasses based distillery ppt.pptx
Manufacturing Process of molasses based distillery ppt.pptx
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
Round Robin Algorithm.pptx
- 1. Round Robin Algorithm NAME: SANAD BHOWMIK ID:193-15-2952 SECTION: PC-A
- 2. What is Round Robin Algorithm? Round Robin scheduling algorithm is mainly designed for time-sharing systems. This algorithm is similar to FCFS scheduling, but in Round Robin(RR) scheduling, preemption is added which enables the system to switch between processes.
- 3. Characteristics of Round Robin Scheduling • A preemptive scheduling algorithm. • CPU shifts to the next process after a fixed time interval known as time quantum or time-slice. • Preempted processes are added to the end of the queue. • A hybrid and clock-driven model. • Time slice is usually the minimum but differs from OS to OS. • A real time algorithm that responds to an event within a specific time limit. • Oldest, fairest, and easiest algorithm. • Widely used in traditional OS.
- 4. Example of round robin algorithm
- 11. Advantage of Round-robin Scheduling •It doesn’t face the issues of starvation or convoy effect. •All the jobs get a fair allocation of CPU. •It deals with all process without any priority •If you know the total number of processes on the run queue, then you can also assume the worst-case response time for the same process. •This scheduling method does not depend upon burst time. That’s why it is easily implementable on the system. •Once a process is executed for a specific set of the period, the process is preempted, and another process executes for that given time period. •Allows OS to use the Context switching method to save states of preempted processes. •It gives the best performance in terms of average response time.
- 12. Disadvantages of Round-robin Scheduling •If slicing time of OS is low, the processor output will be reduced. •This method spends more time on context switching •Its performance heavily depends on time quantum. •Priorities cannot be set for the processes. •Round-robin scheduling doesn’t give special priority to more important tasks. •Decreases comprehension •Lower time quantum results in higher the context switching overhead in the system. •Finding a correct time quantum is a quite difficult task in this system.
- 13. Worst Case Latency •dt = Denote detection time when a task is brought into the list •st = Denote switching time from one task to another •et = Denote task execution time
- 14. Thank you
Editor's Notes
- (These don’t have designer IDs since they were based off the default master slides already in the deck.