Skip to main content

Multi processing system


 Multi processing system

·         Multi processesor system is the sytem that contain two or more processors or CPUS and has ability to simultaneously execute   several programs. Hence the name multi-processor

In such a system, multiple processor share the clock, bus, memory and peripheral devices.

·         A multi processor system is also known as parallel system

·         Multi processor system are categorized into two different types:

             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  

1.       Symmetric multiprocessing(SMP)

2.       Asymmetric multiprocessing(ASMP)

·         Symmetric multi processing (SMP)

 

1.       In SMP each processor runs an identical copy of the operating system.

2.       The processor can communicate with each other and execute these copies concurrently.

3.       Therefore SMP exhibit peer-to-peer relationship.

·         Asymmetric multiprocessing (ASMP)

 

1. In ASMP, different processor do different things i.e. they are not identical thus, there is imbalance among the processors. hence the name asymmetric.

2. in ASMP each processors is given a specific task and do not share equal load .

3. There is master slave relationship between the processors.

     

Advantage and disadvantages 

of multiprocessing system

 

Advantages of multiprocessing system

  • 1.       Improved reliability .multiprocessing system have better reliability than single-processor because of the presence of multiple processors. If one of the processors break down ,the other processors automatically takes over the system work hold until repaired are made. Hence a complete breakdown of such system can be avoided.
  • 2.       Improved throughout. Throughout is the number of jobs executed per unit time. With the use of multiple processors, parallel processing of segment of programs is  possible .
  • 3.       Lowered turnaround time. Turnaround time is the difference between the time user submits his jobs to system for processing and the time he receive results.
  • 4.       Efficient utilisation of all resources. In addition to the processors , it also facilities more efficient utilisation of all the other devices of the computer system.
  • 5.       Economical. The clock, bus, peripheral devices and memory are shared . as a result, it is cheaper to have multiprocessors systems than multiple single processors system.

 

 

 Disadvantages of multiprocessing system

  • 1.       A very sophisticated operating system is required to schedule, balance and coordinate the input, output and processing activities of multiple CPU's.
  • 2.       A large main memory is required for accommodating the sophisticated operating system along with several users programs.
  • 3.       Such  system are very expensive in addition to the high charges paid initially, the regular operation and maintenance of these systemis also costly affair

 

Comparison between multi 

programming and multi 

processing


Comments

Popular posts from this blog

Message Delivery Protocol

  Message Delivery Protocol ·          A protocol is a set of rules and conventions shared by communicating entities . ·          Message passing can be blocking or non blocking . ·          In blocking protocol , a sender process is blocked till the message selivered to the . in this case , sender process has guarantee that the message sent by it ie delivered before it continues its execution . A blocking protocol normally includes: 1.        Blocking send : the sender process is blocked until the message is received by the receiving process or by the mailbox. 2.        Blocking receive : the receiver nlocks until a message is available thus when both sender as well as receiver is blocked ,it is known as rebdevezevous . this combination allows for tight sysnchronization between process. ·...

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.   ...

Direct Communicationand Indirect communication

  Direct Communication ·          Direct communication establishes a link between two processes. A communication link is a unidirectional path along which information flows. ·          two processes use single communication link to share information. ·          In this   metod, there cannot be more that one link between two processes                                                     direct communication ·          Send and receive function used in direct communication are given below : ·          Send(process name , message ,(receive(process name , message)             Send(A, message...

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 ·      ...

ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION

      ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION ·          In multi programming environment multiple process co-exit . a single   program may be broken into number of processes. ·          The process are classified into two categories : independent processes and cooperating processes. ·          An independent process is a standalone process that does not share any data with any other process. It cannot affect or be affected by the other processes executing   in the system. In other words, the modification made to an independent process does not affect the functioning of other process. ·          A cooperating processes is a process that shares data with other processes in a system it can affect or be affectedly the other processes executing in the system ·      ...