Overview

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.

Full Product Details

9781848823174

Table of Contents

Reviews

<p>From the reviews: It will be useful not only to researchers in the fields of applied mathematics and computer science (CS), but also to researchers in other fields who want to develop parallel algorithms and applications. Overall, this unique book combines the characteristics of a teaching tool and a reference. The comprehensive bibliography, helpful notation sections, and clear style make it a valuable resource for scientists and engineers in other fields too, including computational physics and computational chemistry. (Alexander Izanov, ACM Computing Reviews, September, 2010)

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available