移动分布式实时事务实时原子提交

形式地给出了移动分布式实时事务实时原子提交协议的定义,在此基础上提出了适合于移动分布式实时事务的实时原子提交协议：一阶段实时原子提交协议(1PRACP)。1PRACP通过参与者与协调者的一次消息交换,在一个阶段完成移动分布式实时事务提交活动;结合超时恢复处理协议,1PRACP能避免由于站点故障或网络通信链路故障而导致的阻塞。对1PRACP进行了性能比较和评测,显示了它在各方面的优越性。     

基于代理的3PC分布式事务提交协议

原有3PC分布式事务提交协议能克服协同者发生故障而有可能产生事务阻塞问题，但其开销大。该文提出了一种基于代理的3PC事务提交协议，该协议通过增加协同者的代理节点，使得参与者相信协同者是正常的，从而不必关心新协同者的选举问题，能降低3PC无故障时的额外开销。     

基于非阻塞的分布式事务提交协议的实现

为了解决两阶段提交(2PC)协议通常存在可靠性低、效率差、易阻塞的问题以及三阶段提交(3PC)协议实现的复杂性问题,提出一个改进的基于非阻塞的两阶段提交协议的实现方案。通过采用消息中间件和观察者节点的架构设计,较好地解决了这些问题,具有一定的商用和工程价值。     

移动广播环境中有效处理实时只读事务

提出了移动广播环境中有效处理实时只读事务的方法。给出了多种多版本广播磁盘组织。采用多版本机制，实现移动只读事务无阻塞提交。通过乐观方法，消除移动只读事务和移动更新事务的冲突。使用多版本动态调整串行次序技术，避免了不必要的事务重启动。在移动主机上如果移动只读事务通过向后有效性确认，则可提交，不需要提交到服务器处理，降低移动只读事务的响应时间。通过模拟仿真对提出的方法进行了性能测试,实验结果表明新方法要优于其他协议。     

分布式数据库系统结点失败下无阻塞的提交协议

分布事务的原子性由分布事务的提交协议来保证。提交协议使公布事务在其执行结点上要么都一致地提交,要么都一致地夭折。如果一个分布事务的提交协议在系统失败时有可能致使某些分布事务的终止或继续运行依赖于此系统失败后的恢复,那么称此提交协议是有阻塞的。本文从提交协议的系统开销和阻塞程度两方面比较了目前常用的几种提交协议,描述了在结点失败下的无阻塞提交协议:带终止协议的三阶段提交协议。同时,本文还提出了在结点失败期间系统的处理策略,给出了保存失败给点悬挂动作以达到屏蔽结点失败的新方法。     

一种基于非阻塞的分布式数据库原子提交协议

针对现今先进的分布式系统在效率和容错方面日益增加的需求,引入了心跳故障检测器的概念来解决合意问题,提出了一种基于非阻塞的分布式数据库事务原子提交协议。协议的提交只需两步操作,在保证非阻塞的同时,大大降低了事务提交的成本,甚至在有广播网的情况下进一步降低了通信开销。通过证明和比较,提出的协议具有可行性、实用性。     

面向网格环境的事务提交协议的研究

提出一种面向网格的事务提交协议-ENP.该协议取消了两阶段提交(2PC)协议中的投票阶段,参与者无需向协调者发送COMMIT消息,可自行决定提交而不必等待协调者的COMMIT命令.如果参与者操作失败,则其向协调者发送abort消息后可自行终止,不必等待协调者发来的ABORT命令.性能分析和实验结果表明,该协议放松了对事务原子性的要求,可以降低提交协议的消息复杂度和日志复杂度,保证了网格环境中事务状态的一致性,满足了各参与者和资源的自治性要求.     

基于心跳技术的3阶段提交协议

在数据库技术的发展过程中,事务机制一直是个热点和关键技术,在分布式数据库尤其如此。该文概述了分布式数据库中事务提交的主要算法,并提出了基于“心跳技术”的另一种三阶段提交协议。采用该技术使得对于大多数站点来说,事务的提交机制更为简单灵活有效。     

移动分布式实时数据库中并发控制框架

在移动分布式数据库系统中采用三层结构，提出了DMVOCC-DA-2PLV（Distributed Multiversion Optimistic Concurrency Control—Dynamic Adjustment of Serialization Order-Two-Phase Local Validation）协议处理移动分布式实时事务。移动实时事务处理分两阶段进行。第一阶段在移动主机（MHs）上处理，并进行局部部分有效性检查性确认，使用向后有效性确认机制，与在服务器提交事务进行有效性确认。及早地检测数据冲突，节省了处理和通信资源。第二阶段在服务器处理，通过局部部分有效性确认的事务，提交到服务器进行局部最终有效性确认。协议消除了移动只读事务和移动更新事务的冲突，使用多版本动态调整串行次序技术，避免了不必要的事务重启动。如果移动只读事务所有读数据项通过局部部分向后有效性确认，则可提交，大大降低了移动只读事务的响应时间。在全局有效性确认中对分布更新事务进行检查，以保证分布串行性。通过模拟仿真，对DMVOCC-DA-2PV协议进行了性能测试，并与DTO-2PC和DHP-2PL进行了比较。实验结果表明DMVOCC-DA-2PV并发控制协议要优于其它协议。     

移动数据库系统乐观事务处理策略

在移动数据库系统中，计算平台的移动性，频繁的断接性以及长事务等特性使得传统的事务处理模式不再适用，为了解决移动数据中的事处处理问题，提出了一种新的移动事务处理模型－乐观两阶段提交移动事务模型（O2PC－MT），该模型采用乐观并发控制与两阶段提交协议相结合的方法，对移动事务的长事务特性提供了灵活与有效的支持，此外，该模型允许移动计算机分多发送中务操作，且在事务执行过程中可以任意移动，从而提供了对交互式事务及随意移动性的支持，实验结果表明，与基于两段锁协议及其变形的其它移动事务处理模型相比，O2PC－MT提高了系统的事务吞吐率并改善了系统的总体性能。     

Reducing the blocking in two-phase commit with backup sites

The blocking phenomena in two-phase commit (2PC) reduces the availability of the system as the blocked transactions keep all the resources until the recovery of the coordinator. The three-phase commit (3PC) protocol involves an extra round of message transmission to resolve the blocking problem. In this paper, we propose a backup commit (BC) protocol to reduce the blocking problem by attaching multiple backup sites to the coordinator site. In BC, after receiving responses from the participants, the coordinator quickly communicates the final decision to the backup sites, before it sends the final decision to the participants. When blocking occurs, the participant sites can terminate the transaction by consulting a backup site of the coordinator. The BC protocol resolves the blocking in most of the coordinator site failures without involving an expensive communication cycle as in 3PC. The simulation experiments indicate that the throughput performance of BC is close to 2PC.     

A tentative commit protocol for composite web services

Composite web services provide promising prospects for conducting cross-organizational business transactions. Such transactions: are generally complex, require longer processing time, and manipulate financially critical data. It is therefore crucial to ensure stronger reliability, higher throughput and enhanced performance of transactions. In order to meet these requirements, this paper proposes a new commit protocol for managing transactions in composite web services. Specifically, it aims to improve the performance by reducing network delays and the processing time of transactions. The proposed protocol is based on the concept of tentative commit that allows transactions to tentatively commit on the shared data of web services. The tentative commit protocol avoids resource blocking thus improving performance. The proposed protocol is tested through various simulation experiments. The outcomes of these experiments show that the proposed protocol outperforms existing protocols in terms of transaction performance.     

Database migration: a new architecture for transaction processingin broadband networks

Due to recent developments in network technologies, broader channel bandwidth is becoming prevalent in worldwide networks. As one of the new technologies making good use of such broadband channels, dynamic relocation of databases through networks, database migration, will soon be used in practice as a powerful and basic database operation. We propose two transaction processing methods to take advantage of database migration in broadband networks. These methods choose the most efficient transaction processing method between the conventional method, based on the two-phase commit protocol, and our method, using database migration. We also propose a concurrency control mechanism and a recovery mechanism for our proposed methods. Simulation results are presented comparing the performance of our proposed methods and the conventional transaction processing method based on the two-phase commit protocol. The results demonstrate that the effective use of database migration produces better performance than the conventional method     

A queueing network model for a distributed database testbed system

A queuing network model for analyzing the performance of a distributed database testbed system with a transaction workload is developed. The model includes the effects of the concurrency control protocol (two-phase locking with distributed deadlock detection), the transaction recovery protocol (write-ahead logging of before-images), and the commit protocol (centralized two-phase commit) used in the testbed system. The queuing model differs from previous analytical models in three major aspects. First, it is a model for a distributed transaction processing system. Second, it is more general and integrated than previous analytical models. Finally, it reflects a functioning distributed database testbed system and is validated against performance measurements     

实时Client/Server数据库并发控制和恢复机制研究

该文提出了实时Client／Server数据库系统多版本两阶段封锁并发控制协议和有效的恢复机制。协议区分只读事务和更新事务。只读事务在执行读操作时遵从多版本时间排序协议,更新事务执行强两阶段封锁协议,即持有全部锁直到事务结束。只读事务读请求从不失败,不必等待等特性。在典型数据库系统中,读操作比写操作频繁。这个特性对于实践来说至关重要。为了提高只读事务的响应时间,协议让每个客户端与一个一致数据库影子相联,只读事务在客户端处理。更新事务提交到服务端运行。服务端每个事务Ti在提交时系统必须向所有客户端广播信息。客户端根据得到的广播信息自动构造一致数据库影子。一致数据库影子还将用于系统恢复。通过仿真模拟。与2V2PL和OCC-TI-WAIT-50协议进行比较,结果表明：该并发控制协议不仅能有效降低事务延误截止时间率和重起动率,而且能改善只读事务的响应时间,减少优先级高事务的锁等待时间。协议性能优于2V2PL协议和OCC-TI-WAIT-50协议。     

分布式实时事务提交协议

在分布式实时数据库系统中，保证事务原子性的唯一途径是研究和开发出一个实时的原子提交协议．首先详细分析了事务因数据访问冲突而形成的各种依赖关系，在此基础上提出了实时的原子乐观提交协议——2SC协议，该协议减少了事务的等待时间，提高了事务的并发度，且能无缝地和现有的并发控制协议集成在一起，保证事务的可串行化和原子性．通过模拟实验研究表明，采用该协议能够减少超过截止期的事务数目。     

The presumed-either two-phase commit protocol

This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking occurs, presumed-either combines the performance advantages of presumed-abort and presumed-commit. Otherwise, presumed-either behaves much like the widely-used presumed-abort protocol.     

Ordered shared locks for real-time databases

We propose locking protocols for real-time databases. Our approach has two main motivations: First, locking protocols are widely accepted and used in most database systems. Second, in real-time databases it has been shown that the blocking behavior of transactions in locking protocols results in performance degradation. We use a new relationship between locks called ordered sharing to eliminate blocking that arises in the traditional locking protocols. Ordered, sharing eliminates blocking of read and write operations but may result in delayed termination. Since timeliness and not response time is the crucial factor in real-time databases, our protocols exploit this delay to allow transactions to execute within the slacks of delayed transactions. We compare the performance of the proposed protocols with the two-phase locking protocol for real-time databases. Our experiments indicate that the proposed protocols for real-time databases. Our experiments indicate that the proposed protocols significantly reduce the percentages, of missed deadlines in the system for a variety of workloads.     

DCFS2的元数据一致性策略

随着集群应用对机群文件系统的性能、容量和规模等需求的日益增长,采用多元数据服务器是机群文件系统发展的必然趋势．基于多元数据服务器的分布式元数据处理是文件系统研究的一个重要问题．机群文件系统DCFS2采用分布式日志技术和改进的两阶段提交协议解决了分布式元数据处理下元数据的一致性问题．性能测试结果表明,DCFS2所采用的基于分布式日志的元数据处理策略能够提供高的I／O性能,并能够保证在元数据服务器失效后文件系统快速恢复．