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!
Q. Process migration in a heterogeneous network is typically impossible given the differences in architectures and operating systems. Explain a method for process migration across different architectures running:
a. The similar operating system
b. Dissimilar operating systems
Answer: For the similar operating system process migration is relatively straightforward as the state of the process requires migrating from one processor to another. This engages moving the address space state of the CPU registers as well as open files from the source system to the destination.
Nevertheless it is significant that identical copies of the operating system are running on the different systems to ensure compatibility.
If the operating systems are the similar however perhaps different versions are running on the separate systems then migrating processes should be sure to follow programming guidelines that are consistent between the different versions of the operating system.
Java applets provide a nice illustration of process migration between different operating systems. To hide dissimilarities in the underlying system the migrated process (that is a Java applet) runs on a virtual machine rather than a specific operating system.
five major activities on file management in operating system.? Explain it.?
Q. Explain about Spooling? Acronym for simultaneous peripheral operations on line. Spooling denotes to putting jobs in a buffer, a special area in memory or on a disk where
What is the use of fork and exec system calls? Fork is a system call by which a latest process is created. Exec is also a system call, which is used after a fork by one of the
How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that
Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f
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
explain about oprating system services and topics briefly
Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c
How could we implement locks? No matter how we choose to implement them, we must have some hardware support. One possibility for implementing locks on a uniprocessor machine is is
We are use to using variables within C without thinking about where they are stored. Most variables are dynamic i.e. can change, therefore they are stored in Ram, unlike a program
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