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.
Q. Error detection in operating system? Error detection- Error detection take places at both the hardware and software levels. At the hardware level every data transfers must b
There are three kinds of Data Abstraction: Physical level: The minimum level of abstraction defines how data are saved. Logical level: The next bigger level of a
Clustered file organization A clustered file is also called a B-tree-clustered file is a tree-structured file in which records with adjacent index values are clustered toget
Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont
What are the various process scheduling concepts? a) Scheduling queues with diagram b) Queuing diagram c) Schedulers d) Context switch with diagram
Indexed allocation Indexed allocation bringing all the pointers together into one location: the index block. Every file has its own index block, which is an array of disk-block
ssssss
Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick
what is exit status
Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU
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