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

Can you give me assistance on my operating system assignment, Can you give ... Can you give me assistance on my operating system assignment?

Thread pools, Another solution then would be to keep a pool of threads. Whe... Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.

Define program preemption, Define Program preemption The Forced de-allo... Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

Starvation, what do you mean by starvation?explain in detail what do you mean by starvation?explain in detail

Define a linker program, Define a linker program  A linker program lin... Define a linker program  A linker program links the program along with other programs required for its execution.

State in a deadlock-avoidance system, Question: In a deadlock, processe... Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond

Define shell in unix system, A Unix shell is a shell or command-line inte... A Unix shell is a shell or command-line interpreter that gives a traditional user interface for the Unix-likesystems and for Unix operating system. Users operates the operation of

Define criterion for classification of data structures, Define what can be ... Define what can be used as a criterion for classification of data structures utilized in language processing              Answer: nature of a data structure, lifetime of a dat

Parent process: why not finishing and how to make finish, #include #inclu... #include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

Explain the performance of demand paging, Performance of demand paging ... Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time