Skip to main content

Multi Programming Operating System

 Multi programming system

·         Multi programming operating system allows multiple users to execute multiple programs using a single CPU concurrently i.e. at the same time.

·         In multiprogramming several process are kept in the main memory and CPU execute all these processes concurrently. It means, the CPU immediately switches from one process to next that are ready to get executed

·         In such an operating system when one process start process start performing the instructions from several programs at the same time.

·         Rather, it means that there are number program available to CPU and that portion of one is executed, then segment of another and so on

 

 

 


                              memory layout in multi programming system

 

 

·         In case of multiprogramming the various jobs residing in the main memory, can be in one of the following three stages

1.       Running : CPU is being used by the program

2.       Blocked : performing I/O operation

3.       Ready : waiting for CPU to be assigned to it

·         The various example of multiprogramming operation system are windows NT,OS/2, UNIX.

·         A typical scenario of jobs in multiprogramming system . at a particular instance of time , program A is not utilizing CPU as it is busy writing output data on the disk.


       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  

programming

The various feature required by multi programming system are:

1.        large memory

·         For a multi programming to work satisfactorily, large main memory is required to accommodate a good number of user programs along with operator system.

 

2.       Memory protection

·         Computer designed for multi programming must provide some type memory protection mechanism to prevent a programing one memory partition from changing information or instruction of a program in another memory partition.

 

3.       job status preservation

·         in multiprogramming when one running job is blocked before I/O operation ,the CPU is taken away from that job is given to some another job later on when that job has finished its I/O operation, it need to be resumed with its execution.

 

4.       Proper job mix

·         A proper mix of I/O-bound and CPU-bound processes is required so that the operation of CPU and I/O devices are balanced.

·         If all the loaded jobs need I/O At the same time  , the CPU will be adle.

                                             

                                                           jobs in multi programming system

 Advantages and disadvantages of multi programming

Advantages of multi programming:

1.       Increased throughput. Throughput increased by utilising the idle-time of CPU for running other program that are already present in the main memory.

2.       Lowered response time. Response time is lowered by recognising the priority of job as it enters the system and by processing jobs on a priority basis.

3.       Ability to assign priorities to job.  Most multi programming systems have scheme for setting  priorities for rotating programs. They specify when the CPU will rotating programs. They specify when the CPU will rotate to anther program, and which program it will rotate to.

Disadvantages of multi programming

1.       Multi programming is implemented through an operating system, which is a program that requires space in primary storage since it must be executed by the CPU. The operating system overhead os greater with multi programming that with batch processing.

2.       Jobs may have different sizes, therefore memory management is needed to accommodate them in memory .

3.       Many jobs may be ready to run on the CPU, which means that CPU scheduling is required.

 

 

One of the requirement of multi programming is the given below:

1.       CPU scheduling

·         In a multi programming system ,often  there will be situations in wich two or more jons will be in the ready state, waiting for CPU to be allocated for execution.

·         In such a case, the operating system must bdecide to which process or jobs should CPU be allocated..

·         For this a CPU scheduler select the processes and uses different CPU scheduling algorithm.

Comments

Post a Comment

Popular posts from this blog

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There   are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1.  Monolithic architecture 2.      Layerd archtecture . 3.       Virtual machine architecture 4.       Exokernel architecture 5.      Client server architecture   6.       Micro kernel architecture Now let’s head into our main focus. What is an Exokern...
Post a Comment
Read more

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 ...
Post a Comment
Read more

Thread

Thread What is Thread? A thread is a flow of execution through the process code, with its own program counter that keeps track of which instruction to execute next, system registers which hold its current working variables, and a stack which contains the execution history. A thread shares with its peer threads few information like code segment, data segment and open files. When one thread alters a code segment memory item, all other threads see that. A thread is also called a  lightweight process . Threads provide a way to improve application performance through parallelism. Threads represent a software approach to improving performance of operating system by reducing the overhead thread is equivalent to a classical process. Each thread belongs to exactly one process and no thread can exist outside a process. Each thread represents a separate flow of control. Threads have been successfully used in implementing network servers and web server. They also provide a suitable foundation ...
Post a Comment
Read more

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...
Post a Comment
Read more

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.     ...
Post a Comment
Read more