adplus-dvertising
frame-decoration

Question

Event latency is :

a.

the amount of time an event takes to occur from when the system started

b.

the amount of time from the event occurance till the system stops

c.

the amount of time from event occurance till the event crashes

d.

the amount of time that elapses from when an event occurs to when it is serviced.

Posted under Operating System

Answer: (d).the amount of time that elapses from when an event occurs to when it is serviced.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Event latency is :

Similar Questions

Discover Related MCQs

Q. Interrupt latency refers to the period of time :

Q. Real time systems need to __________ the interrupt latency.

Q. The amount of time required for the scheduling dispatcher to stop one process and start another is known as ______________

Q. The most effective technique to keep dispatch latency low is to :

Q. Priority inversion is solved by use of _____________

Q. In a real time system the computer results :

Q. In a safety critical system, incorrect operation :

Q. Antilock brake systems, flight management systems, pacemakers are examples of :

Q. In a ______ real time system, it is guaranteed that critical real time tasks will be completed within their deadlines.

Q. Some of the properties of real time systems include :

Q. The amount of memory in a real time system is generally :

Q. The priority of a real time task :

Q. Memory management units :

Q. The technique in which the CPU generates physical addresses directly is known as :

Q. Earliest deadline first algorithm assigns priorities according to :

Q. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is :

Q. Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to :

Q. T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. A will have ______ percent of the total processor time.

Q. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. B will have ______ percent of the total processor time.