Distributed and multiprocessor scheduling

Steve J. Chapin, Jon B. Weissman

Research output: Chapter in Book/Entry/PoemChapter


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 languageEnglish (US)
Title of host publicationComputer Science Handbook, Second Edition
PublisherCRC Press
ISBN (Electronic)9780203494455
ISBN (Print)9781584883609
StatePublished - Jan 1 2004

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Distributed and multiprocessor scheduling'. Together they form a unique fingerprint.

Cite this