edited by
7,498 views
7 7 votes

Dispatch latency is defined as

  1. the speed of dispatching a process from running to the ready state
  2. the time of dispatching a process from running to ready state and keeping the CPU idle
  3. the time to stop one process and start running another one
  4. none of these

2 Answers

1 1 vote

The correct answer is:

The time to stop one process and start running another one

Dispatch can done by dispatcher So the time taken by dispatcher is known as dispatch latency. The dispatcher do context switching. 

Dispatch latency refers to the time taken by the operating system to switch from one process to another. It includes the time to save the state of the old process, load the state of the new process, and perform other necessary bookkeeping.

Answer:
Position:
Show:

Related questions

10 10 votes
4 4 answers
9.2k
9.2k views
Satbir asked Jan 13, 2020
9,231 views
The operating system and the other processes are protected from being modified by an already running process becausethey run at different time instants and not in paralle...
5 5 votes
3 3 answers
6.3k
6.3k views
Satbir asked Jan 13, 2020
6,295 views
What is compaction refers toa technique for overcoming internal fragmentationa paging techniquea technique for overcoming external fragmentationa technique for compressin...
3 3 votes
3 3 answers
3.9k
3.9k views
Satbir asked Jan 13, 2020
3,889 views
An aid to determine the deadlock occurrence isresource allocation graphstarvation graphinversion graphnone of the above
2 2 votes
2 2 answers
7.0k
7.0k views
Satbir asked Jan 13, 2020
6,982 views
Which of the following algorithms defines time quantum?shortest job scheduling algorithmround robin scheduling algorithmpriority scheduling algorithmmultilevel queue sche...