Scheduling Parallel Applications on Heterogeneous Distributed Systems (Paperback, 1st ed. 2019)

This book focuses on scheduling algorithms for parallel applications on heterogeneous distributed systems, and addresses key scheduling requirements - high performance, low energy consumption, real time, and high reliability - from the perspectives of both theory and engineering practice. Further, it examines two typical application cases in automotive cyber-physical systems and cloud systems in detail, and discusses scheduling challenges in connection with resource costs, reliability and low energy. The book offers a comprehensive and systematic treatment of high-performance, low energy consumption, and high reliability issues on heterogeneous distributed systems, making it a particularly valuable resource for researchers, engineers and graduate students in the fields of computer science and engineering, information science and engineering, and automotive engineering, etc. The wealth of motivational examples with figures and tables make it easy to understand.

General

Imprint:	Springer Verlag, Singapore
Country of origin:	Singapore
Release date:	November 2020
First published:	2019
Authors:	Guoqi Xie • Gang Zeng • Renfa Li • Keqin Li
Dimensions:	235 x 155mm (L x W)
Format:	Paperback
Pages:	246
Edition:	1st ed. 2019
ISBN-13:	978-981-13-6559-1
Categories:	Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > General Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General Promotions
LSN:	981-13-6559-8
Barcode:	9789811365591

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!