Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
How is process management done in multiprocessing systems?
There are two accost for the process management in multiprocessor systems.
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:
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.
Demand paging With demand paging, a page is called into memory only when a location on that page is actually indexed during run time. With pre-paging, pages other than the one
how the system call is work?
Briefly explain the process management in UNIX. UNIX makes use of the easy but powerful process facility that is visible to the user. UNIX follows the model in which the majori
What are the various file operations? The six basic file operations are Creating a file Reading a file Writing a file Repositioning within a file Tr
List the task regions in the Spiral model. Customer communication - In this region it is suggested to set up customer communication. Planning - All planning activities
describe competing process
FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit
Explain the Network protocols There are a wide variety of network protocols to choose from traditionally client - server developers were required to choose a communications pro
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
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd