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.
What is external fragmentation? As process are removed from and loaded to the memory free memory space is bracken into pieces .external fragmentation take place when enough mem
Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv
What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type
LINUX VS WINDOWS I/O MANAGEMENT
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best
You must use fork and pipe to complete this project. This project creates processes to add all numbers in a file. The user will enter a number (1, 2, or 4) of parallel processes
What are the different files attributes? File name:-it's the name of the file. It's the name with which the user identifies. Identifiers:-it's created when a file is created
What is critical section problem? Consider a system consists of 'n' processes. Every process has segment of code called a critical section, in which the process might be changi
Write a short note on disk scheduling One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from 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