definition of User-Level Thread?, Basic Computer Science

User-level threads apply in user-level libraries, before via systems calls, so thread switching does not require to call operating system and to cause interrupt to the kernel. Actually, the kernel knows nothing about user-level threads and handles them as if they were single-threaded processes.
Advantages of User-Level Threads:
1. The most obvious benefit of this technique is that a user-level threads package can be implemented on an Operating System that does not support threads. Some other advantages are
2. A user-level thread does not require alteration to operating systems.
3. Straightforward Representation:
Each thread is represented simply by a registers, PC, stack and a small control block, all stored in the user process address space.
4. Fast and well-organized:
Thread switching is not much more costly than a procedure call.
5. Unproblematic Management:
This basically means that making a thread, switching between threads and synchronization between threads can all be done lacking of intervention of the kernel.

Disadvantages of User-Level Threads:
1. There is a short of coordination between threads and operating system kernel. Consequently, process as whole gets one time slice irrespective of whether process has one thread or 1000 threads within. It is up to every thread to relinquish control to other threads.
2. A user-level thread needs non-blocking systems call that means a multithreaded kernel. Or else, entire process will blocked in the kernel, even if there are run able threads left in the processes. For instance, if one thread causes a page fault, the process blocks.
Posted Date: 5/2/2012 7:02:15 AM | Location : United States







Related Discussions:- definition of User-Level Thread?, Assignment Help, Ask Question on definition of User-Level Thread?, Get Answer, Expert's Help, definition of User-Level Thread? Discussions

Write discussion on definition of User-Level Thread?
Your posts are moderated
Related Questions
Question 1 Discuss the two basic operational characteristics of RR Only an active route is redistributed Route redistribution does not impact local route selection

product of two numbers

Hill Climbing - artificial intelligence: As we've seen, in some particular problems, searching the search path from primly to goal state is the point of the exercise. In anothe

QUESTION (a) Describe what you understand by (i) "openness" and (ii) "Scalability" of a distributed system (b)What is the role of middleware in a distributed system? (c)

Diskless workstations:    Most people assume that the operating system is stored on a disk that is connected directly to the computer, but this is not necessarily true. If the

Online Searching: The real difference between manual searching and online searching lies, according to William A. Katz, in the mechanics and the jargon of the latter. However,


QUESTION We wish to use the Kaiser window method to design a discrete-time filter with generalized linear phase that meets specifications of the following form:

Definition of  Algorithm  An algorithm is a design or plan of obtaining a solution to a problem. The solution is presented by listing all steps in which they are carried out.

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no