检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用》2006年第9期2166-2168,2171,共4页journal of Computer Applications
摘 要:研究了工作流中时间分配问题。在具体活动基础上增加标记活动,以记录所在路由分支的资源使用情况;将时间看作一种不可更新资源,并将时间资源分为私有资源、公有资源和双重资源三类;提出了一种路由结构的时间资源分析方法和分配算法,根据不同路由分支的特点及初始分配资源在实际执行过程中的使用情况,通过裂变与聚合进行时间资源再分配,保证整个工作流的顺利完成。通过实例说明工作流图中时间资源分配过程。Time allocation in workflow was studied. Firstly, labeled activities were added in order to make records of the resources usage on each route origin. Secondly, time was regarded as a kind of non-renewable resources, and was classified into three types; private, public and mixed. Thirdly, an approach for time resource analysis and allocation was proposed. In the beginning, time resource was pre-allocated according to the characteristics of different routing, then during the process of actual operation, time resource was reallocated according to time consuming situation by the method of splitting and converging. Finally, a case study illustrated the time resource allocation process in workflow graph.
分 类 号:TP302[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7