Multiprocessor Scheduling (Advanced)

← Back to document page

10Multiprocessor Scheduling (Advanced)This chapter will introduce the basics ofmultiprocessor Scheduling . Asthis topic is relatively advanced, it may be best to cover itafteryou havestudied the topic of concurrency in some detail ( , the second major easy piece of the book).After years of existence only in the high-end of the computing spec-trum,multiprocessorsystems are increasingly commonplace, and havefound their way into desktop machines, laptops, and even mobile de-vices. The rise of themulticoreprocessor, in which multiple CPU coresare packed onto a single chip, is the source of this proliferation;thesechips have become popular as computer architects have had a difficulttime making a single CPU much faster without using (way) too muchpower. And thus we all now have a few CPUs available to us, which is agood thing, right?Of course, there are many difficulties that arise with the arrival of morethan a single CPU.

4 MULTIPROCESSOR SCHEDULING (ADVANCED) value D. The program then modifies the value at address A, just updat-ing its cache with the new value D′; writing the data through all the way to main memory is slow, so the system will (usually) do that later.

  Address