Write a note on real time OS.

Write a note on real time OS.

Ans. In real time operating system , job is to be completed within the rigid time constraints otherwise job loses its meaning. A real time system functions correctly only if it return the correct result within its time constraints

Thus, in a real tome system , the correctness of the computation not only depends upon the logical correctness of the but also upon the time at which the result is produced.

A real time system is often used as a central device in a dedicated applications like fuel-injection system, robotics, air- traffic control, medical imaging systems, systems that control scientific experiment, industrial control system and weapon systems.

Comments

Shortest Job First Scheduling (SJF)

Shortest Job First Scheduling (SJF) · SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. · In SJF, the process with the least estimated execution time is selected from the ready queue for execution. · For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. · If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. · SJF algorithm can be preemptive or non-preemptive. Non-preeptive SJF · In non-preemptive SJF, scheduling, CPU is always assigned to the ...

Scheduling Algorithms

Scheduling Algorithms CPU scheduling algorithm deal with the problem of deciding which of the processes in the ready queue is to be allocated the CPU . six commonly used scheduling algorithms are: 1. first-come First-served(FCFS) 2. Shortest job First(SJF) 3. Priority scheduling 4. Round-Robin Scheduling(RR) 5. Multi-Level Queue Scheduling(MLQ) 6. Multi-Level Feedback Queue Scheduling (MFQ) First-Come First-Served Scheduling (FCFS) · It is simplest and the most straight forward of all scheduling algorithms. · In this scheduling, the process that request the CPU first is allocated CPU first. Thus the name first come first served. · We can say that in FCFS scheduling, a process is allocated CPU time according to the arrival time of a process. · The implementation of FCFS policy is easily manged with a FIFO queue...

Priority scheduling

Priority scheduling In priority scheduling , a priority is associated with all processes. Process are executed in sequence according to their priority. The CPU time is allocated to the process with highest priority. If the priority of two or more processes are equal than the process that has been inserted first into the ready queue is selected for execution. In other words, FCFS scheduling is performed when wo or more processes have same priority. The priorities are implemented as affixed range of numbers such as 0to 7 or 0 to 4,095. In other system, a low number indicates a high priority . in that case,a process with priority 0 is executed first. Priorities can be defined in two ways : internal or externall. ...

Multi Level Queue Scheduling (MLQ)

Multi Level Queue Scheduling (MLQ) · Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. · In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue · The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type · Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method · For example, consider a system with four different queues 1. ...

Multi user Operating System

Multi user operating system · In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. · The access is provided using a network that consists of various personal computer attached to a mainframe computer system. diagram of multi -user operating system · The various personal computer can send and receive information to mainframe computer system. · The example of multi-user OS are UNIX, windows 2000,novell netware. sing...

Easytolearn

Search This Blog