What kernel provide for an effective user level thread, Operating System

1. What must a kernel provide for an effective user-level thread implementation?

2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of the following on the operating system:

 a)  q is fixed and identical for all users.

 b)  q is fixed and unique to each user.

 c)  q is variable and identical for all users.  

d)  q is variable and unique to a each user.

3. Arrange the above schemes in question 2 from lowest to highest run-time overhead. Explain your answer.

4. Arrange the above schemes in question 2 from least to most responsive to variations in individual processes and system load. Explain you answer.

Posted Date: 3/25/2013 2:06:57 AM | Location : United States







Related Discussions:- What kernel provide for an effective user level thread, Assignment Help, Ask Question on What kernel provide for an effective user level thread, Get Answer, Expert's Help, What kernel provide for an effective user level thread Discussions

Write discussion on What kernel provide for an effective user level thread
Your posts are moderated
Related Questions
What are Tree-structured directories We can generalize the directory structure to a tree of arbitrary height. This permits the user to create their own sub directories and to c

Write a short note on PCB? Every process is represented in the operating system by a process control block also called a task control block. It contains more information regard


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 th

BENEFITS OF THREADS OVER PROCESS If implemented correctly after those threads have some advantages of (multi) processes, they take: 1. Less time to create a new thread tha

Consider a particular system that does not have an interrupting clock.  The only way a thread can lose the processor is to voluntarily surrender it.  Additionally, the operating sy

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.

Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta


Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo