Optimal Load Balancing in Distributed Computer Systems (Paperback, Softcover reprint of the original 1st ed. 1997)

An important consideration in improving the performance of a distributed computer system is the balancing of the load between the host computers. Load balancing may be either static or dynamic; static balancing strategies are generally based on information about the system's average behavior rather than its actual current state, while dynamic strategies react to the current state when making transfer decisions. Although it is often conjectured that dynamic load balancing outperforms static, careful investigation shows that this view is not always valid. Recent research on the problem of optimal static load balancing is clearly and intuitively presented, with coverage of distributed computer system models, problem formulation in load balancing, and effective algorithms for implementing optimization. Providing a thorough understanding of both static and dynamic strategies, this book will be of interest to all researchers and practitioners working to optimize performance in distributed computer systems.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Series:	Telecommunication Networks and Computer Systems
Release date:	September 2011
First published:	1997
Authors:	Hisao Kameda • Jie Li • Chong-Gun Kim • Yongbing Zhang
Dimensions:	235 x 155 x 14mm (L x W x T)
Format:	Paperback
Pages:	251
Edition:	Softcover reprint of the original 1st ed. 1997
ISBN-13:	978-1-4471-1246-4
Categories:	Books > Computing & IT > Internet > Network computers Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General Promotions
LSN:	1-4471-1246-6
Barcode:	9781447112464

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!