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.
Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the
When we download a movie from the Internet, we don't care about, say, packet sizes. However, even ifwe are not aware of howlow-level details of networks are implemented, our data i
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
Gang Scheduling : A set of related process is scheduled to execute on a set of processors at the similar time, on a 1-to-1 basis. Closely related processes or threads may be sched
1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory
Difference between cache and associate memory
Consider the following snapshot of a system, answer the following questions using the banker's algorithm: 1. What is the content of the matrix Need? Is the system in a safe stat
Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add
perform process suspension
Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no
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