what is Kernel-Level Thread in operating system?, Basic Computer Science

Assignment Help:
In this technique, the kernel knows about and handles the threads. No runtime system is required in this case. In place of thread table in each process, the kernel has a thread table that keeps track of all threads in the system. As well, the kernel also maintains the traditional process table to keep track of processes. Operating Systems kernel gives system call to create and manage threads.

The implementation of common structure of kernel-level thread is

Advantages:
Since kernel has full knowledge of all threads, Scheduler may make a decision to give more time to a process having large amount of threads than process having small number of threads.
Kernel-level threads are mainly good for applications that frequently block.
Disadvantages:
The kernel-level threads are slow and inefficient. Illustration sis, threads operations are hundreds of times slower than that of user-level threads.
Kernel must handle and schedule threads as well as processes. It involves a full thread control block (TCB) for each thread to keep information about threads. As a result significant overhead and increased in kernel complexity.

Related Discussions:- what is Kernel-Level Thread in operating system?

Computer graphics, A scaling constant indicates an expansion of length

A scaling constant indicates an expansion of length

Explain any five different types of computers, Question 1 Explain any five...

Question 1 Explain any five different types of computers Question 2 Describe Bus Type LAN. Its disadvantages and advantages and examples Question 3 Describe the

Explain the process of fetching a word from the memory, Question 1 Explain...

Question 1 Explain the functional units of a basic computer with a neat diagram Question 2 Explain how you can get 1's complement of a given binary number? Also explain 1'

C++, whats the out put of int main(){ int n=310; funcone(n); functwo(&n); ...

whats the out put of int main(){ int n=310; funcone(n); functwo(&n); cout return 0; } void funcone(intn) n=240; } void func two(intn*) { n=120; }

Explain the concept of a transition graph, Question 1 Define the concept o...

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

Computer science, Explain Canonical cover and Extraneous Attributes with ex...

Explain Canonical cover and Extraneous Attributes with examples.

Memory, what is cache memory

what is cache memory

Learn, The technique to mix C and assembly language is to apply the "asm" d...

The technique to mix C and assembly language is to apply the "asm" directive. To access C-language variables from assembly language, you just use the C identifier that name is a me

Data mining analysis, Using Weka 3.6 (basketball or cloud data set). Using ...

Using Weka 3.6 (basketball or cloud data set). Using the EM clustering method, how many clusters did the algorithm decide to make? If we change from "Use Training Set" to "Percenta

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd