Senthilkanth,MCA..
The following ppt's full topic covers Operating System for BSc CS, BCA, MSc CS, MCA students..
1.Introduction
2.OS Structures
3.Process
4.Threads
5.CPU Scheduling
6.Process Synchronization
7.Dead Locks
8.Memory Management
9.Virtual Memory
10.File system Interface
11.File system implementation
12.Mass Storage System
13.IO Systems
14.Protection
15.Security
16.Distributed System Structure
17.Distributed File System
18.Distributed Co Ordination
19.Real Time System
20.Multimedia Systems
21.Linux
22.Windows
This document provides an overview of CPU scheduling concepts and algorithms. It discusses the goals of CPU scheduling including maximizing CPU utilization and minimizing response time. Common single-processor scheduling algorithms like FCFS, SJF, priority, and round robin are described. The document also introduces the concept of multi-level queue scheduling to handle different process types and priorities.
cpu scheduling bassically tell us about the outer structure or the managemnet of the computer tha how it is done ,it bassically tell us about how our cpu is scheduled.
This document discusses various CPU scheduling algorithms and concepts. It covers scheduling criteria like CPU utilization and turnaround time. Algorithms discussed include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers multiple processor scheduling, real-time scheduling, and evaluating scheduling algorithms.
CPU Scheduling is the process through which we can find the best way to check the shortest and fastest working. Different Algorithms are explained here in this chapter. First-come-first-servers, Shortest Job First, Shortest remaining time first,
Round Robin, Priority Scheduler.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time, and response time. Ready queues can be partitioned into multiple levels with different scheduling policies to implement multilevel queue and feedback queue scheduling.
The document discusses various concepts related to CPU scheduling in operating systems, including:
1) CPU scheduling aims to maximize CPU utilization by allowing other processes to run when one process is waiting for I/O. Short-term schedulers select ready processes from memory to run on the CPU.
2) Scheduling can be preemptive or nonpreemptive depending on when context switches occur. Dispatchers are responsible for context switches between processes.
3) Common scheduling criteria include CPU utilization, throughput, turnaround time, waiting time, and response time.
4) Scheduling algorithms like FCFS, SJF, priority, round robin, and multilevel queue scheduling aim to optimize
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.
This Presention contains Cpu scheduling algorithms,Scheduling Criteria,process sychroization,mutilevel feed back que,critical section problem anad semaphores,Synchoroniztion hardware
This document provides an overview of CPU scheduling concepts and algorithms. It discusses the goals of CPU scheduling including maximizing CPU utilization and minimizing response time. Common single-processor scheduling algorithms like FCFS, SJF, priority, and round robin are described. The document also introduces the concept of multi-level queue scheduling to handle different process types and priorities.
cpu scheduling bassically tell us about the outer structure or the managemnet of the computer tha how it is done ,it bassically tell us about how our cpu is scheduled.
This document discusses various CPU scheduling algorithms and concepts. It covers scheduling criteria like CPU utilization and turnaround time. Algorithms discussed include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers multiple processor scheduling, real-time scheduling, and evaluating scheduling algorithms.
CPU Scheduling is the process through which we can find the best way to check the shortest and fastest working. Different Algorithms are explained here in this chapter. First-come-first-servers, Shortest Job First, Shortest remaining time first,
Round Robin, Priority Scheduler.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time, and response time. Ready queues can be partitioned into multiple levels with different scheduling policies to implement multilevel queue and feedback queue scheduling.
The document discusses various concepts related to CPU scheduling in operating systems, including:
1) CPU scheduling aims to maximize CPU utilization by allowing other processes to run when one process is waiting for I/O. Short-term schedulers select ready processes from memory to run on the CPU.
2) Scheduling can be preemptive or nonpreemptive depending on when context switches occur. Dispatchers are responsible for context switches between processes.
3) Common scheduling criteria include CPU utilization, throughput, turnaround time, waiting time, and response time.
4) Scheduling algorithms like FCFS, SJF, priority, round robin, and multilevel queue scheduling aim to optimize
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.
This Presention contains Cpu scheduling algorithms,Scheduling Criteria,process sychroization,mutilevel feed back que,critical section problem anad semaphores,Synchoroniztion hardware
The document discusses CPU scheduling algorithms in operating systems. It covers basic scheduling concepts, criteria for evaluating algorithms, and examples of common algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, real-time scheduling, thread scheduling, and scheduling on multiprocessor and multicore systems.
This document summarizes a chapter on CPU scheduling from a textbook. It discusses key concepts in CPU scheduling like scheduling criteria, algorithms, and evaluation methods. The major scheduling algorithms covered are first-come, first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, and real-time scheduling.
This document discusses various concepts related to CPU scheduling. It begins with definitions of scheduling and explains that the CPU requires a mechanism to allocate time to different processes in a fair manner. It then covers key scheduling concepts like scheduling levels (high, intermediate, low), types (preemptive vs non-preemptive), objectives, and algorithms like FCFS, SJF, priority scheduling, and round robin. The document provides examples and comparisons of different scheduling techniques.
The document discusses various CPU scheduling algorithms used in operating systems. It describes the main objective of CPU scheduling as maximizing CPU utilization by allowing multiple processes to share the CPU. It then explains different scheduling criteria like throughput, turnaround time, waiting time and response time. Finally, it summarizes common scheduling algorithms like first come first served, shortest job first, priority scheduling and round robin scheduling.
This document discusses various CPU scheduling algorithms such as FCFS, SJF, priority scheduling, and round robin. It covers the basic concepts of scheduling, criteria for evaluating algorithms, examples of single processor and multiprocessor scheduling, and examples of scheduling in operating systems like Windows and Mac OS. The goal of scheduling is to allocate CPU time effectively among competing processes or threads.
The document discusses various CPU scheduling concepts and algorithms. It covers basic concepts like CPU-I/O burst cycles and scheduling criteria. It then describes common scheduling algorithms like first come first served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multi-level queue scheduling, multi-processor scheduling, and thread scheduling in Linux.
The document discusses operating system concepts including CPU scheduling, process states, and scheduling algorithms. It covers historical perspectives on CPU scheduling and bursts, preemptive vs. nonpreemptive scheduling, and scheduling criteria. Common scheduling algorithms like first-come, first-served (FCFS), shortest-job-first (SJF), priority, and round robin are described. The roles of long-term and short-term schedulers are defined.
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.
Here are the key steps in Preemptive SJF scheduling:
1. Jobs A, B, C, D arrive in that order with the given burst times
2. Job B has the shortest burst time of 4 so it runs first
3. Job A preempts B after B completes its 4 unit burst
4. Job D has the next shortest burst of 5 so it runs
5. Job C has the next shortest burst of 9 so it runs
6. Job A completes after running a total of 7 + 7 = 14 units
The average wait time is (9 + 0 + 15 + 2) / 4 = 6.5
This example shows how preemptive S
This document discusses various concepts and algorithms related to process scheduling. It covers basic concepts like CPU bursts and scheduling criteria. It then describes several common scheduling algorithms like FCFS, SJF, priority scheduling, and round robin. It also discusses more advanced topics like multiple processor scheduling, thread scheduling, and load balancing.
This document discusses various CPU scheduling algorithms and concepts. It covers scheduling criteria like CPU utilization and turnaround time. Algorithms discussed include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers multiple processor scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes key concepts from Chapter 3 of the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. It discusses processes including the process concept, scheduling, creation and termination. It describes how processes communicate through interprocess communication using either shared memory or message passing. Examples of process communication in client-server systems and specific IPC systems like POSIX shared memory are also provided.
CPU scheduling decides which processes run when multiple are ready. It aims to make the system efficient, fast and fair. There are different scheduling algorithms like first come first serve (FCFS), shortest job first (SJF), priority scheduling, and round robin. Multi-level feedback queue scheduling uses multiple queues and allows processes to move between queues based on their CPU usage to prioritize shorter interactive processes.
The document discusses different scheduling algorithms used by operating systems. It begins by explaining that the scheduler decides which process to activate from the ready queue when multiple processes are runnable. There are long-term, medium-term, and short-term schedulers that control admission of jobs, memory allocation, and CPU sharing respectively. The goal of scheduling is to optimize system performance and resource utilization while providing responsive service. Common algorithms include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round-robin. FCFS schedules processes in the order of arrival while SJF selects the shortest job first. Priority scheduling preempts lower priority jobs.
This document discusses CPU scheduling in operating systems. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). Evaluation criteria for scheduling algorithms like CPU utilization, throughput, turnaround time, and waiting time are also presented. Multilevel queue and multilevel feedback queue scheduling are discussed as ways to improve performance.
Task scheduling is needed to maintain every process that comes with a processor in parallel processing. In several conditions, not every algorithm works better on the significant problem. Sometimes FCFS algorithm is better than the other in short burst time while Round Robin is better for multiple processes in every single time. But we cannot predict what process will come after. Average Waiting Time is a standard measure for giving credit to the scheduling algorithm. Several techniques have been applied to maintain the process in order to make the CPU performance in normal. The objective of this paper is to compare three algorithms, FCFS, SJF and Round Robin. Finally, we know which algorithm is more suitable for the certain process.
The document discusses various scheduling algorithms: First Come First Served (FCFS), Shortest Job First (SJF), priority scheduling, and round robin (RR). FCFS schedules processes in the order that they arrive. SJF selects the process with the shortest estimated runtime. Priority scheduling prioritizes processes based on assigned priorities. Round robin gives each process a time slice or quantum to use the CPU before switching to another process. Examples are provided to illustrate how each algorithm works.
This document discusses process scheduling in operating systems. It describes the functions of an operating system including process scheduling, memory management, and file management. The objectives of process scheduling are to maximize throughput and response times while minimizing overhead. Scheduling policies use techniques like preemption and time slicing to achieve these goals. The document outlines non-preemptive policies like FCFS and preemptive policies like round robin. It also discusses scheduling concepts such as CPU utilization, throughput, turnaround time, and waiting time.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts" related to CPU scheduling. It discusses basic scheduling concepts like multiprogramming and the CPU-I/O burst cycle. It then covers various scheduling algorithms like first-come first-served, shortest-job-first, priority scheduling, and round robin. The document also discusses optimization criteria, techniques for estimating future CPU bursts, multilevel queue scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes Chapter 5 from the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. The chapter introduces CPU scheduling algorithms which are important for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization and waiting time. Specific algorithms covered include first-come first-served scheduling, shortest-job-first scheduling, priority scheduling, and round robin scheduling. Advanced scheduling techniques involving multiple queues and multiple processors are also discussed.
The document discusses CPU scheduling algorithms in operating systems. It covers basic scheduling concepts, criteria for evaluating algorithms, and examples of common algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, real-time scheduling, thread scheduling, and scheduling on multiprocessor and multicore systems.
This document summarizes a chapter on CPU scheduling from a textbook. It discusses key concepts in CPU scheduling like scheduling criteria, algorithms, and evaluation methods. The major scheduling algorithms covered are first-come, first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multilevel queue scheduling, multilevel feedback queues, multiple processor scheduling, and real-time scheduling.
This document discusses various concepts related to CPU scheduling. It begins with definitions of scheduling and explains that the CPU requires a mechanism to allocate time to different processes in a fair manner. It then covers key scheduling concepts like scheduling levels (high, intermediate, low), types (preemptive vs non-preemptive), objectives, and algorithms like FCFS, SJF, priority scheduling, and round robin. The document provides examples and comparisons of different scheduling techniques.
The document discusses various CPU scheduling algorithms used in operating systems. It describes the main objective of CPU scheduling as maximizing CPU utilization by allowing multiple processes to share the CPU. It then explains different scheduling criteria like throughput, turnaround time, waiting time and response time. Finally, it summarizes common scheduling algorithms like first come first served, shortest job first, priority scheduling and round robin scheduling.
This document discusses various CPU scheduling algorithms such as FCFS, SJF, priority scheduling, and round robin. It covers the basic concepts of scheduling, criteria for evaluating algorithms, examples of single processor and multiprocessor scheduling, and examples of scheduling in operating systems like Windows and Mac OS. The goal of scheduling is to allocate CPU time effectively among competing processes or threads.
The document discusses various CPU scheduling concepts and algorithms. It covers basic concepts like CPU-I/O burst cycles and scheduling criteria. It then describes common scheduling algorithms like first come first served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also discusses more advanced topics like multi-level queue scheduling, multi-processor scheduling, and thread scheduling in Linux.
The document discusses operating system concepts including CPU scheduling, process states, and scheduling algorithms. It covers historical perspectives on CPU scheduling and bursts, preemptive vs. nonpreemptive scheduling, and scheduling criteria. Common scheduling algorithms like first-come, first-served (FCFS), shortest-job-first (SJF), priority, and round robin are described. The roles of long-term and short-term schedulers are defined.
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.
Here are the key steps in Preemptive SJF scheduling:
1. Jobs A, B, C, D arrive in that order with the given burst times
2. Job B has the shortest burst time of 4 so it runs first
3. Job A preempts B after B completes its 4 unit burst
4. Job D has the next shortest burst of 5 so it runs
5. Job C has the next shortest burst of 9 so it runs
6. Job A completes after running a total of 7 + 7 = 14 units
The average wait time is (9 + 0 + 15 + 2) / 4 = 6.5
This example shows how preemptive S
This document discusses various concepts and algorithms related to process scheduling. It covers basic concepts like CPU bursts and scheduling criteria. It then describes several common scheduling algorithms like FCFS, SJF, priority scheduling, and round robin. It also discusses more advanced topics like multiple processor scheduling, thread scheduling, and load balancing.
This document discusses various CPU scheduling algorithms and concepts. It covers scheduling criteria like CPU utilization and turnaround time. Algorithms discussed include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers multiple processor scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes key concepts from Chapter 3 of the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. It discusses processes including the process concept, scheduling, creation and termination. It describes how processes communicate through interprocess communication using either shared memory or message passing. Examples of process communication in client-server systems and specific IPC systems like POSIX shared memory are also provided.
CPU scheduling decides which processes run when multiple are ready. It aims to make the system efficient, fast and fair. There are different scheduling algorithms like first come first serve (FCFS), shortest job first (SJF), priority scheduling, and round robin. Multi-level feedback queue scheduling uses multiple queues and allows processes to move between queues based on their CPU usage to prioritize shorter interactive processes.
The document discusses different scheduling algorithms used by operating systems. It begins by explaining that the scheduler decides which process to activate from the ready queue when multiple processes are runnable. There are long-term, medium-term, and short-term schedulers that control admission of jobs, memory allocation, and CPU sharing respectively. The goal of scheduling is to optimize system performance and resource utilization while providing responsive service. Common algorithms include first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round-robin. FCFS schedules processes in the order of arrival while SJF selects the shortest job first. Priority scheduling preempts lower priority jobs.
This document discusses CPU scheduling in operating systems. It introduces CPU scheduling as the basis for multiprogrammed operating systems. Various scheduling algorithms are described such as first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). Evaluation criteria for scheduling algorithms like CPU utilization, throughput, turnaround time, and waiting time are also presented. Multilevel queue and multilevel feedback queue scheduling are discussed as ways to improve performance.
Task scheduling is needed to maintain every process that comes with a processor in parallel processing. In several conditions, not every algorithm works better on the significant problem. Sometimes FCFS algorithm is better than the other in short burst time while Round Robin is better for multiple processes in every single time. But we cannot predict what process will come after. Average Waiting Time is a standard measure for giving credit to the scheduling algorithm. Several techniques have been applied to maintain the process in order to make the CPU performance in normal. The objective of this paper is to compare three algorithms, FCFS, SJF and Round Robin. Finally, we know which algorithm is more suitable for the certain process.
The document discusses various scheduling algorithms: First Come First Served (FCFS), Shortest Job First (SJF), priority scheduling, and round robin (RR). FCFS schedules processes in the order that they arrive. SJF selects the process with the shortest estimated runtime. Priority scheduling prioritizes processes based on assigned priorities. Round robin gives each process a time slice or quantum to use the CPU before switching to another process. Examples are provided to illustrate how each algorithm works.
This document discusses process scheduling in operating systems. It describes the functions of an operating system including process scheduling, memory management, and file management. The objectives of process scheduling are to maximize throughput and response times while minimizing overhead. Scheduling policies use techniques like preemption and time slicing to achieve these goals. The document outlines non-preemptive policies like FCFS and preemptive policies like round robin. It also discusses scheduling concepts such as CPU utilization, throughput, turnaround time, and waiting time.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts" related to CPU scheduling. It discusses basic scheduling concepts like multiprogramming and the CPU-I/O burst cycle. It then covers various scheduling algorithms like first-come first-served, shortest-job-first, priority scheduling, and round robin. The document also discusses optimization criteria, techniques for estimating future CPU bursts, multilevel queue scheduling, real-time scheduling, and evaluating scheduling algorithms.
This document summarizes Chapter 5 from the textbook "Operating System Concepts - 8th Edition" by Silberschatz, Galvin and Gagne. The chapter introduces CPU scheduling algorithms which are important for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization and waiting time. Specific algorithms covered include first-come first-served scheduling, shortest-job-first scheduling, priority scheduling, and round robin scheduling. Advanced scheduling techniques involving multiple queues and multiple processors are also discussed.
operating system
basic concept of c p u scheduling
scheduling critaria
scheduling algorithms
multi processor scheduling
real time scheduling
Thread scheduling
operating system Example
Java thread scheduling
Algorithms Evolution
This document discusses CPU scheduling in operating systems. It covers basic scheduling concepts like processes alternating between CPU and I/O bursts. It then discusses scheduling criteria like response time and algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced topics like multilevel queue scheduling, multiple processor scheduling, and real-time scheduling. Evaluation methods for scheduling algorithms like simulation and queueing models are also mentioned.
This document discusses CPU scheduling algorithms in operating systems. It begins with an outline of the chapter topics, including basic concepts, scheduling criteria, algorithms like first-come first-served (FCFS), shortest job first (SJF), and round robin (RR). It then examines these algorithms in more detail through examples, discussing how to estimate process burst times, preemptive vs non-preemptive approaches, and optimization criteria like wait time. Real-time scheduling and examples from Windows, Linux and Solaris are also mentioned.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, and waiting time. It also describes techniques like multilevel feedback queues that allow processes to move between queues with different scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the 9th edition of Operating System Concepts by Silberschatz, Galvin and Gagne, which covers CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It then explains common scheduling algorithms like first-come first-served, shortest job first, priority scheduling and round robin. It also discusses thread scheduling, multilevel queues, and multilevel feedback queues. The objectives are to introduce CPU scheduling, describe various algorithms, and discuss criteria for selecting algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling algorithms such as first-come first-served, shortest job first, priority scheduling, and round robin. It covers scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It also describes techniques like predicting next CPU burst times, aging priorities to prevent starvation, and using multilevel queues and feedback queues.
Various CPU Scheduling Algorithms in OS.ppttaricvilla
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It covers CPU scheduling, which is the basis for multiprogrammed operating systems. Various scheduling algorithms like FCFS, SJF, priority scheduling and round robin are described. Evaluation criteria for selecting scheduling algorithms like CPU utilization, throughput, turnaround time and waiting time are discussed.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in real systems and provides examples of scheduling algorithms.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts - 9th Edition" by Silberschatz, Galvin and Gagne. It discusses CPU scheduling, which is the basis for multiprogrammed operating systems. Various CPU scheduling algorithms are described such as first-come first-served, shortest job first, priority scheduling and round robin. Evaluation criteria for selecting a scheduling algorithm like CPU utilization, throughput, turnaround time and waiting time are also covered. The chapter examines scheduling in multi-processor and real-time systems as well as thread scheduling approaches.
Operating System - CPU Scheduling IntroductionJimmyWilson26
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts - 8th Edition" regarding CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes various scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). It also covers scheduling criteria for optimization and examples of applying the different algorithms.
The document summarizes key concepts from Chapter 6 of Operating System Concepts - 9th Edition about CPU scheduling. It discusses the goals of CPU scheduling, including maximizing CPU utilization and throughput. It describes common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin. It also covers more advanced techniques such as multilevel queue scheduling and multilevel feedback queue scheduling. Evaluation methods like deterministic modeling are presented to analyze and compare the performance of different scheduling algorithms.
This document discusses CPU scheduling in operating systems. It begins by introducing CPU scheduling and describing the goals of scheduling algorithms. It then explains common scheduling algorithms like first-come first-served (FCFS), shortest job first (SJF), priority scheduling, and round robin (RR). The document also covers multilevel queue scheduling, thread scheduling, multiple processor scheduling, and real-time CPU scheduling.
This document summarizes key concepts from Chapter 5 of the textbook "Operating System Concepts Essentials". It discusses CPU scheduling, which selects processes to run on the CPU. Various scheduling algorithms are described, including first-come first-served, shortest job first, priority scheduling, and round robin. Criteria for evaluating scheduling algorithms include CPU utilization, throughput, turnaround time, waiting time and response time. Multilevel queue and feedback queue approaches are also summarized.
This document summarizes key concepts from Chapter 6 of the textbook "Operating System Concepts Essentials" on CPU scheduling. It introduces CPU scheduling as the basis for multiprogrammed operating systems. It describes scheduling criteria like CPU utilization, throughput, turnaround time and waiting time. It then explains common scheduling algorithms like First-Come First-Served, Shortest Job First, Priority Scheduling and Round Robin. It also covers advanced scheduling techniques such as multilevel queues and multilevel feedback queues.
This document summarizes key concepts related to CPU scheduling from Chapter 6 of the textbook "Operating System Concepts Essentials – 2nd Edition". It covers basic CPU scheduling concepts, different scheduling algorithms like FCFS, SJF, priority scheduling and round robin. It also discusses scheduling criteria, thread scheduling, multilevel queues, and the pthread scheduling API. The goal is to introduce CPU scheduling techniques used in modern operating systems.
Wireless Communication and Networking by WilliamStallings Chap2Senthil Kanth
Hai I'm Senthilkanth, doing MCA in Mepco Schlenk Engineering College..
The following presentation covers topic called Wireless Communication and Networking
by WilliamStallings for BSc CS, BCA, MSc CS, MCA, ME students.Make use of it.
Wireless Communication and Networking
by WilliamStallings Chapter : 2Transmission Fundamentals
Chapter 2
Electromagnetic Signal
Function of time
Can also be expressed as a function of frequency
Signal consists of components of different frequencies
Time-Domain Concepts
Analog signal - signal intensity varies in a smooth fashion over time
No breaks or discontinuities in the signal
Digital signal - signal intensity maintains a constant level for some period of time and then changes to another constant level
Periodic signal - analog or digital signal pattern that repeats over time
s(t +T ) = s(t ) -¥< t < +¥
where T is the period of the signal
Time-Domain Concepts
Aperiodic signal - analog or digital signal pattern that doesn't repeat over time
Peak amplitude (A) - maximum value or strength of the signal over time; typically measured in volts
Frequency (f )
Rate, in cycles per second, or Hertz (Hz) at which the signal repeats
Time-Domain Concepts
Period (T ) - amount of time it takes for one repetition of the signal
T = 1/f
Phase () - measure of the relative position in time within a single period of a signal
Wavelength () - distance occupied by a single cycle of the signal
Or, the distance between two points of corresponding phase of two consecutive cycles
Sine Wave Parameters
General sine wave
s(t ) = A sin(2ft + )
Figure 2.3 shows the effect of varying each of the three parameters
(a) A = 1, f = 1 Hz, = 0; thus T = 1s
(b) Reduced peak amplitude; A=0.5
(c) Increased frequency; f = 2, thus T = ½
(d) Phase shift; = /4 radians (45 degrees)
note: 2 radians = 360° = 1 period
Sine Wave Parameters
Time vs. Distance
When the horizontal axis is time, as in Figure 2.3, graphs display the value of a signal at a given point in space as a function of time
With the horizontal axis in space, graphs display the value of a signal at a given point in time as a function of distance
At a particular instant of time, the intensity of the signal varies as a function of distance from the source
Frequency-Domain Concepts
Fundamental frequency - when all frequency components of a signal are integer multiples of one frequency, it’s referred to as the fundamental frequency
Spectrum - range of frequencies that a signal contains
Absolute bandwidth - width of the spectrum of a signal
Effective bandwidth (or just bandwidth) - narrow band of frequencies that most of the signal’s energy is contained in
Frequency-Domain Concepts
Any electromagnetic signal can be shown to consist of a collection of periodic analog signals (sine waves) at different amplitudes, frequencies, and phases
The period of the total signal is equal to the period of the fundamenta
wireless communication and networking Chapter 1Senthil Kanth
wireless communication and networking by WilliamStallings
Hai I'm Senthilkanth, doing MCA in Mepco Schlenk Engineering College..
The following presentation covers topic called Wireless Communication and Networking
by WilliamStallings for BSc CS, BCA, MSc CS, MCA, ME students.Make use of it.
This presentation agenda like,,
Introduction
Chapter 1: Wireless Comes of Age
Chapter 2: Transmission Fundamentals
Chapter 3: Communication Networks
Chapter 4: Protocols and the TCP/IP Protocol Suite
Chapter 5: Antennas and Propagation
Chapter 6: Signal Encoding Techniques
Chapter 7: Spread Spectrum
Chapter 8: Coding and Error Control
Chapter 9: Satellite Communications
Chapter 10: Cellular Wireless Networks
Chapter 11: Cordless Systems and Wireless Local Loop
Chapter 12: Mobile IP and Wireless Access Protocol
Chapter 13: Wireless LAN Technology
Chapter 14: IEEE 802.11 Wireless LAN Standard
Chapter 15: Bluetooth
Hai I'm Senthilkanth, doing MCA in Mepco Schlenk Engineering College..
The following presentation covers topic called WML for BSc CS, BCA, MSc CS, MCA, ME students.Make use of it. WML Script by Shanti katta.
This presentation agenda like,
This document provides an overview of the Wireless Application Protocol (WAP). It describes WAP as an open standard that allows mobile devices to access internet content and services. The summary includes:
1) WAP defines an architecture and protocol for delivering internet content to mobile phones and other wireless devices in an optimized way.
2) The WAP architecture includes components like WAP clients, WAP gateways, WAP proxies, and WAP servers that work together to deliver internet content to mobile devices.
3) WAP uses protocols like WTP, WSP, WTLS and WDP to optimize delivery of content over wireless networks in an efficient, secure manner for devices with limited capabilities.
Presentation on WAP Keerti Sharma
This ppt contains the topic like,,
What is WAP ?
Limitations of Internet for wireless applications
WAP Architecture / protocol stack
WAP Components / WML
WAP brings Internet to hand-held devices
Conclusion
Introduction to Mobile Application DevelopmentSenthil Kanth
Introduction to Mobile Application Development
This ppt contains the topic like,,
WAP Network Structure,
The WAP Gateway plays an important role,
WAP Programming Model,
WML Example,
Java Platform,
Java 2 Platform,
Virtual Machines and horizontal and vertical APIs specified in configurations and Profiles,
Configurations
Introduction to wireless application protocol (wap)ogiSenthil Kanth
Introduction to wireless application protocol (wap)ogi Presented by
Dragomanov Andon
Paunovski Ognen
This ppt contains the topic like,,
What is WAP?
Development and Objectives
WAP Concept
WAP 1.0 Architecture
WAP 2.0 Architecture
WAP 2.0 Features
WML
Real Life Examples
XML Programming WML by Dickson K.W. Chiu PhD, SMIEEESenthil Kanth
This document provides an overview of the Wireless Application Protocol (WAP) and the Wireless Markup Language (WML). It discusses key aspects of WAP including WML, cards, decks, fonts, links, inputs, selects, refresh, timers, variables, and posting data to servers. It also demonstrates generating WML using XSLT and provides links to WAP emulators.
Wireless Application Protocol WAP by AlvinenSenthil Kanth
This document provides an overview of the Wireless Application Protocol (WAP). It describes the need for a common wireless protocol to allow for global access to the internet from mobile devices. WAP provides an open standard for a wireless protocol stack that includes components like WML for content, WSP and WTP for transport, and support for various wireless networks. It aims to make internet applications and content accessible from mobile phones and other wireless devices.
This document provides advice and suggestions for answering common interview questions. It discusses 50 different questions that an interviewer may ask, such as "Tell me about yourself", "Why did you leave your last job?", and "What are your greatest strengths?". For each question, the document offers guidance on how to provide a positive, work-focused response that highlights your relevant skills and experience without saying anything negative about previous employers or colleagues. The overall message is that interviewees should be prepared with examples and stories, keep their answers brief and focused on contributions they can make to the organization.
This document provides sample answers to common interview questions for senior executive roles. It discusses strategies for the initial 60 days, approaches to improving products and companies, dealing with being overqualified, handling problems with peers, gaps in work history, previous bosses, dislikes about past jobs, challenges to decisions, desired changes to past roles, commitment length, salary cuts, expected salary, and career growth. The answers focus on understanding new roles, providing fresh perspectives, learning from others, personal growth, openness to challenges, and prioritizing development over money.
The document describes a stock market application created using CORBA. It defines stock interfaces and data types in an IDL file. It implements the server using a POA and registers it with the naming service. The client connects to the server object, allows registration of companies and customers, and has options to buy/sell shares or view details. The code provides an example of building a distributed stock trading application using CORBA.
The document describes the RSA encryption algorithm. It explains that RSA uses a public/private key pair to encrypt and decrypt data. The public key is used to encrypt data, while the private key is kept secret and used to decrypt data. The document provides details on how to generate the key pair, perform encryption and decryption with RSA, and includes an example of implementing RSA encryption in a C# Windows application.
Routing protocols for mobile ad-hoc networks have to
face the challenge of frequently changing topology, low
transmission power and asymmetric links. Both
proactive and reactive routing protocols prove to be
inefficient under these circumstances. The Zone Routing
Protocol (ZRP) combines the advantages of the proactive
and reactive approaches by maintaining an up-to-date
topological map of a zone centered on each node. Within
the zone, routes are immediately available. For
destinations outside the zone, ZRP employs a route
discovery procedure, which can benefit from the local
routing information of the zones.
On-Demand Multicast Routing Protocol.
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (On-Demand Multicast Routing Protocol), is a mesh-based, rather than a conventional tree- based, multicast scheme and uses a forwarding group concept (only a sub- set of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP’s scalability and performance via simulation.
Routing Protocols for Ad-Hoc Networks. This is a book for Ad-hoc On-Demand Distance Vector Routing
&
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. November 2011,
Authors : Giorgos Papadakis & Manolis Surligas
DSDV is a proactive routing protocol that uses periodic routing table exchanges and sequence numbers to avoid loops. AODV is a reactive protocol based on DSDV that uses on-demand route discovery with broadcast RREQ and unicast RREP messages to find routes, and maintains routing tables at nodes instead of in packet headers like DSR. Both protocols aim to quickly adapt to dynamic links with low overhead.
Senthilkanth,MCA..
The following ppt's full topic covers Operating System for BSc CS, BCA, MSc CS, MCA students..
1.Introduction
2.OS Structures
3.Process
4.Threads
5.CPU Scheduling
6.Process Synchronization
7.Dead Locks
8.Memory Management
9.Virtual Memory
10.File system Interface
11.File system implementation
12.Mass Storage System
13.IO Systems
14.Protection
15.Security
16.Distributed System Structure
17.Distributed File System
18.Distributed Co Ordination
19.Real Time System
20.Multimedia Systems
21.Linux
22.Windows
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...EduSkills OECD
Andreas Schleicher, Director of Education and Skills at the OECD presents at the launch of PISA 2022 Volume III - Creative Minds, Creative Schools on 18 June 2024.
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
This presentation was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
🔥🔥🔥🔥🔥🔥🔥🔥🔥
إضغ بين إيديكم من أقوى الملازم التي صممتها
ملزمة تشريح الجهاز الهيكلي (نظري 3)
💀💀💀💀💀💀💀💀💀💀
تتميز هذهِ الملزمة بعِدة مُميزات :
1- مُترجمة ترجمة تُناسب جميع المستويات
2- تحتوي على 78 رسم توضيحي لكل كلمة موجودة بالملزمة (لكل كلمة !!!!)
#فهم_ماكو_درخ
3- دقة الكتابة والصور عالية جداً جداً جداً
4- هُنالك بعض المعلومات تم توضيحها بشكل تفصيلي جداً (تُعتبر لدى الطالب أو الطالبة بإنها معلومات مُبهمة ومع ذلك تم توضيح هذهِ المعلومات المُبهمة بشكل تفصيلي جداً
5- الملزمة تشرح نفسها ب نفسها بس تكلك تعال اقراني
6- تحتوي الملزمة في اول سلايد على خارطة تتضمن جميع تفرُعات معلومات الجهاز الهيكلي المذكورة في هذهِ الملزمة
واخيراً هذهِ الملزمة حلالٌ عليكم وإتمنى منكم إن تدعولي بالخير والصحة والعافية فقط
كل التوفيق زملائي وزميلاتي ، زميلكم محمد الذهبي 💊💊
🔥🔥🔥🔥🔥🔥🔥🔥🔥
2. 5.2 Silberschatz, Galvin and GagneOperating System Concepts
Chapter 5: CPU SchedulingChapter 5: CPU Scheduling
Basic Concepts
Scheduling Criteria
Scheduling Algorithms
Multiple-Processor Scheduling
Real-Time Scheduling
Thread Scheduling
Operating Systems Examples
Java Thread Scheduling
Algorithm Evaluation
3. 5.3 Silberschatz, Galvin and GagneOperating System Concepts
Basic ConceptsBasic Concepts
Maximum CPU utilization obtained with multiprogramming
CPU–I/O Burst Cycle – Process execution consists of a cycle of
CPU execution and I/O wait
CPU burst distribution
4. 5.4 Silberschatz, Galvin and GagneOperating System Concepts
Alternating Sequence of CPU And I/OAlternating Sequence of CPU And I/O
BurstsBursts
5. 5.5 Silberschatz, Galvin and GagneOperating System Concepts
Histogram of CPU-burst TimesHistogram of CPU-burst Times
6. 5.6 Silberschatz, Galvin and GagneOperating System Concepts
CPU SchedulerCPU Scheduler
Selects from among the processes in memory that are ready to
execute, and allocates the CPU to one of them
CPU scheduling decisions may take place when a process:
1. Switches from running to waiting state
2. Switches from running to ready state
3. Switches from waiting to ready
4. Terminates
Scheduling under 1 and 4 is nonpreemptive
All other scheduling is preemptive
7. 5.7 Silberschatz, Galvin and GagneOperating System Concepts
DispatcherDispatcher
Dispatcher module gives control of the CPU to the process
selected by the short-term scheduler; this involves:
switching context
switching to user mode
jumping to the proper location in the user program to restart
that program
Dispatch latency – time it takes for the dispatcher to stop one
process and start another running
8. 5.8 Silberschatz, Galvin and GagneOperating System Concepts
Scheduling CriteriaScheduling Criteria
CPU utilization – keep the CPU as busy as possible
Throughput – # of processes that complete their execution
per time unit
Turnaround time – amount of time to execute a particular
process
Waiting time – amount of time a process has been waiting
in the ready queue
Response time – amount of time it takes from when a
request was submitted until the first response is produced,
not output (for time-sharing environment)
9. 5.9 Silberschatz, Galvin and GagneOperating System Concepts
Optimization CriteriaOptimization Criteria
Max CPU utilization
Max throughput
Min turnaround time
Min waiting time
Min response time
10. 5.10 Silberschatz, Galvin and GagneOperating System Concepts
First-Come, First-Served (FCFS)First-Come, First-Served (FCFS)
SchedulingScheduling
Process Burst Time
P1 24
P2 3
P3 3
Suppose that the processes arrive in the order: P1 , P2 , P3
The Gantt Chart for the schedule is:
Waiting time for P1 = 0; P2 = 24; P3 = 27
Average waiting time: (0 + 24 + 27)/3 = 17
P1 P2 P3
24 27 300
11. 5.11 Silberschatz, Galvin and GagneOperating System Concepts
FCFS Scheduling (Cont.)FCFS Scheduling (Cont.)
Suppose that the processes arrive in the order
P2 , P3 , P1
The Gantt chart for the schedule is:
Waiting time for P1 = 6;P2 = 0; P3 = 3
Average waiting time: (6 + 0 + 3)/3 = 3
Much better than previous case
Convoy effect short process behind long process
P1P3P2
63 300
12. 5.12 Silberschatz, Galvin and GagneOperating System Concepts
Shortest-Job-First (SJR) SchedulingShortest-Job-First (SJR) Scheduling
Associate with each process the length of its next CPU burst. Use
these lengths to schedule the process with the shortest time
Two schemes:
nonpreemptive – once CPU given to the process it cannot be
preempted until completes its CPU burst
preemptive – if a new process arrives with CPU burst length
less than remaining time of current executing process, preempt.
This scheme is know as the
Shortest-Remaining-Time-First (SRTF)
SJF is optimal – gives minimum average waiting time for a given
set of processes
13. 5.13 Silberschatz, Galvin and GagneOperating System Concepts
Process Arrival Time Burst Time
P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4
SJF (non-preemptive)
Average waiting time = (0 + 6 + 3 + 7)/4 = 4
Example of Non-Preemptive SJFExample of Non-Preemptive SJF
P1 P3 P2
73 160
P4
8 12
14. 5.14 Silberschatz, Galvin and GagneOperating System Concepts
Example of Preemptive SJFExample of Preemptive SJF
Process Arrival Time Burst Time
P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4
SJF (preemptive)
Average waiting time = (9 + 1 + 0 +2)/4 = 3
P1 P3P2
42 110
P4
5 7
P2 P1
16
15. 5.15 Silberschatz, Galvin and GagneOperating System Concepts
Determining Length of Next CPUDetermining Length of Next CPU
BurstBurst
Can only estimate the length
Can be done by using the length of previous CPU bursts, using
exponential averaging
:Define4.
10,3.
burstCPUnexttheforvaluepredicted2.
burstCPUoflenghtactual1.
1
≤≤
=
=
+
αα
τn
th
n
nt
( ) .11 nnn
t ταατ −+==
16. 5.16 Silberschatz, Galvin and GagneOperating System Concepts
Prediction of the Length of the Next CPUPrediction of the Length of the Next CPU
BurstBurst
17. 5.17 Silberschatz, Galvin and GagneOperating System Concepts
Examples of Exponential AveragingExamples of Exponential Averaging
α =0
τn+1 = τn
Recent history does not count
α =1
τn+1 = α tn
Only the actual last CPU burst counts
If we expand the formula, we get:
τn+1 = α tn+(1 - α)α tn -1 + …
+(1 - α )j
α tn -j + …
+(1 - α )n +1
τ0
Since both α and (1 - α) are less than or equal to 1, each
successive term has less weight than its predecessor
18. 5.18 Silberschatz, Galvin and GagneOperating System Concepts
Priority SchedulingPriority Scheduling
A priority number (integer) is associated with each process
The CPU is allocated to the process with the highest priority
(smallest integer ≡ highest priority)
Preemptive
nonpreemptive
SJF is a priority scheduling where priority is the predicted next CPU
burst time
Problem ≡ Starvation – low priority processes may never execute
Solution ≡ Aging – as time progresses increase the priority of the
process
19. 5.19 Silberschatz, Galvin and GagneOperating System Concepts
Round Robin (RR)Round Robin (RR)
Each process gets a small unit of CPU time (time quantum),
usually 10-100 milliseconds. After this time has elapsed, the
process is preempted and added to the end of the ready queue.
If there are n processes in the ready queue and the time
quantum is q, then each process gets 1/n of the CPU time in
chunks of at most q time units at once. No process waits more
than (n-1)q time units.
Performance
q large ⇒ FIFO
q small ⇒ q must be large with respect to context switch,
otherwise overhead is too high
20. 5.20 Silberschatz, Galvin and GagneOperating System Concepts
Example of RR with Time Quantum =Example of RR with Time Quantum =
2020
Process Burst Time
P1 53
P2 17
P3 68
P4 24
The Gantt chart is:
Typically, higher average turnaround than SJF, but better response
P1 P2 P3 P4 P1 P3 P4 P1 P3 P3
0 20 37 57 77 97 117 121 134 154 162
21. 5.21 Silberschatz, Galvin and GagneOperating System Concepts
Time Quantum and Context SwitchTime Quantum and Context Switch
TimeTime
22. 5.22 Silberschatz, Galvin and GagneOperating System Concepts
Turnaround Time Varies With The TimeTurnaround Time Varies With The Time
QuantumQuantum
23. 5.23 Silberschatz, Galvin and GagneOperating System Concepts
Multilevel QueueMultilevel Queue
Ready queue is partitioned into separate queues:
foreground (interactive)
background (batch)
Each queue has its own scheduling algorithm
foreground – RR
background – FCFS
Scheduling must be done between the queues
Fixed priority scheduling; (i.e., serve all from foreground then
from background). Possibility of starvation.
Time slice – each queue gets a certain amount of CPU time
which it can schedule amongst its processes; i.e., 80% to
foreground in RR
20% to background in FCFS
24. 5.24 Silberschatz, Galvin and GagneOperating System Concepts
Multilevel Queue SchedulingMultilevel Queue Scheduling
25. 5.25 Silberschatz, Galvin and GagneOperating System Concepts
Multilevel Feedback QueueMultilevel Feedback Queue
A process can move between the various queues; aging can be
implemented this way
Multilevel-feedback-queue scheduler defined by the following
parameters:
number of queues
scheduling algorithms for each queue
method used to determine when to upgrade a process
method used to determine when to demote a process
method used to determine which queue a process will enter
when that process needs service
26. 5.26 Silberschatz, Galvin and GagneOperating System Concepts
Example of Multilevel FeedbackExample of Multilevel Feedback
QueueQueue
Three queues:
Q0 – RR with time quantum 8 milliseconds
Q1 – RR time quantum 16 milliseconds
Q2 – FCFS
Scheduling
A new job enters queue Q0 which is served FCFS. When it
gains CPU, job receives 8 milliseconds. If it does not finish in 8
milliseconds, job is moved to queue Q1.
At Q1 job is again served FCFS and receives 16 additional
milliseconds. If it still does not complete, it is preempted and
moved to queue Q2.
27. 5.27 Silberschatz, Galvin and GagneOperating System Concepts
Multilevel Feedback QueuesMultilevel Feedback Queues
28. 5.28 Silberschatz, Galvin and GagneOperating System Concepts
Multiple-Processor SchedulingMultiple-Processor Scheduling
CPU scheduling more complex when multiple CPUs are
available
Homogeneous processors within a multiprocessor
Load sharing
Asymmetric multiprocessing – only one processor
accesses the system data structures, alleviating the need
for data sharing
29. 5.29 Silberschatz, Galvin and GagneOperating System Concepts
Real-Time SchedulingReal-Time Scheduling
Hard real-time systems – required to complete a
critical task within a guaranteed amount of time
Soft real-time computing – requires that critical
processes receive priority over less fortunate ones
30. 5.30 Silberschatz, Galvin and GagneOperating System Concepts
Thread SchedulingThread Scheduling
Local Scheduling – How the threads library decides which
thread to put onto an available LWP
Global Scheduling – How the kernel decides which kernel
thread to run next
31. 5.31 Silberschatz, Galvin and GagneOperating System Concepts
Pthread Scheduling APIPthread Scheduling API
#include <pthread.h>
#include <stdio.h>
#define NUM THREADS 5
int main(int argc, char *argv[])
{
int i;
pthread t tid[NUM THREADS];
pthread attr t attr;
/* get the default attributes */
pthread attr init(&attr);
/* set the scheduling algorithm to PROCESS or SYSTEM */
pthread attr setscope(&attr, PTHREAD SCOPE SYSTEM);
/* set the scheduling policy - FIFO, RT, or OTHER */
pthread attr setschedpolicy(&attr, SCHED OTHER);
/* create the threads */
for (i = 0; i < NUM THREADS; i++)
pthread create(&tid[i],&attr,runner,NULL);
32. 5.32 Silberschatz, Galvin and GagneOperating System Concepts
Pthread Scheduling APIPthread Scheduling API
/* now join on each thread */
for (i = 0; i < NUM THREADS; i++)
pthread join(tid[i], NULL);
}
/* Each thread will begin control in this
function */
void *runner(void *param)
{
printf("I am a threadn");
pthread exit(0);
}
33. 5.33 Silberschatz, Galvin and GagneOperating System Concepts
Operating System ExamplesOperating System Examples
Solaris scheduling
Windows XP scheduling
Linux scheduling
34. 5.34 Silberschatz, Galvin and GagneOperating System Concepts
Solaris 2 SchedulingSolaris 2 Scheduling
35. 5.35 Silberschatz, Galvin and GagneOperating System Concepts
Solaris Dispatch TableSolaris Dispatch Table
36. 5.36 Silberschatz, Galvin and GagneOperating System Concepts
Windows XP PrioritiesWindows XP Priorities
37. 5.37 Silberschatz, Galvin and GagneOperating System Concepts
Linux SchedulingLinux Scheduling
Two algorithms: time-sharing and real-time
Time-sharing
Prioritized credit-based – process with most credits is
scheduled next
Credit subtracted when timer interrupt occurs
When credit = 0, another process chosen
When all processes have credit = 0, recrediting occurs
Based on factors including priority and history
Real-time
Soft real-time
Posix.1b compliant – two classes
FCFS and RR
Highest priority process always runs first
38. 5.38 Silberschatz, Galvin and GagneOperating System Concepts
The Relationship Between Priorities and Time-sliceThe Relationship Between Priorities and Time-slice
lengthlength
39. 5.39 Silberschatz, Galvin and GagneOperating System Concepts
List of Tasks Indexed According toList of Tasks Indexed According to
ProritiesProrities
40. 5.40 Silberschatz, Galvin and GagneOperating System Concepts
Algorithm EvaluationAlgorithm Evaluation
Deterministic modeling – takes a particular predetermined
workload and defines the performance of each algorithm
for that workload
Queueing models
Implementation
48. 5.48 Silberschatz, Galvin and GagneOperating System Concepts
Java Thread SchedulingJava Thread Scheduling
JVM Uses a Preemptive, Priority-Based Scheduling Algorithm
FIFO Queue is Used if There Are Multiple Threads With the Same
Priority
49. 5.49 Silberschatz, Galvin and GagneOperating System Concepts
Java Thread Scheduling (cont)Java Thread Scheduling (cont)
JVM Schedules a Thread to Run When:
1. The Currently Running Thread Exits the Runnable State
2. A Higher Priority Thread Enters the Runnable State
* Note – the JVM Does Not Specify Whether Threads are Time-Sliced
or Not
50. 5.50 Silberschatz, Galvin and GagneOperating System Concepts
Time-SlicingTime-Slicing
Since the JVM Doesn’t Ensure Time-Slicing, the yield() Method
May Be Used:
while (true) {
// perform CPU-intensive task
. . .
Thread.yield();
}
This Yields Control to Another Thread of Equal Priority
51. 5.51 Silberschatz, Galvin and GagneOperating System Concepts
Thread PrioritiesThread Priorities
Priority Comment
Thread.MIN_PRIORITY Minimum Thread Priority
Thread.MAX_PRIORITY Maximum Thread Priority
Thread.NORM_PRIORITY Default Thread Priority
Priorities May Be Set Using setPriority() method:
setPriority(Thread.NORM_PRIORITY + 2);