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.
What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Because I/O deices differ widely in their function
Define a linker program A linker program links the program along with other programs required for its execution.
What disadvantages are there to this two-level directory? Without other provisions, two users who require cooperating with each other are hampered in reaching every other's fi
Define the features are needed to implement top down parsing Source string marker, Prediction making mechanism and Matching and Backtracking mechanism
What are the typical elements of a process image? User data: Modifiable part of user space. May have program data, user stack area, and programs that might be modified. User
Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble
Basic concepts When a process is to be changed in, the pager guesses which pages will be used before the process is changed out again. Instead of swapping in a entire process,
While it is hard to resolve a deadlock which has been detected, fortunately it is fairly easy to prevent deadlocks from ever happening. The key is that the conditions above for dea
explain dynamic patrician stratagies
What is critical section problem? Consider a system consists of 'n' processes. Every process has segment of code called a critical section, in which the process might be changi
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