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
Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is

Q. Why do some systems stay track of the type of a file while others leave it to the user or simply don't implement multiple file types? Which system is "better?" Answer: A f

MEMORY MANAGEMENT USING LINK LISTS The first one is for showing it is process or hole, second is for starting address and third is for length of the process and last is a point

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Define UFD and MFD. In the two-level directory structure, every user has her own user file directory (UFD). Every UFD has a similar structure, but lists only the files of a one

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

Question 1: a) State the different file attributes and briefly explain the operations that can be performed on each files. b) What is a semaphore? Describe why it is impor

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce