检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:梅晓勇[1] 黄昌勤[1] 郑小林[2] 陈德人[2] 李师贤[1]
机构地区:[1]中山大学信息科学与技术学院,广东广州510006 [2]浙江大学计算机科学与技术学院,浙江杭州310027
出 处:《通信学报》2012年第4期31-41,共11页Journal on Communications
基 金:国家科技支撑计划基金资助项目(2008BAH24B03);国家自然科学基金资助项目(60673122;60940033);中国博士后基金资助项目(20080440121);湖南省自然科学基金资助项目(06017089;10JJ6100;10151063101000046);湖南省科技计划基金资助项目(2010GK3020)~~
摘 要:研究人员已经致力于组合事务的恢复问题研究,但是大多数成果集中通过向后恢复来维持事务的一致性,补偿是向后恢复通常使用的一种手段,但是向后恢复的最大缺陷就是导致代价相当高,且向后恢复策略不能完全满足各种不同恢复需求。提出一种基于失败类型的恢复算法(包括向前、向后和替代恢复),其是一种基于扩展Petri网的形式化建模方法,为实现松弛ACID属性,引入状态托肯、数据托肯和QoS托肯,增加失败变迁和补偿变迁。失败发生时,动态计算终止依赖点TDP和补偿集,依据任务之间的控制流、数据流、时序、状态和行为依赖,获取任务的失败类型,选择合适的恢复策略,构造一个支持无缝添加/删除失败恢复的可执行模型。Researchers have worked on recovery strategies of composition transactions,most efforts focus on transaction consistency by backward recovery,compensation is commonly used for backward recovery,which have limitations since the cost of compensation tasks are rather expensive,and the compensation mechanism can not satisfy various require-ments of applications.A transaction recovery algorithm was proposed including forward recovery,backward recovery and alternative recovery,which was a formal modeling method based on extended Petri nets,state token,data token and QoS token were introduced to implement relaxed ACID properties of LRT.When failure occurs,terminate dependency point(TDP) and compensation set were calculated dynamically,recovery strategies were added or deleted automatically according to the data flow dependency,control flow dependency and state dependency among tasks.Failure types are generated by log file mining,therefore,failure coordination and recovery are implemented and an executable model which support add/delete failure recovery behavior is constructed seamlessly.
关 键 词:组合事务 基于范围恢复 失败恢复算法 松弛ACID
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222