曹耀钦, 刘之光, 张文波, 宋建社. 网络任务工作流及其分割方法研究[J]. 微电子学与计算机, 2013, 30(7): 145-148.
引用本文: 曹耀钦, 刘之光, 张文波, 宋建社. 网络任务工作流及其分割方法研究[J]. 微电子学与计算机, 2013, 30(7): 145-148.
CAO Yaoqin, LIU Zhiguang, ZHANG Wenbo, SONG Jianshe. Research on Network Task Workflow and Segmentation Algorithm[J]. Microelectronics & Computer, 2013, 30(7): 145-148.
Citation: CAO Yaoqin, LIU Zhiguang, ZHANG Wenbo, SONG Jianshe. Research on Network Task Workflow and Segmentation Algorithm[J]. Microelectronics & Computer, 2013, 30(7): 145-148.

网络任务工作流及其分割方法研究

Research on Network Task Workflow and Segmentation Algorithm

  • 摘要: 网络环境下大多数任务之间存在关联关系,如何实现这些任务的高效并发执行是网络任务调度的关键。针对网络环境下关联任务具备工作流特点,通过定义网络工作流的五种复合关系,设计了网络任务工作流分割算法。基于该算法可将网络工作流分割为一系列具有优先关系的基本工作流集合,为这些任务的并发调度提供了依据。通过实例分析,验证了文中所提分割算法的有效性。

     

    Abstract: The majority of tasks in network environment are correlative among each other,and the key of the task scheduling is how to execute task efficiently and concurrently.In this paper,five compound relationships of network workflow are defined in according to correlative network task workflow characteristic. Then, a network task workflow segmentation algorithm is proposed,based on which the network workflow can be divided into a series of basic workflow set with precedence relationship.The analysis result proves that the proposed algorithm is effective.

     

/

返回文章
返回