Bind a real-time thread to an lwp, Operating System

Q. Suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of LWPs. In addition the system allows program developers to create real-time threads. Is it essential to bind a real-time thread to an LWP?

Answer: Yes or else a user thread may have to compete for an available LWP prior to being actually scheduled. Through binding the user thread to an LWP there is no latency while waiting for an available LWP the real-time user thread can be scheduled immediately.

Posted Date: 7/27/2013 2:45:11 AM | Location : United States







Related Discussions:- Bind a real-time thread to an lwp, Assignment Help, Ask Question on Bind a real-time thread to an lwp, Get Answer, Expert's Help, Bind a real-time thread to an lwp Discussions

Write discussion on Bind a real-time thread to an lwp
Your posts are moderated
Related Questions
What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1.      Single level directory 2.      Two level directory

Define UnixWare UnixWare manages resources at the process level. Each resource allocated to the application is actually allocated to the process representing the application. C


Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain working of the logical file system The logical file system manages metadata information. Metadata contains all of the file-system structure, excluding actual data. It h

Examining the write/cycles as shown below We can see that the bus is designed for asynchronous read/write cycles. The operation of the write cycle is simple in that the add

socket based fortune teller sever.your program should create a server that listens to a specific port when a client receives a connection the server should respond with a random fo

Recall that condition variables are synchronization primitives that enable threads to wait until a particular condition occurs. Generalizing, the combination of locks and condit

In modern operating systems, applications do not directly access the physical memory. Instead, they use so-called virtual memory, where each virtual address is translated to a phys

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p