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. Can a system detect that some of its processes are starving? If you answer "yes," explain how it can. If you answer "no," explain how the system can deal with the starvation problem.
Answer: Starvation is a difficult topic to define as it may signify different things for different systems. For the cause of this question we will define starvation as the situation whereby a process must wait beyond a reasonable period of time-perhaps indefinitely-prior to receiving a requested resource. One way of noticing starvation would be to first identify a period of time-T-that is considered unreasonable. When a process desires a resource a timer is started. If the elapsed times go beyond T then the process is considered to be starved.
One approach for dealing with starvation would be to adopt a policy where resources are assigned only to the process that has been waiting the longest. For instance if process Pa has been waiting longer for resource X than process Pb the request from process Pb would be deferred until process Pa's request has been satisfied.
An additional strategy would be less strict than what was just mentioned. In this situation a resource might be granted to a process that has waited less than another process providing that the other process isn't starving. Nevertheless if another process is considered to be starving its request would be satisfied first.
Scalability : Scalability is the competence of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non-sc
Q. Consider the subsequent page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would take place for the following replace
As we already know, threadsmust ensure consistency; otherwise, race conditions (non-deterministic results) might happen. Now consider the "too much milk problem": two people share
What are threads? A thread - sometimes called as an implementation context or a lightweight process - is a single sequential flow of control within a program. We use threads
discuss unsafe state in operating system
Facilities of a Debug Monitor Facilities of a debug monitor are like this: Setting breakpoints in the program Initiating a debug conversation while control reaches
Write short note on compression regarding the file system in Windows 2000. NTFS is able to perform data compression on individual files or on all data files in a directory. To
Question: a) What is an Input/Output module and what are the five categories their functions fall into? b) What is an Operating System? Briefly describe the two objectives
How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll
acyclic graph directories
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