SENSITIVITY STUDY OF THE LOAD BALANCING ALGORITHM IN A DISTRIBUTED SYSTEM

被引：4

作者：

HAC, A ^{[1
]}

JOHNSON, TJ ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1990年 / 10卷 / 01期

关键词：

D O I：

10.1016/0743-7315(90)90009-E

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper explains the sensitivity of load balancing performance in a distributed system. The focus of this study is load balancing and its relation to optimal process and read site placement. The system model is based on the LOCUS distributed file system. This system allows replicated files. Process migration is included in the simulation system model. Synchronization policy is enforced by the CSS (Centralized Synchronization Sites) program. All requests to open a file for access must be sent to the file's CSS. The CSS checks for access conflicts. An algorithm that increases system performance through load balancing is provided. This algorithm bases its decisions on data collected by the system. Sensitivity of the algorithm characteristics and performance are analyzed and discussed. © 1990.

引用

页码：85 / 89

页数：5

共 5 条

[1] A COMPARISON OF RECEIVER-INITIATED AND SENDER-INITIATED ADAPTIVE LOAD SHARING [J].