Optimal Load Balancing in Distributed Computer Systems: Telecommunication Networks and Computer Systems
Autor Hisao Kameda, Jie Li, Chonggun Kim, Yongbing Zhangen Limba Engleză Paperback – 30 sep 2011
Preț: 379.22 lei
Nou
Puncte Express: 569
Preț estimativ în valută:
72.58€ • 75.44$ • 60.12£
72.58€ • 75.44$ • 60.12£
Carte tipărită la comandă
Livrare economică 04-18 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781447112464
ISBN-10: 1447112466
Pagini: 276
Ilustrații: XX, 251 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1997
Editura: SPRINGER LONDON
Colecția Springer
Seria Telecommunication Networks and Computer Systems
Locul publicării:London, United Kingdom
ISBN-10: 1447112466
Pagini: 276
Ilustrații: XX, 251 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1997
Editura: SPRINGER LONDON
Colecția Springer
Seria Telecommunication Networks and Computer Systems
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
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.