This chapter discusses CPU scheduling in parallel and distributed systems. CPU scheduling is part of a broader class of resource allocation problems, and is probably the most carefully studied such problem. The main motivation for multiprocessor scheduling is the desire for increased speed in the execution of a workload. Parts of the workload, called tasks, can be spread across several processors and thus be executed more quickly than on a single processor. In this chapter we examine techniques for providing this facility.
|Original language||English (US)|
|Title of host publication||Computer Science Handbook, Second Edition|
|State||Published - Jan 1 2004|