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
UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa

Medium term scheduling This is component of the swapping function. Usually the swapping in decision is based on the need to manage the degree of multiprogramming. At a system t

Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre

Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK Scheduling

Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The

What are the methods for handling deadlocks ? The technique for handling the deadlocks are: We are able to use protocol to prevent or avoid the deadlock, make sure tha

Linked list allocation using index The blocks don't have a fixed size. Pointers are utilized to point to the next block in a file. The pointers are set aside as a separate tabl

Problem 1. List out the conditions that result in Deadlock situations. Illustrate deadlock situation with a simple graphical notation Listing conditions for deadlock occu