国防科学技术大学计算机学院,湖南,长沙,410073
纸质出版:2007
移动端阅览
任 怡, 吴泉源, 戴华东, 等. 一种基于QoS的事务工作流并发调度算法[J]. 电子学报, 2007,35(4):621-628.
REN Yi, WU Quan-yuan, DAI Hua-dong, et al. A QoS-Based Scheduling Algorithm for Concurrent Transactional Workflows[J]. Acta Electronica Sinica, 2007, 35(4): 621-628.
并发冲突引起的连锁夭折会降低系统性能
提出了一种基于QoS的事务工作流调度算法
该算法适应异构环境需求
支持基于QoS的延迟调度优化策略和SAFE集合扩充优化策略
可根据QoS参数调整相应的调度决策
在保证分布异构环境中复杂事务工作流并发正确性的同时减少连锁夭折.证明了算法不会引起循环等待和饿死现象
可保证调度的可串行性和可恢复性
性能模拟表明该算法适用于长期运行的事务工作流的并发调度
可有效减少连锁夭折
从而减少由此带来的性能损失.
Data consistency must be kept to ensure correct concurrency when there are conflicts between concurrent transactional workflows.Cascading aborts caused by those conflicts will increase execution costs
especially for long running and heavy-priced workflow instances.For complex transactional workflow applications in heterogeneous distributed environment
traditional concurrency control techniques can not reduce cascading aborts when the concurrency correctness is guaranteed.In this paper
we proposed a QoS-based dynamic scheduling algorithm for transactional workflows.Matching requirements of heterogeneous environment
the algorithm allows different recovery policies for scheduled activities.Furthermore
it supports QoS-based deferred-scheduling policy and SAFE-set-enlarging policy.It can adjust scheduling decisions according to the reliability
execution time or price of an activity.It is proved that the proposed algorithm produces serializing and recoverable schedules;moreover
it will not lead to starvation.Performance analysis shows that the algorithm can reduce cascading aborts
thus can provide a high degree of concurrency.
0
浏览量
673
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621