How is process management done in multiprocessing systems, Operating System

Assignment Help:

How is process management done in multiprocessing systems?

There are two accost for the process management in multiprocessor systems.

  • Master-slave configuration
  • Symmetrical multiprocessors

 

In master-slave configuration one of the processor units is identified as the master processor, which implements the OS routines and performs all control functions in the system. So the master processor decides which process to execute on which processor. All other processors are slaves to the master they basically perform the tasks detailed to them by the master. The disadvantages and advantages of the master-slave configuration are:

  • Simplicity
  • Poor reliability for the reason that if the master fails the entire system fails.
  • Poor scalability that means the load of the master rises with the addition of new slaves.

In symmetrical multiprocessors, a processor is identical in their ability to perform control functions. A processor selection is stimulated whenever an interrupt is raised in the system. The chosen processor handles the interrupt. The remaining of the system can continue its operation. This provides improved reliability than master-slave configuration. A disadvantage of the system is that it doesn't fully exploit the potential of multiple processors in the system.

 


Related Discussions:- How is process management done in multiprocessing systems

What is the use of FIFOs in client-server applications, What is the use of ...

What is the use of FIFOs in client-server applications

Major locking errors, When programming with threads, there are three very c...

When programming with threads, there are three very common mistakes that programmers often make: 1. locking twice (depending on the system and type of lock, can cause crashes, h

Define a program that is in execution is known as, Define a program in exec...

Define a program in execution is known as A program in execution is known as a process

Contiguous-memory allocation, Compare contiguous-memory allocation with pur...

Compare contiguous-memory allocation with pure paging in the following aspects: 1. In support of dynamic memory allocation: most systems allow programs to allocate more memory t

AIMMS3.9, Do you have writers that can use the software AIMMS version 3.9?

Do you have writers that can use the software AIMMS version 3.9?

Explain about memory-management scheme, Q. In the IBM/370 memory protectio...

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU

Fibonacci sequence, #questionThe Fibonacci sequence is the series of number...

#questionThe Fibonacci sequence is the series of numbers 0,1,1,2,3,5,8,… Formally, it can be expressed as: fib0 = 0 fib1 = 1 fibn = fib n-1 + fib n-2 Write a C program u

Define fifo page replacement algorithm, Define FIFO Page Replacement Algori...

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Error detection, about error detection in operating system and how does it ...

about error detection in operating system and how does it take place?

Processes, draw a state diagram showing the transissions of a process from ...

draw a state diagram showing the transissions of a process from creation to termination

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd