Is it essential to bind a real-time thread to an lwp, Operating System

Q. Presume an operating system maps user-level threads to the kernel using the many-to-many model and the mapping is done through LWPs. Additionally the system allows developers to create real-time threads. Is it essential to bind a real-time thread to an LWP? Elucidate.

Answer: Yes Timing is critical to real-time applications. If a thread is marked like real-time but is not bound to an LWP the thread may have to wait to be attached to an LWP previous to running. Regard as if a real-time thread is running (is attached to an LWP) in addition to then proceeds to block (i.e. must perform I/O has been pre-empted by a higher-priority real-time thread is waiting for a mutual exclusion lock etc.) While the real-time thread is blocked-up the LWP it was attached to has been assigned to another thread. While the real-time thread has been scheduled to run again it should first wait to be attached to an LWP. Through binding an LWP to a real time thread you are making sure the thread will be able to run with minimal delay once it is scheduled.

Posted Date: 7/27/2013 2:37:39 AM | Location : United States







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

Write discussion on Is it essential to bind a real-time thread to an lwp
Your posts are moderated
Related Questions
Q. Explain about diffrent Process State? Process State When process executes, it changes its state. Process state is defined as the current activity of the process. Fi

Q. Why might a system utilize interrupt-driven I/O to manage a single serial port however polling I/O to manage a front-end processor such as a terminal concentrator? A


EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p

What is a semaphore? A semaphore 'S' is a synchronization tool which is  an integer value that, apart from initialization, is accessed only by two standard atomic operations; w

Q. Explain about Error detection method? Error detection: error can occur in CPU, in I/O devices or in memory hardware. Operating system constantly needs to be aware of possi

Debugging a multi threaded program The following list points out few of the more frequent oversights and errors that can cause bugs in multithreaded programs. 1.    Ephemeral

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