6. Operating System - Process Scheduling

Definition: Process scheduling is the activity of the process manager that handles the removal of the running process from the CPU and the selection of another process on the basis of a particular strategy.

Process Scheduling Queues (Job Queue, Ready Queue, Device Queue):

Job queue - This queue keeps all the processes in the system.
Ready queue - This queue keeps a set of all processes residing in the main memory, ready and waiting to execute. A new process is always put in this queue.
Device queues - The processes which are blocked due to the unavailability of an I/O device constitute this queue.

Two-State Process Model (Running, Not Running):

Running: When a new process is created, it enters into the system as in the running state.
Not Running: Processes that are not running are kept in a queue, waiting for their turn to execute.

Scheduler (Long-Term Scheduler, Short-Term Scheduler, Medium-Term Scheduler):

Schedulers are special system software that handles process scheduling in various ways. Their main task is to select the jobs to be submitted into the system and to decide which process to run.

Long-Term Scheduler: It is also called a job scheduler. A long-term scheduler determines which programs are admitted to the system for processing. It selects processes from the queue and loads them into memory for execution. Process loads into the memory for CPU scheduling. The primary objective of the job scheduler is to provide a balanced mix of jobs, such as I/O bound and processor bound.

Short-Term Scheduler: It is also called a CPU scheduler. Its main objective is to increase system performance in accordance with the chosen set of criteria. Short-term schedulers are faster than long-term schedulers.

Medium-Term Scheduler: Medium-term scheduling is a part of swapping. It removes the processes from the memory.

Context Switch: A context switch is a mechanism to store and restore the state or context of a CPU in the Process Control block so that a process execution can be resumed from the same point at a later time.

Scheduling Algorithm:

First Come, First Serve (FCFS): Jobs are executed on a first-come, first-served basis.
Shortest Job Next (SJN): Best approach to minimize waiting time.
Priority Based Scheduling: Each process is assigned a priority. A process with the highest priority is to be executed first and so on.
Shortest Remaining Time: The processor is allocated to the job closest to completion but it can be preempted by a newer ready job with a shorter time to completion.
Round Robin Schedule: Each process is provided a fixed time to execute; it is called a quantum.

Comments

7.Operating System - Memory Management

Process Address Space: The process address space is the set of logical addresses that a process references in its code. Static vs Dynamic Loading: The choice between Static or Dynamic Loading is to be made at the time of the computer program being developed. If you have to load your program statically, then at the time of compilation, the complete programs will be compiled and linked without leaving any external program or module dependency. If you are writing a dynamically loaded program, then your compiler will compile the program and for all the modules which you want to include dynamically, only references will be provided and the rest of the work will be done at the time of execution. At the time of loading, with static loading, the absolute program (and data) is loaded into memory in order for execution to start. If you are using dynamic loading, dynamic routines of the library are stored on a disk in re-locatable form and are loaded into memory only when they a...

8. Operating System - Virtual Memory and Input/Output

Definition: A computer can address more memory than the amount physically installed on the system. This extra memory is actually called virtual memory and it is a section of a hard disk that's set up to emulate the computer's RAM. The main visible advantage of this scheme is that programs can be larger than physical memory. Virtual memory serves two purposes. First, it allows us to extend the use of physical memory by using disk. Second, it allows us to have memory protection, because each virtual address is translated to a physical address. Demand Paging: A demand paging system is quite similar to a paging system with swapping where processes reside in secondary memory and pages are loaded only on demand, not in advance. Page Replacement Algorithm: Page replacement algorithms are the techniques using which an Operating System decides which memory pages to swap out, write to disk when a page of memory needs to be allocated Reference String: The string of memory references i...

9. Operating System - Extra

Interrupt: In system programming, an interrupt is a signal to the processor emitted by hardware or software indicating an event that needs immediate attention. Trap: In computing and operating systems, a trap, also known as an exception or a fault, is typically a type of synchronous interrupt caused by an exceptional condition (e.g., breakpoint, division by zero, invalid memory access). Signal: A signal is a software-generated interrupt that is sent to a process by the OS because when the user press ctrl-c or another process tells something to this process. There is fix set of signals that can be sent to a process. Signals are identified by integers. A signal number has symbolic names. System call: The interface between a process and an operating system is provided by system calls. System calls are usually made when a process in user mode requires access to a resource. Then it request...

cs-course

Search This Blog