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!
Compare user threads and kernel threads.
User threads:-
User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation & scheduling are done in the user space, without kernel intervention. Thus they are fast to create and manage blocking system call will cause the whole process to block
Kernel threads:-
Kernel threads are supported directly by the operating system .Thread creation; scheduling and management are completed by the operating system. Thus they are slower to create & manage compared to user threads. If the thread performs a blocking system call, the kernel can schedule another thread in the application for implementation.
combined approaches (ULT/KLT)
Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper
Write in brief on UNIX file structure. UNIX considers every file to be a sequence of 8-bit bytes no interpretation of these bits is made by the operating system. This system pr
What are the disadvantages of linked allocation? The drawbacks are a. Used only for sequential access of files. b. Direct access is not supported c. Memory space neede
What are turnaround time and response time? Turnaround time is the interval among the submission of a job and its completion. Response time is the interval among submission
What is the purpose of the command interpreter? Why is it usually separate from the kernel? It reads commands from the user or from a file of commands and executes them, usuall
Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are
explain hierarchical,hashed and inverted paging
LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for
operation policies
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