Timers could be utilized to compute the current time, Operating System

Q. Timers could be utilized to compute the current time. Provide a little description of how this could be accomplished.

Answer: A program could utilize the following approach to compute the current time using timer interrupts. The program could set a timer for a while in the future and go to sleep. When it is wake by the interrupt it could update its local state which it is using to keep track of the number of interrupts it has received thus far. It could then replicate this process of continually setting timer interrupts and updating its local state when the interrupts are actually raised.

Posted Date: 7/27/2013 2:14:40 AM | Location : United States







Related Discussions:- Timers could be utilized to compute the current time, Assignment Help, Ask Question on Timers could be utilized to compute the current time, Get Answer, Expert's Help, Timers could be utilized to compute the current time Discussions

Write discussion on Timers could be utilized to compute the current time
Your posts are moderated
Related Questions
Ask using a laballed diagram explaining the architecture of windows operating ststem


What are the disadvantages of swapping technique used in pre-3BSD UNIX systems? If there is excessively much memory contention, processes are swapped out until sufficient

what topic i choose for os research proposal

Define the Global vs. local variables It is also important to discuss the scope of resources being granted to the application program.  Variable scoping is defined as the acces

trace the historical evolution of the operations managent from themainly rural agricultural era of the artisans to the present day industrial revolution, high technoligical advance

Two Level Directory This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users. In this kind of s

A UNIX file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contains 10 direct entries, and one single, double, and triple indirect entry

p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 0014

Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc