摘要
远程过程调用 ＲＰＣ （Ｒｅｍ ｏｔｅ Ｐｒｏｃｅｄｕｒｅ Ｃａｌｌ）是分布式系统中机间通讯的一种重要手段．分布式系统的性能很大程度上依赖于ＲＰＣ响应时间．使用回归模型和队列模型可对ＲＰＣ响应时间进行分析．但是回归模型不能很好地反映ＲＰＣ设计变化对响应时间的影响，而队列模型又要求对系统作较多的假设．针对以上模型的不足，本文提出用有穷状态迁移图构造ＲＰＣ模型，并给出了一个基于状态图的求解ＲＰＣ 最大响应时间的算法．经过证明和时间复杂性分析。
RPC is an important means of communications between machines in distributed systems. The performance of distributed systems significantly depends on RPC response time which can be analyzed by regression model and queuing model. Unfortunately, Regression model does not provide guidance when investigating the impact of RPC design alternatives on response time. Queuing model requires making many assumptions for systems. Aiming at the shortcomings of the two models, a Finite State Transition Graph (FSTG) is presented to model RPC in this paper. An algorithm based on FSTG for solvingthe maximum RPC response time is also presented. By proving and complexity analysis, the algorithm is correct and effective.
出处
《小型微型计算机系统》
CSCD
北大核心
1999年第12期890-892,共3页
Journal of Chinese Computer Systems
关键词
分布式系统
响应时间
状态迁移图
算法
RPC
Distributed systems RPC Response time State transition graph Algorithm
