Analysis of the Effects of Delays on Load Sharing
Analysis of the Effects of Delays on Load Sharing
复制标题
DOI：
10.1109/12.42124
复制
发表时间：
1989-11
期刊：
影响因子：
--
通讯作者：
R. Mirchandaney;D. Towsley;J. Stankovic
中科院分区：
文献类型：
--
作者：
R. Mirchandaney;D. Towsley;J. Stankovic
研究了分布式系统中简单负载分担算法的性能特点。在所考虑的系统中，假设在将任务从一个节点传输到另一个节点以及在收集远程状态信息时遇到不可忽略的延迟。由于这些延迟，负载共享算法收集的状态信息在做出负载共享决策时已过时。作者分析了这些延迟对前向、反向和对称三种算法性能的影响。在假设每个节点的任务到达过程为泊松过程、服务时间和任务转移时间服从指数分布的前提下，建立了在同构系统中运行的各种算法的排队论模型。利用矩阵几何求解技术对每个模型进行求解，并对重要的性能指标进行了推导和研究。>；
The authors study the performance characteristics of simple load-sharing algorithms for distributed systems. In the systems under consideration, it is assumed that nonnegligible delays are encountered in transferring tasks from one node to another and in gathering remote state information. Because of these delays, the state information gathered by the load-sharing algorithms is out of date by the time the load-sharing decisions are taken. The authors analyze the effects of these delays on the performance of three algorithms, called forward, reverse, and symmetric. They formulate queueing-theoretic models for each of the algorithms operating in a homogeneous system under the assumption that the task arrival process at each node is Poisson and the service times and task transfer times are exponentially distributed. Each of the models is solved using the matrix-geometric solution technique, and the important performance metrics are derived and studied. >