Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.
How could we implement locks? No matter how we choose to implement them, we must have some hardware support. One possibility for implementing locks on a uniprocessor machine is is
Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add
While it is hard to resolve a deadlock which has been detected, fortunately it is fairly easy to prevent deadlocks from ever happening. The key is that the conditions above for dea
Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a
Explain Threads for Executing Concurrent Application Code The thread has been introduced in many operating systems as an efficient mechanism for executing concurrent applicatio
We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to
What is area moment
Explain Swapping Swapping is a method of temporarily removing inactive programs from the memory of computer system.
Is disk scheduling, other than FCFS scheduling, useful in a single-user environment? Explain your answer. In a single-user environment, the I/O queue usually is blank. Requests
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd