In Chapter 5, we discussed possible race conditions on various kerneldata structures
Chapter 6, Problem 6.13(choose chapter or problem)
In Chapter 5, we discussed possible race conditions on various kerneldata structures. Most scheduling algorithms maintain a run queue,which lists processes eligible to run on a processor. On multicore systems,there are two general options: (1) each processing core has its own run queue, or (2) a single run queue is shared by all processing cores. Whatare the advantages and disadvantages of each of these approaches?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer