Optimal Load Balancing in Distributed Computer Systems
Published on 30. September 2011
Book
Paperback/Softback
XX, 251 pages
978-1-4471-1246-4 (ISBN)
Description
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.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1997
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Research
Illustrations
XX, 251 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
423 gr
ISBN-13
978-1-4471-1246-4 (9781447112464)
DOI
10.1007/978-1-4471-0969-3
Schweitzer Classification
Other editions
Additional editions
Hisao Kameda | Jie Li | Chonggun Kim
Optimal Load Balancing in Distributed Computer Systems
Book
12/1996
Springer
€85.55
Article exhausted; check different version
Content
1 Single Channel and Star Network Configurations.- 1.1 Introduction.- 1.2 Load Balancing in the Single Job Class Environment.- 1.3 Load Balancing in the Multi-class Job Environment.- 2 Overall vs. Individual Optimum.- 2.1 Introduction.- 2.2 Single Channel Communications Networks.- 2.3 Star Network Configurations.- 2.4 Multiclass Single Channel Networks.- 3 Tree Hierarchy Network Configurations.- 3.1 Introduction.- 3.2 Model Description and Problem Formulation.- 3.3 Optimal Load Balancing.- 3.4 Decomposability.- 3.5 Proposed Algorithm.- 3.6 Comparison of Algorithm Performance.- 3.7 Link Communication Time and Node Processing Time.- 3.8 Conclusion.- 4 Star Network with Two-way Traffic.- 4.1 Introduction.- 4.2 Model Description and Problem Formulation.- 4.3 Necessary and Sufficient Conditions.- 4.4 Proposed Algorithm.- 4.5 Parametric Analysis.- 4.6 A Numerical Example.- 4.7 Discussion.- 4.8 Conclusion.- 5 Tree Network with Two-way Traffic.- 5.1 Introduction.- 5.2 Model Description and Problem Formulation.- 5.3 Necessary and Sufficient Conditions.- 5.4 Decomposition.- 5.5 Proposed Algorithm.- 5.6 Comparison of Algorithm Performance.- 5.7 Conclusion.- 6 Uniqueness.- 6.1 Introduction.- 6.2 Description of the Model.- 6.3 The Overall Optimal Solution.- 6.4 The Individually Optimal Solution.- 6.5 Numerical Examples.- 6.6 Concluding Remarks.- 7 A Survey of Dynamic Load Balancing.- 8 Static vs. Dynamic.- 8.1 System Model.- 8.2 Static and Dynamic.- 8.3 Simulation Results.- 8.4 Discussion.