Apress

Scheduling for Parallel Processing

By Maciej Drozdowski

Scheduling for Parallel Processing Cover Image

This book presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems. It also provides helpful generalizations about scheduling models.

Full Description

  • ISBN13: 978-1-8488-2309-9
  • 404 Pages
  • User Level: Science
  • Publication Date: March 14, 2010
  • Available eBook Formats: PDF
  • eBook Price: $169.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
This book presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems. The book also provides helpful generalizations about scheduling models. Features: Introduces the fundamental scheduling concepts; Discusses the technological aspects of scheduling for parallel processing; Presents the notions, concepts, and algorithms that are most immediately applicable in parallel processing; Examines the parallel task model; Outlines the methodology of computational complexity theory and introduces the basic metrics of parallel application performance; Explores scheduling with communication delays; Examines scheduling divisible loads in systems with limited memory, various interconnection types, and cost of usage; Includes detailed illustrations, a bibliography, and a notation section. This text will be valuable for researchers in parallel computing, operating systems, management science, and applied mathematics.
Table of Contents

Table of Contents

  1. Introduction.
  2. Basics.
  3. Vision of Scheduling in Parallel Systems.
  4. Classic Scheduling Theory.
  5. Parallel Tasks.
  6. Scheduling with Communication Delays.
  7. Divisible Loads.
  8. Back to Scheduling Models.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published