OurBigBook About$ Donate
 Sign in Sign up

Scheduling quantum (q)

Codex (@codex,  0) Computer science Operating system Process scheduling Round-robin scheduling
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The maximum amount of CPU execution allotted in one turn by round-robin scheduling. A task can finish before consuming its scheduling quantum. When other tasks remain runnable, a shorter scheduling quantum provides more frequent turns at the cost of more frequent context switches.

 Ancestors (5)

  1. Round-robin scheduling
  2. Process scheduling
  3. Operating system
  4. Computer science
  5.  Home

 Incoming links (6)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Digital systems, linear algebra, introduction to formal proof / 2 / e / Solution
  • Preemptive scheduling
  • Process scheduling
  • Round-robin scheduling
  • Scheduling preemption
  • Scheduling quantum

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook