Differences among user-level threads and kernel-level thread, Operating System

Q. What are two differences among user-level threads and kernel-level threads? Under what situations is one type better than the other?

Answer:

(1) User-level threads are unidentified by the kernel whereas the kernel is aware of kernel threads.

(2) On systems utilizing either M:1 or M:N mapping user threads are scheduled by the thread library and the kernel schedules kernel threads.

(3) Kernel threads require not be associated with a process where as each user thread belongs to a process. Kernel threads are usually more expensive to maintain than user threads as they must be represented with a kernel data structure.

Posted Date: 7/27/2013 2:35:45 AM | Location : United States







Related Discussions:- Differences among user-level threads and kernel-level thread, Assignment Help, Ask Question on Differences among user-level threads and kernel-level thread, Get Answer, Expert's Help, Differences among user-level threads and kernel-level thread Discussions

Write discussion on Differences among user-level threads and kernel-level thread
Your posts are moderated
Related Questions

Define process? What is meant by state of a process? Process is a program in implementation. A process in general includes the process stack, which consists temporary data and

Define Page stealing    Page stealing is taking page frames another working sets

Ask question #Minimum 100 difference between bounded and unbounded buffer words accepted#

What is virtual file system? A Virtual file system switch (VFS) or Virtual file system is an abstraction layer   on top of a more concrete file system. The purpose of a VFS

Q. Why might a system utilize interrupt-driven I/O to manage a single serial port however polling I/O to manage a front-end processor such as a terminal concentrator? A

Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,

How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th

Major page fault: If the page is not loaded in memory at the time the fault is stated, then it is named major or hard page fault. The handler in the machine requires to search a

Q. Multithreading is a commonly utilized programming technique. Illustrate three different ways that threads could be implemented. Describe how these ways compare to the Linux clon