Coronavirus cases in India latest updates, COVID 19 tracker LIVE: While there are a lot of discussions going on over whether the lockdown will be extended or not, Prime Minister Narendra Modi on Saturday held a video conference with Chief Ministers of all states to take stock of the situation and decide whether to lift the lockdown or not. Delhi Chief Minister Arvind Kejriwal and Punjab CM Captain Amarinder Sigh have suggested PM Modi to extend the 21-day lockdown. The Punjab CM said during the meeting that the lockdown be extended for at least a fortnight, reports said.
Total coronavirus cases in India has 7,447 as the 21-day complete lockdown is set to end on April 14. According to the latest update by the Union Health Ministry, India’s total number of coronavirus positive cases has reached 7, 447, including 6565 active cases, 643 cured/discharged/migrated. The death toll has now reached 239 deaths. The country has recorded 40 deaths and 1035 new cases in last 24 hours, the sharpest ever increase in cases.
According to the latest report, over 15 lakh people have been infected by the deadly COVID 19 around the world. Coronavirus has effected as many as 192 countries. 87,320 people have died. The US, Italy, China, and Spain are the worst affected countries.
CPU Scheduling is a process of determining which process will own CPU for execution while another process is on hold. The main task of CPU scheduling is to make sure that whenever the CPU remains idle, the OS at least select one of the processes available in the ready queue for execution. The selection process will be carried out by the CPU scheduler. It selects one of the processes in memory that are ready for execution.
In Preemptive Scheduling, the tasks are mostly assigned with their priorities. Sometimes it is important to run a task with a higher priority before another lower priority task, even if the lower priority task is still running. The lower priority task holds for some time and resumes when the higher priority task finishes its execution.
Non-Preemptive Scheduling
In this type of scheduling method, the CPU has been allocated to a specific process. The process that keeps the CPU busy will release the CPU either by switching context or terminating. It is the only method that can be used for various hardware platforms. That's because it doesn't need special hardware (for example, a timer) like preemptive scheduling.
When scheduling is Preemptive or Non-Preemptive?
To determine if scheduling is preemptive or non-preemptive, consider these four parameters:
A process switches from the running to the waiting state.
Specific process switches from the running state to the ready state.
Specific process switches from the waiting state to the ready state.
Process finished its execution and terminated.
Only conditions 1 and 4 apply, the scheduling is called non- preemptive.
All other scheduling are preemptive.
Important CPU scheduling Terminologies
Burst Time/Execution Time: It is a time required by the process to complete execution. It is also called running time.
Arrival Time: when a process enters in a ready state
Finish Time: when process complete and exit from a system
Multiprogramming: A number of programs which can be present in memory at the same time.
Jobs: It is a type of program without any kind of user interaction.
User: It is a kind of program having user interaction.
Process: It is the reference that is used for both job and user.
CPU/IO burst cycle: Characterizes process execution, which alternates between CPU and I/O activity. CPU times are usually shorter than the time of I/O.
CPU Scheduling Criteria
A CPU scheduling algorithm tries to maximize and minimize the following:
Maximize:
CPU utilization: CPU utilization is the main task in which the operating system needs to make sure that CPU remains as busy as possible. It can range from 0 to 100 percent. However, for the RTOS, it can be range from 40 percent for low-level and 90 percent for the high-level system.
Throughput: The number of processes that finish their execution per unit time is known Throughput. So, when the CPU is busy executing the process, at that time, work is being done, and the work completed per unit time is called Throughput.
Minimize:
Waiting time: Waiting time is an amount that specific process needs to wait in the ready queue.
Response time: It is an amount to time in which the request was submitted until the first response is produced.
Turnaround Time: Turnaround time is an amount of time to execute a specific process. It is the calculation of the total time spent waiting to get into the memory, waiting in the queue and, executing on the CPU. The period between the time of process submission to the completion time is the turnaround time.
Interval Timer
Timer interruption is a method that is closely related to preemption. When a certain process gets the CPU allocation, a timer may be set to a specified interval. Both timer interruption and preemption force a process to return the CPU before its CPU burst is complete.
Most of the multi-programmed operating system uses some form of a timer to prevent a process from tying up the system forever.
What is Dispatcher?
It is a module that provides control of the CPU to the process. The Dispatcher should be fast so that it can run on every context switch. Dispatch latency is the amount of time needed by the CPU scheduler to stop one process and start another.
Functions performed by Dispatcher:
Context Switching
Switching to user mode
Moving to the correct location in the newly loaded program.
Types of CPU scheduling Algorithm
There are mainly six types of process scheduling algorithms
First Come First Serve (FCFS)
Shortest-Job-First (SJF) Scheduling
Shortest Remaining Time
Priority Scheduling
Round Robin Scheduling
Multilevel Queue Scheduling
Scheduling Algorithms
First Come First Serve
First Come First Serve is the full form of FCFS. It is the easiest and most simple CPU scheduling algorithm. In this type of algorithm, the process which requests the CPU gets the CPU allocation first. This scheduling method can be managed with a FIFO queue.
As the process enters the ready queue, its PCB (Process Control Block) is linked with the tail of the queue. So, when CPU becomes free, it should be assigned to the process at the beginning of the queue.
Characteristics of FCFS method:
It offers non-preemptive and pre-emptive scheduling algorithm.
Jobs are always executed on a first-come, first-serve basis
It is easy to implement and use.
However, this method is poor in performance, and the general wait time is quite high.
Shortest Remaining Time
The full form of SRT is Shortest remaining time. It is also known as SJF preemptive scheduling. In this method, the process will be allocated to the task, which is closest to its completion. This method prevents a newer ready state process from holding the completion of an older process.
Characteristics of SRT scheduling method:
This method is mostly applied in batch environments where short jobs are required to be given preference.
This is not an ideal method to implement it in a shared system where the required CPU time is unknown.
Associate with each process as the length of its next CPU burst. So that operating system uses these lengths, which helps to schedule the process with the shortest possible time.
Priority Based Scheduling
Priority scheduling is a method of scheduling processes based on priority. In this method, the scheduler selects the tasks to work as per the priority.
Priority scheduling also helps OS to involve priority assignments. The processes with higher priority should be carried out first, whereas jobs with equal priorities are carried out on a round-robin or FCFS basis. Priority can be decided based on memory requirements, time requirements, etc.
Round-Robin Scheduling
Round robin is the oldest, simplest scheduling algorithm. The name of this algorithm comes from the round-robin principle, where each person gets an equal share of something in turn. It is mostly used for scheduling algorithms in multitasking. This algorithm method helps for starvation free execution of processes.
Characteristics of Round-Robin Scheduling
Round robin is a hybrid model which is clock-driven
Time slice should be minimum, which is assigned for a specific task to be processed. However, it may vary for different processes.
It is a real time system which responds to the event within a specific time limit.
Shortest Job First
SJF is a full form of (Shortest job first) is a scheduling algorithm in which the process with the shortest execution time should be selected for execution next. This scheduling method can be preemptive or non-preemptive. It significantly reduces the average waiting time for other processes awaiting execution.
Characteristics of SJF Scheduling
It is associated with each job as a unit of time to complete.
In this method, when the CPU is available, the next process or job with the shortest completion time will be executed first.
It is Implemented with non-preemptive policy.
This algorithm method is useful for batch-type processing, where waiting for jobs to complete is not critical.
It improves job output by offering shorter jobs, which should be executed first, which mostly have a shorter turnaround time.
Multiple-Level Queues Scheduling
This algorithm separates the ready queue into various separate queues. In this method, processes are assigned to a queue based on a specific property of the process, like the process priority, size of the memory, etc.
However, this is not an independent scheduling OS algorithm as it needs to use other types of algorithms in order to schedule the jobs.
Characteristic of Multiple-Level Queues Scheduling:
Multiple queues should be maintained for processes with some characteristics.
Every queue may have its separate scheduling algorithms.
Priorities are given for each queue.
The Purpose of a Scheduling algorithm
Here are the reasons for using a scheduling algorithm:
The CPU uses scheduling to improve its efficiency.
It helps you to allocate resources among competing processes.
The maximum utilization of CPU can be obtained with multi-programming.
The processes which are to be executed are in ready queue.
Summary:
CPU scheduling is a process of determining which process will own CPU for execution while another process is on hold.
In Preemptive Scheduling, the tasks are mostly assigned with their priorities.
In the Non-preemptive scheduling method, the CPU has been allocated to a specific process.
Burst time is a time required for the process to complete execution. It is also called running time.
CPU utilization is the main task in which the operating system needs to make sure that CPU remains as busy as possible
The number of processes that finish their execution per unit time is known Throughput.
Waiting time is an amount that specific process needs to wait in the ready queue.
It is an amount to time in which the request was submitted until the first response is produced.
Turnaround time is an amount of time to execute a specific process.
Timer interruption is a method that is closely related to preemption,
A dispatcher is a module that provides control of the CPU to the process.
Six types of process scheduling algorithms are:
First Come First Serve (FCFS), 2) Shortest-Job-First (SJF) Scheduling 3) Shortest Remaining Time 4) Priority Scheduling 5) Round Robin Scheduling 6) Multilevel Queue Scheduling
In the First Come First Serve method, the process which requests the CPU gets the CPU allocation first.
In the Shortest Remaining time, the process will be allocated to the task, which is closest to its completion.
In, Priority Scheduling the scheduler selects the tasks to work as per the priority.
In, this Round robin scheduling works on principle, where each person gets an equal share of something in turn
In Shortest job first the shortest execution time should be selected for execution next
In Multilevel scheduling, method separates the ready queue into various separate queues. In this method, processes are assigned to a queue based on a specific property
The CPU uses scheduling to improve its efficiency
A Process Scheduler schedules different processes to be assigned to the CPU based on particular scheduling algorithms. There are six popular process scheduling algorithms which we are going to discuss in this chapter −
First-Come, First-Served (FCFS) Scheduling
Shortest-Job-Next (SJN) Scheduling
Priority Scheduling
Shortest Remaining Time
Round Robin(RR) Scheduling
Multiple-Level Queues Scheduling
These algorithms are either non-preemptive or preemptive. Non-preemptive algorithms are designed so that once a process enters the running state, it cannot be preempted until it completes its allotted time, whereas the preemptive scheduling is based on priority where a scheduler may preempt a low priority running process anytime when a high priority process enters into a ready state.
First Come First Serve (FCFS)
Jobs are executed on first come, first serve basis.
It is a non-preemptive, pre-emptive scheduling algorithm.
Easy to understand and implement.
Its implementation is based on FIFO queue.
Poor in performance as average wait time is high.
Wait time of each process is as follows −
Process
Wait Time : Service Time - Arrival Time
P0
0 - 0 = 0
P1
5 - 1 = 4
P2
8 - 2 = 6
P3
16 - 3 = 13
Average Wait Time: (0+4+6+13) / 4 = 5.75
Shortest Job Next (SJN)
This is also known as shortest job first, or SJF
This is a non-preemptive, pre-emptive scheduling algorithm.
Best approach to minimize waiting time.
Easy to implement in Batch systems where required CPU time is known in advance.
Impossible to implement in interactive systems where required CPU time is not known.
The processer should know in advance how much time process will take.
Given: Table of processes, and their Arrival time, Execution time
Shortest remaining time (SRT) is the preemptive version of the SJN algorithm.
The processor is allocated to the job closest to completion but it can be preempted by a newer ready job with shorter time to completion.
Impossible to implement in interactive systems where required CPU time is not known.
It is often used in batch environments where short jobs need to give preference.
Round Robin Scheduling
Round Robin is the preemptive process scheduling algorithm.
Each process is provided a fix time to execute, it is called a quantum.
Once a process is executed for a given time period, it is preempted and other process executes for a given time period.
Context switching is used to save states of preempted processes.
Wait time of each process is as follows −
Process
Wait Time : Service Time - Arrival Time
P0
(0 - 0) + (12 - 3) = 9
P1
(3 - 1) = 2
P2
(6 - 2) + (14 - 9) + (20 - 17) = 12
P3
(9 - 3) + (17 - 12) = 11
Average Wait Time: (9+2+12+11) / 4 = 8.5
Multiple-Level Queues Scheduling
Multiple-level queues are not an independent scheduling algorithm. They make use of other existing algorithms to group and schedule jobs with common characteristics.
Multiple queues are maintained for processes with common characteristics.
Each queue can have its own scheduling algorithms.
Priorities are assigned to each queue.
For example, CPU-bound jobs can be scheduled in one queue and all I/O-bound jobs in another queue. The Process Scheduler then alternately selects jobs from each queue and assigns them to the CPU based on the algorithm assigned to the queue.
The number of deaths linked to the novel coronavirus reached 100,000 on Friday, as the tally of cases passed 1.6 million, according to a Reuters tally.
The first death came in the central Chinese city of Wuhan on January 9. It took 83 days for the first 50,000 deaths to be recorded and just eight more for the toll to climb to 100,000.
The count has been accelerating at a daily rate of between 6% and 10% over the past week, and there were almost 7,300 deaths globally reported on Thursday.
The death count now compares with that of London's Great Plague in the mid-1660s, which killed an estimated 100,000 people, about a third of the city's population at the time.
But it is still far short of the so-called Spanish flu, which began in 1918 and is estimated to have killed more than 20 million people by the time it petered out in 1920.
The novel coronavirus is believed to have emerged in a Wuhan market where wild animals were sold late last year. It quickly spread through China and around the world.
Much remains to be determined about it, including just how lethal it is. Estimates vary widely.
Friday's figures - 100,000 deaths of out 1.6 million cases - would suggest a fatality rate of 6.25% but many experts believe the actual rate is lower given that many mild and asymptomatic cases, when infected people don't show symptoms, are not included in case totals.
Some countries, including Italy, France, Algeria, the Netherlands, Spain and Britain are reporting that more than 10% of all confirmed cases have been fatal.
One of the largest studies of the fatality of the disease, involving 44,000 patients in China, put the rate at about 2.9%.
The same study reported that 93% of recorded fatalities were people over the age of 50, and more than half were over 70.
Despite that, there are growing numbers of young adults and teenagers included in the global toll.
While North America now accounts for more than 30% of cases, Europe has reported a disproportionate number of fatalities, as countries with older populations like Spain and Italy have been severely affected.
Southern Europe alone accounts for more than a third of global deaths, despite recording just 20% of cases.
In many countries, official data includes only deaths reported in hospitals, not those in homes or nursing homes.
