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

Assignment Help:

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

(1) User-level threads are unknown by the kernel, while the kernel is aware of kernel threads.

(2) User threads are listed by the thread library and the kernel schedules kernel threads.

(3) Kernel threads require not be associated with a process while every user thread belongs to a process.

Related Discussions:- Differences among user-level threads and kernel-level thread

Computer number systems, Binary number based systems Binary is a ' base...

Binary number based systems Binary is a ' base 2' number system, only two numbers exist namely '0' and '1'. Conversion from binary to base 10 is easy if the number column techn

What are the typical elements of a process image, What are the typical elem...

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 the advantages and drawback of multiple processes, Explain the Adva...

Explain the Advantages and Drawback of Multiple Processes Application architected to take advantage of multiple processes will certainly see performance gains. Functions and Fe

Model, list trhe various classification of model and types?

list trhe various classification of model and types?

File system, what are disadvantages of using single directory

what are disadvantages of using single directory

Ipc, explain in detail about ipc in linux

explain in detail about ipc in linux

Define semaphore, Define semaphore A semaphore is a protected abstract ...

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

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

What is paging? , What is paging? Paging is a memory management schem...

What is paging? Paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fi

Read - write cycles of microprocessors, Examining the write/cycles as shown...

Examining the write/cycles as shown below We can see that the bus is designed for asynchronous read/write cycles. The operation of the write cycle is simple in that the add

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages