网格数据库事务处理模型  

Transaction model of grid database

作　　者：臧雪柏[1,2] 赵海英[3] 吴洋[1,2] 李雄飞[1,2] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012 [2]吉林大学符号计算与知识工程教育部重点实验室,长春130012 [3]新疆师范大学计算机科学与技术学院,乌鲁木齐830054

出　　处：《吉林大学学报（工学版）》2010年第6期1668-1672,共5页Journal of Jilin University:Engineering and Technology Edition

基　　金：'973'国家重点基础研究发展计划项目(2010CB334709);吉林省科技发展计划项目(20030522-1;20090704)

摘　　要：针对网格环境中自治性与动态性的特点,提出了一种事务处理模型算法。该算法仅定义关键性事务,不区分协调者与参与者,每个节点只对其分配任务的节点返回执行结果;在节点不能完成任务时,利用服务发现技术实时发现网格中提供相同服务的候补节点,提高了事务顺利完成的概率;并考虑了节点退出后的卷回操作,保证事务的可靠性。最后利用Petri网验证了该算法的正确性。According to the characteristics of self-government and dynamics under grid environment,a model algorithm of transaction processing is proposed.The algorithm defines the key transaction,does not differentiate between coordinators and participants,each node only returns the results to the node who assigns the task to it.When a node can not finish its task,the algorithm uses service discovery technology to detect the nodes that can supply the same service in real-time;thus the probability of successful completion of the services is increased.The algorithm takes into account the rollback operation after the exit of the nodes to ensure the reliability of the services.The algorithm is validated by Petri net.

关 键 词：计算机软件 网格 事务处理 PETRI网 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]