多阶段服务模型中关键路径算法的研究  

Study on critical path algorithm in multi-stage service model

作　　者：汪剑[1] 周明天[1] 佘堃[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054

出　　处：《计算机应用》2007年第12期3122-3125,共4页journal of Computer Applications

基　　金：国家"十一五"科技支撑计划现代服务业服务交互支撑平台子课题研究(2006BAH02A0407)

摘　　要：针对多阶段服务模型的特点,介绍了如何为多阶段服务模型建立相应的工作流分析模型,提出了一种改进的关键路径分析算法,增加了对工作流模型中常见结构的支持。算法将工作流网看作一个M/M/n有限等待队列网并讨论了工作流活动在各种常见结构中的到达率与时间延迟。通过该算法可以计算出模型中平均执行时延最长的路径,为系统性能优化提供依据。Concerning the characteristics of multi-stage service model, the method of building the corresponding workflow model for the multi-stage service model was introduced. An improved critical path algorithm, which added support to common structures in a workflow model, was discussed. In this algorithm, the workflow model was viewed as an M/M/n limited waiting queue network and the request arrival rate and execution time duration of activities in various common structures were discussed. Through this algorithm, the path with the longest average execution time could be calculated and this provided a basis for system performance optimization.

关 键 词：阶段 工作流模型 关键路径 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]