Home > Articles > Operating Systems, Server > Linux/UNIX/Open Source

  • Print
  • + Share This
This chapter is from the book


  1. How does Linux notify the scheduler to run periodically?

  2. Describe the difference between interactive and non-interactive processes.

  3. With respect to the scheduler, what’s special about real-time processes?

  4. What happens when a process runs out of scheduler ticks?

  5. What’s the advantage of an O(1) scheduler?

  6. What kind of data structure does the scheduler use to manage the priority of the processes running on a system?

  7. What happens if you were to call schedule() while holding a spinlock?

  8. How does the kernel decide whether a kernel task can be implicitly preempted?

For more information on Linux, visit our Linux Reference Guide or sign up for our Linux Newsletter

  • + Share This
  • 🔖 Save To Your Account