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

Ask an Expert

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

Write your message here..

Related Questions

Banker''s algorithm, Consider the following snapshot of a system, answer th... 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

Which algorithm makes the most efficient use of memory, Question : (a) ... 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

Obelia, what do obelia eat and how do they feed what do obelia eat and how do they feed

Define most common phase structured grammar, Which is most common phase str... Which is most common phase structured grammar? Most common phase structured grammar is Context – Sensitive

Number System, what is Number System what is Number System

Optimal replacement policy, The optimal replacement policy, called OPT, is ... The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP

Cosled loop, What are the two principles in Hungarian method? What are the two principles in Hungarian method?

How is memory management done using bit maps?, How is memory management don... How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce

What is a resource-allocation graph, What is a resource-allocation graph? ... What is a resource-allocation graph? Deadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph. This graph having of a se

What is an acyclic graph, What is an acyclic graph? A tree that has bee... What is an acyclic graph? A tree that has been corrupted by links to other branches, but does not have any cyclic paths in it.