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. What resources are utilized when a thread is created? How do they vary from those used when a process is created?
Answer: For the reason that a thread is smaller than a process thread creation typically uses fewer resources than process creation. Creating a process necessitate allocating a process control block (PCB) a rather large data structure.
The PCB comprises a memory map list of open files and environment variables. Allocating as well as managing the memory map is usually the most time-consuming activity. Creating either a user or else kernel thread involves allocating a small data structure to hold a stack, register set and priority.
Unisex Restroom Problem
Inverted page table In page table the page table has one entry for every page that the process is using. The operating system must translate this reference into a physical memo
Question: a) Windows Server 2003 has brought great enhancements the Server System as compared to the previous version. Write down short notes on the below listed enhancements.
What is a process? A process is a program in implementation. It is an active entity and it contains the process stack, having temporary data and the data section includes globa
What advantages are there to this two-level directory? Users are isolated from each other. Users have more freedom in choosing file names.
What is reference string We evaluate an algorithm by running it on a definite string of memory reference and computing the number of page faults. The string of memory reference
FIFO page replacement algorithm with example
Define memory management In multiprogramming system the user part of memory should be further subdivided to accommodate multiple processes. The task of subdivision is carried o
What is spooling? Spooling overlaps the I/O of single job with the computation of other jobs.
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
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