Titlebook: Optimal Load Balancing in Distributed Computer Systems; Hisao Kameda,Jie Li,Yongbing Zhang Book 1997 Springer-Verlag London Limited 1997 H

Awning

領(lǐng)巾

lethal

Load Balancing in Tree Hierarchy Network Configurations,h server-type workstations each of which is connected with client-type workstations and personal computers, etc. Since the tree hierarchy network configuration is extensible and flexible, it is an important configuration in the literature. The star networks are special examples of the tree hierarchy networks.

DIS

Load Balancing in Tree Network Configurations with Two-way Traffic,ea networks. Note that in cascade star networks and coupled star network, there is two-way traffic in any links. All star network configurations with two-way, cascade star network configurations and coupled star network configurations are examples of tree network configurations with two-way traffic.

FAST

Overall Optimal Load Balancing vs. Individually Optimal Load Balancing,n expected job response time, given the expected node and communication delays. We refer to the solution as the .. Wardrop considered this policy in traffic assignment problems [War52]. In the context of distributed computer systems, the policy has been studied by Kameda and Hazeyama [KH88].

Palate

Indigence

付出

1431-9403 ters. 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 conj

medieval

懸崖

Book 1997ng, 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.