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.
Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper
Define entry section and exit section. The critical section problem is to design a protocol that the processes can use to cooperate. Every process must request permission to e
We are use to using variables within C without thinking about where they are stored. Most variables are dynamic i.e. can change, therefore they are stored in Ram, unlike a program
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
A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 ton
Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c
I need help
Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri
What is the hardware support required to implement paging? Each operating system has its own techniques for storing page tables. The majority allocates a page table for each pr
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
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