Already have an account? Get multiple benefits of using own account!
Login in your account..!
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. In following Section we mentioned that disabling interrupts frequently could affect the system's clock. Describe why it could and how such effects could be minimized.
Answer: The system clock is updated at each clock interrupt. If interrupts were hindered-particularly for a long period of time-it is probable the system clock could easily lose the correct time. The system clock is as well used for scheduling purposes. For instance the time quantum for a process is expressed as a number of clock ticks. At each clock interrupt the scheduler determines if the time quantum for the currently running process has expired. If clock interrupts were hindered the scheduler couldn't accurately assign time quantum. This effect can be minimized by disabling clock interrupts for only very short periods.
For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re
What is the use of fork and exec system calls? Fork is a system call by which a latest process is created. Exec is also a system call, which is used after a fork by one of the
what are the overall concepts of deadlock
An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum
What is graceful degradation? In multiprocessor systems, failure of single processor will not halt the system, but only slow it down by sharing the work of failure system by ot
Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory
Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c
Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo
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!
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd