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

Layered Operating System

  Layered Operating System Layered Structure is a type of system structure in which the different services of the  operating system  are split into various layers, where each layer has a specific well-defined task to perform . It was created to improve the pre-existing structures like the Monolithic structure ( UNIX ) and the Simple structure ( MS-DOS ). Example –  The Windows NT operating system uses this layered approach as a part of it . Design Analysis : The whole Operating System is separated into several layers ( from 0 to n ) as the diagram shows. Each of the layers must have its own specific function to perform. There are some rules in the implementation of the layers as follows. The outermost layer must be the User Interface layer. The innermost layer must be the Hardware layer. A particular layer can access all the layers present below it but it cannot access the layers present above it. That is layer n-1 can access all the layers from n-2 to 0 but it canno...
Post a Comment
Read more

OS its Resource Manager and its Function

  Operating system as resource manager:   ·           A computer system usually has many hardware and software resources such as processor , memory, disk printer, I/O devices etc. ·           The task of resources management becomes essential in multi-user operating system where different user compute for the same resource.   Operating system manages resources in two ways : 1.         Time multiplexing : it defines the sharing of resources on the basis of fixed time slices. For example, the operating system allocate the resources, such as CPUto program A for fixed time slice. 2.         Space timing:  it defines the concurrent sharing of resources among different programs.for example, sharing of hard disk and main memory is space multiplexing.     FUNCTION OF OPERATING SYSTEM     The primar...
2 comments
Read more

Monolithic Architecture

  Monolithic Architecture Monolith means composed all in one piece. The  Monolithic  application describes a single-tiered  software  application in which different components combined into a single program from a single platform. Components can be: Authorization — responsible for authorizing a user Presentation — responsible for handling HTTP requests and responding with either HTML or JSON/XML (for web services APIs). Business logic — the application’s business logic. Database layer — data access objects responsible for accessing the database. Application integration — integration with other services (e.g. via messaging or REST API). Or integration with any other Data sources. Notification module — responsible for sending email notifications whenever needed. Example for Monolithic Approach Consider an example of Ecommerce application, that authorizes customer, takes an order, check products inventory, authorize payment and ships ordered products. This applicat...
Post a Comment
Read more

Suspend a process

  Suspend a process A process is an active program. It can also be said as a program that is under execution. It is more than the program code as it includes the program counter, process stack, registers, program code etc. Compared to this, the program code is only the text section. A process passes through different states as it executes. These states may be different in different operating systems. However, the common process states are explained below with the help of a diagram − New This is the state when the process has just been created. It is the initial state in the process life cycle. Ready In the ready state, the process is waiting to be assigned the processor by the short term scheduler, so it can run. This state is immediately after the new state for the process. Ready Suspended The processes in ready suspended state are in secondary memory. They were initially in the ready state in main memory but lack of memory forced them to be suspended and gets placed in the second...
Post a Comment
Read more

Scheduler

  Scheduler   Scheduling Objectives Here, are important objectives of Process scheduling Maximize the number of interactive users within acceptable response times. Achieve a balance between response and utilization. Avoid indefinite postponement and enforce priorities. It also should give reference to the processes holding the key resources  Process Scheduling handles the selection of a process for the processor on the basis of a scheduling algorithm and also the removal of a process from the processor. It is an important part of multiprogramming in operating system. Process scheduling involves short-term scheduling, medium-term scheduling and long-term scheduling. Details about these are given as follows − Long-Term Scheduling Long-term scheduling involves selecting the processes from the storage pool in the secondary memory and loading them into the ready queue in the main memory for execution. This is handled by the long-term scheduler or job scheduler. The long-term s...
Post a Comment
Read more