Research Initiation: Performance Evaluation of Distributed Algorithms

本研究旨在发展一个模拟实验平台，以研究性能 分布式算法的问题在一个全面的方式。 一些 的分布式算法已经被设计来解决一些 分布式计算的核心问题，比如排斥， 同步和死锁检测。 然而，几乎没有任何努力 一直致力于研究，试图预测的性能， 这些算法在不同的操作条件下。 研究 将确定一组通用的性能指标， 影响不同算法性能的因素。 基于 上述指标，仿真试验台将用于实现两个 目标：对于给定的问题（例如，同步）和操作 条件（例如，完全连接的网络拓扑）标识“最佳” 可用的算法;使用性能结果来开发一个 假设来表达分布式算法的复杂性， 定量地比较给定问题的不同算法。 的 研究将集中在一系列问题上，这些问题已经通过使用 已知算法的不同组合和扩展。 性能 将采用模块化的“积木式”方法开发模型， 利用这些问题的解决方案中的共性。

This research aims to develop a simulation testbed to study performance issues of distributed algorithms in a comprehensive manner. A number of distributed algorithms have been designed to solve some of the central problems of distributed computing like exclusion, synchronization, and deadlock detection. However, little effort has been devoted to studies that attempt to predict the performance of these algorithms under different operating conditions. The research will identify a common set of performance metrics and the primary factors that affect performance of different algorithms. Based on the above metrics, the simulation testbed will be used to achieve two objectives: for given problem (example, synchronization) and operating conditions (example, fully connected network topology) identify "best" available algorithm; use the performance results to develop a hypothesis to express the complexity of distributed algorithms and to quantitatively compare different algorithms for a given problem. The study will focus on a set of problems, which have been solved by using different combinations and extensions of known algorithms. Performance models will be developed using a modular, "building block" approach to exploit the commonality in the solution of these problems.