[1]郭双宙,徐济惠.基于深度优先的分步分治算法研究[J].计算机技术与发展,2014,24(06):131-135.
　GUO Shuang-zhou,XU Ji-hui.Research on Algorithm Based on Depth First Search and Task Partition[J].,2014,24(06):131-135.
点击复制

基于深度优先的分步分治算法研究()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
24
期数:
2014年06期
页码:
131-135
栏目:
智能、算法、系统工程
出版日期:
2014-06-30

文章信息/Info

Title:
Research on Algorithm Based on Depth First Search and Task Partition
文章编号:
1673-629X（2014）06-0131-05
作者:
郭双宙; 徐济惠
宁波城市学院
Author(s):
GUO Shuang-zhou; XU Ji-hui
关键词:
服务组合; 关键路径; 服务筛选; top-k
Keywords:
service composition; critical path; service filter; top-k
分类号:
TP311
文献标志码:
A
摘要:
Top-k服务组合问题对于学术界和工业界来讲，都有实际的研究意义和应用场景。文中分析了理解top-k问题的关键所在解图，提出了基于深度优先的分步分治算法进行服务组合。该算法对用户请求的输出参数分别进行求解，该过程可并行处理，在求解结束后再进行合并。该方法可以支持分布式、并行处理框架，从而在应对大规模的服务集合时，能快速、高效地提供满足用户需求的组合服务；提出了通过构造解图的方法进行搜索求解，通过求解“关键路径”和“非关键路径”与合并“关键路径”和“非关键路径”得到解图。
Abstract:
Top-k service composition problem has the actual research significance and application scenarios for academia and industry. Analyze the key solution graphs of top-k problems in this paper,propose an algorithm based on depth first search and task partition. This algorithm first solves the user request separately which can be parallel processing,and then merge this solutions to provide a complete so-lution for the user request. This algorithm can support distribute and parallel framework,quickly and efficiently provide the service com-position satisfies the user need when facing large scale service sets. Propose the method to construct solution graphs to search solutions, through solving critical path and no-critical path and merge critical and no-critical paths to gain solution graph.

相似文献/References:

[1]戴雪梅 姜浩.基于带权图规划算法的语义Web服务组合[J].计算机技术与发展,2010,(03):67.
　DAI Xue-mei,JIANG Hao.Semantic Web Services Composition Based on Weighted Planning Graph Algorithm[J].,2010,(06):67.
[2]杭志 徐德智 胡春华.移动电子商务中的服务组合研究[J].计算机技术与发展,2010,(04):187.
　HANG Zhi,XU De-zhi,HU Chun-hua.Research of Service Component in M - Commerce[J].,2010,(06):187.
[3]严娜 黄映辉.基于模板和上下文的语义Web服务动态组合[J].计算机技术与发展,2009,(12):89.
　YAN Na,HUANG Ying-hui.Semantic Web Services Dynamic Composition Based on Templet and Context[J].,2009,(06):89.
[4]汤萍萍 王红兵.基于强化学习的Web服务组合[J].计算机技术与发展,2008,(03):142.
　TANG Ping-ping,WANG Hong-bing.Web Service Composition Based on Reinforcement -Learning[J].,2008,(06):142.
[5]肖青 杨长兴 杨炼.一种基于遗传算法的网格任务调度算法[J].计算机技术与发展,2008,(08):32.
　XIAO Qing,YANG Chang-xing,YANG Lian.Grid Task Scheduling with an Improved Genetic Algorithm[J].,2008,(06):32.
[6]李杜 陈松乔.基于语义的动态服务组织模型[J].计算机技术与发展,2008,(11):32.
　LI Du,CHEN Song-qiao.Dynamic Organization Model of Services Based on Semantic[J].,2008,(06):32.
[7]韩咚 陈波.基于时间Petri网的多处理机的调度算法[J].计算机技术与发展,2007,(06):15.
　HAN Dong,CHEN Bo.Algorithm of Multiprocessor Scheduling Based on Time Petri Nets[J].,2007,(06):15.
[8]周云 贺毅辉 刘志忠 杨楠.基于模板的服务选择方法[J].计算机技术与发展,2012,(06):114.
　ZHOU Yun,HE Yi-hui,LIU Zhi-zhong,et al.Method of Web Service Selection Based on Template[J].,2012,(06):114.
[9]管有庆,程强.Web服务组合事务处理研究与实现[J].计算机技术与发展,2013,(11):77.
　GUAN You-qing,CHENG Qiang.Research and Implementation of Web Service Composition Transaction Processing[J].,2013,(06):77.
[10]王玉标,饶锡如.Web服务质量建模及其正确性验证[J].计算机技术与发展,2014,24(01):18.
　WANG Yu-biao[],RAO Xi-ru[].Modeling and Correctness Verification for Quality of Web Service[J].,2014,24(06):18.

更新日期/Last Update: 1900-01-01