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.