Skip to main content

Real-time system

 Real-time system

·         In a real time operating system, a job is to be completed within the  rigid time constraints otherwise job loses its meaning.

·         A real time system function correctly only if it returns the correct result within its time constraints

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

Real-time system

In a real time system various functions like process scheduling, memory management, I/O management and file  management are performed as follows :

1.       Process scheduling . the real time system uses priority based pre-emptive scheduling. each process is assigned a certain level of priority and the process with the highest priority is allocated the processor among those which are in the ready state.

2.       Memory management. In real time system, the processes remain in primary memory for most of the time in order to provide quick response.

3.       I/O device management . time critical device management is main requirement of real time system . it also uses feature like interrupt management and I/O buffering.

4.       File management. In real time system, file management does not aim at efficient utilisation of secondary storage rather main objective is to provide fast access.

        single user operating system  

2.      Multi user operating system 

3.       Batch processing operating system

4.      Multi programming operating system 

5.     Multi tasking operating system 

6.       Multiprocessing operating system

7.       Time sharing operating system

8.     Real time system  

Real-time operating system are categorised into:

1.      Hard real-time systems

2.      Soft real-time systems

 

1.       Hard real time systems complete the critical tasks within the definite interval of constraints. If the critical task is not completed within the time constraints then the hard real time system fails.

Thus, a hard real time system has to complete all the processes within definite deeding and a single miss leads to critical failure

 

2.       Soft real time system are less restrictive in a nature and are not affected the lapse of time interval and do not cause any critical failure.

Soft real time system are used in the area of multimedia, virtual reality


Comparison between soft real time and hard real time system

 

 




 

 

Comments

Post a Comment

Popular posts from this blog

Defination of OS(operating system) and its concepts

    What do you mean by operating system?     Definition :  An operating system is a program that act as an interface between the user of a computer and the                                      Computer hardware. Operating system is a first program that gets loaded into the memory through a process called booting. Concepts of operating system : ·                       The purpose of operating system is to provide an environment in which a user can execute program in a convenient and efficient manner. ·                       Operating system is an integrated set of program that ma...
3 comments
Read more

Classification of Operating System

  Classification of operating systems The operating systems may be classified into different types depending upon the nature of interaction between the user and his/her program. The various types of operating system are : 1.       single user operating system    2.        Multi user operating system   3.         Batch processing operating system 4.        Multi programming operating system   5.       Multi tasking operating system   6.         Multiprocessing operating system 7.         Time sharing operating system 8.       Real time system      Distributed system Multi threading operating system       Single user operating system ·          ...
Post a Comment
Read more

Process Termination or destroy a process

  Process Termination or destroy a process Processes may request their own termination by making the  exit( )  system call, typically returning an int. This int is passed along to the parent if it is doing a  wait( ) , and is typically zero on successful completion and some non-zero code in the event of problems. child code: int exitCode; exit( exitCode ); // return exitCode; has the same effect when executed from main( ) parent code: pid_t pid; int status pid = wait( &status ); // pid indicates which child exited. exitCode in low-order bits of status // macros can test the high-order bits of status for why it stopped Processes may also be terminated by the system for a variety of reasons, including: The inability of the system to deliver necessary system resources. In response to a KILL command, or other un handled process interrupt. A parent may kill its children if the task a...
Post a Comment
Read more

Application Of Threads

  Application Of Threads This section discuss various implementation of threads. Multithreading concepts are implemented by pthread (POSIX standard), solaris, linux, window 2000 and java. 1. POSIX THREAD(Pthreads) ·          Pthread refers to the POSIX standard(IEEE 1003.IC) that defines an API for thread creation and sychronisation. ·          Prior to the of POSIX THREADS, each hardware vendor implemented their own version of threads. ·          As each implemented from the other, writing portable multithreaded application was difficult. Thus POSIX standardize the API for thread management. ·          The current Pthread API is defined only for C programming language and it is implemented as function with a header file Pthread.h and thread library. ·          The naming...
Post a Comment
Read more

Multilevel Feedback queue scheduling (MFQ)

  Multilevel Feedback queue scheduling (MFQ) ·          Multilevel feedback queue scheduling is an enhancement of multi-levelqueue scheduling. In this scheme, processes can move between the different queue ·          The various processes are separates in different queue on the basis of their CPU Burst Char characteristics ·          If a process consumes a lot of CPU time , it is placed into a lower priority queue. Thus I/O bound and interactive process are placed in the higher priority queue and CPU bound pricesses are in lower priority ·          If a processes waits too long in a lower priority queue it is moved higher priority queue. Such an aging prevents starvation. ·          The top priority queue is given smallest CPU time Quantum ·      ...
Post a Comment
Read more