MDBS中一种改进的并发事务调度算法

MDBS中并发事务的调度策略必须满足可串行化准则,论文主要分析以事务提交图为中心的调度算法TM2,虽然保证了全局事务提交顺序的可串行化,但在提交时才进行冲突检测方式存在缺点,提出改进后的事务调度算法TM3不仅保证了全局事务的可串行化和防止了全局死锁的发生,还提高了全局事务执行的并发度。最后通过实验在数据库加速引擎中进行模拟,对比了两种调度算法的性能。     

实时数据库的准一致性可串行化并发控制

可串行化的并发控制对传统应用是合适的,它旨在确保数据的“绝对正确”性,然而在实时数据库中,事务的定时限制往往比数据的“绝对正确”性更重要。为此,本文提出了新颖的准一致性可串行化的并发控制策略,文中着重讨论了准一致性可串行化的有关概念与理论,调度的可准一致性可串行化的判别方法,并发控制协议以及在事务的准一致性可串行化并发执行中不一致性传播放大的控制策略。     

基于全局时标的网格事务并发机制研究

针对现有网格数据库事务并发控制协议存在的问题,提出了一种基于全局时标的网格事务并发控制协议。该协议引入全时序的概念,将网格事务在全局层面上进行了排序,实现了网格事务并发执行的可串行化。通过网格事务可串行化定理对所提出的协议进行可串行化证明,并对协议及算法的性能进行了实验测试。实验结果表明,提出的协议是可行和有效的,相对于传统的基于时标的并发控制协议具有一定的优越性。     

一种新的实时数据库乐观并发控制方法

可串行化的并发控制对传统应用是合适的。而在实时数据库中，为了满足事务定时限制(典型地为截止期)，并且考虑到局部的数据库不一致能够随下一次数据采样恢复，人们提出了准一致可串行化标准。本文基于这一标准提出了一种新的乐观并发控制协议，它考虑了数据的相似性及事务特点，提高了事务执行的并发度，有利于实时事务定时限制的满足。     

多数据库事务并发调度算法优化技术研究

研究优化调度数据库中事务问题,为保证多数据库中事务提交顺序,提高事务执行及提交的并发度,研究了事务提交图的调度算法TM2,针对算法TM2中事务管理器无法检测到全局事务与局部事务的间接冲突,提出了优化算法TMO,采用ticket算法在全局事务的每个子事务之间增加数据操作,以便在每个成员数据库的全局子事务之间创造直接冲突,并通过添加保存点恢复中止事务代替重做事务,保持了多数据库中事务的可串行化.通过仿真,对比了两种调度算法的性能.得出算法TMO解决了事务的可串行化问题,提高了事务的并发度,保证了事务的一致性.     

两阶段封锁可串行化强制性的实现

数据库的共享性是建立在多个共享事务的并发执行基础之上的。为了保证多个事务的并发执行,并发控制器对各事务动作的调度应当是可串行化的。然而,在实际调度过程中,并非所有的调度都是可串行化的。为了确保事务之间的可串行性关系,可使用两阶段封锁将非可串行化调度强制实现为可串行化调度。     

基于冲突率预测的自适应并发控制算法

并发控制算法能够保证数据库事务集并发执行的正确性和一致性。为了提高并发事务的执行效率,提出了一种基于冲突率预测的自适应并发控制算法(ACC-PRC)。该算法将并发控制过程分为信息收集和策略选择两个阶段。信息收集阶段利用先验事务队列保证事务执行的可串行化,并且利用循环冲突队列收集系统的事务执行状态。策略选择阶段在循环冲突队列上运用改进的加权移动平均法预测下一阶段冲突率,并根据双向阈值决策下一阶段的并发策略。所提算法在事务到达率较高时能保持良好的事务执行效率,同时能够准确及时地感知冲突率的变化。对比实验表明ACC-PRC算法的综合性能优于HCC算法和ADCC算法。     

一种新的实时事务并发控制方法

本文提出一种新的实时事务并发控制方法，并对其性能进行了模拟评测；与锁式协议，乐观协议，基于时间戳的协议相比，它可以获得更新的并发度，与诸如ε－可串行比、△－可串行化等一致性的放松可串行化并发控制技术相比，它维护强一致性，保证严格可串行化。     

数据广播中T-可串行化移动实时事务并发控制

研究了实时数据广播环境中的一致性维护问题。由于广播环境的非对称通讯特性，传统可串行化并发控制方法过于严格而不必要;现有放松可串行化方法都会导致数据库受限不一致、使各个用户读取受限不一致数据。提出了使用?子-可串行化并发控制，首先形式化定义了?子-可串行化正确性准则，证明了它虽比传统可串行化宽松但能始终保证数据一致性，使各个用户始终读取一致性数据，进而给出了相应的并发控制协议。实验结果表明，新协议可显著降低平均响应时间，使更多移动实时事务满足截止期要求。     

分布式数据库并发控制方法研究

并发控制机制是数据库事务管理中重要的组成部分，是衡量一个数据库系统功能强弱和性能好坏的重要标志之一。分布式并发控制的目的是保证分布事务和分布式数据库的一致性，实现分布事务的可串行性，使事务具有良好的并发度以保证系统具有用户满意的效率。本文首先就分布式数据库并发事务的可串行化进行探讨并在此基础上提出分布式数据库并发控制的基本方法。     

Optimistic priority-based concurrency control protocol for firm real-time database systems

This paper presents an optimistic priority-based concurrency control protocol that schedules active transactions accessing firm deadline real-time database systems. This protocol combines the forward and backward validation processes in order to control concurrent transactions with different priorities more effectively. For a transaction in the validation phase, it can be committed successfully if the serialization order is adjusted in favour of the transactions with higher priority and aborted otherwise. Thus, this protocol establishes a priority ordering technique whereby a serialization order is selected and transaction execution is forced to obey this order. This priority-based protocol addresses the problem of satisfying data consistency, with the goal being to increase the number of transactions that commit by their deadlines. In addition, for desirable real-time conflict resolution, this protocol intends to meet more deadlines of higher priority transactions then lower priority transactions.     

Multiserialization of iterated transactions

The usual criterion of serializability considered in data base systems in order to control the accesses to shared informations by concurrent transactions is generalized in two directions: the transactions can be arbitrarily often iterated, as processes in an operating system, and the notion of serialization is extended in order to control behaviours of concurrent transactions with respect to several independent criteria of serializability. For transaction systems controlled under multiple criteria of serializability, a characterization of deadlock freedom is given. This characterization is shown to be applicable to any mutual exclusion problem.     

基于分布式事务流的动态可串行调度算法

针对分布式数据库中发生待处理的事务流提出一种动态可串行调度算法。通过执行此算法,能够高效地处理源源不断的事务流,使之尽可能串行调度地执行,从而提高并发度,以及分布式数据库各站点的并行处理度。     

On speculative replication of transactional systems

In this paper we investigate, from a theoretical perspective, the problem of how to build speculative replication protocols for transactional systems layered on top of an Optimistic Atomic Broadcast (OAB) service. The OAB service provides an early, possibly erroneous, guess on transactionʼs final serialization order. This can be exploited to speculatively execute transactions in parallel with the algorithm used to determine their final total delivery (and serialization) order. To maximize the chances of guessing their final serialization order, transactions are executed multiple times, speculating on the possible orderings eventually determined by the OAB service. We formalize the Speculative Transactional Replication (STR) problem by means of a set of properties ensuring that transactions are never activated on inconsistent snapshots, as well as the minimality and completeness of the set of speculatively explored serialization orders. Finally, we present a protocol solving the STR problem, along with simulation results assessing its effectiveness.     

一种面向混合实时事务调度的并发控制协议

首先给出了一个两层结构的混合实时数据库系统模型，其中支持采用非定期任务调度算法来改进系统的性能．进一步，针对这种模型下混合事务的数据一致性问题，提出了一种新的并发控制协议——MCC-DATI．该协议采用动态优先级驱动的调度算法，通过限制非定期的软实时事务对硬实时事务的阻塞时间，保证硬实时事务的可调度性；同时，采用非定期任务调度算法以及基于时间戳间隔的动态串行化顺序调整机制来减少软实时事务的截止期错失率．仿真实验表明，相对于先前的混合事务的并发控制协议，该协议在不同的系统负载与截止期约束下都能够改进系统的性能。     

Exploiting multi‐cores for efficient interchange of large messages in distributed systems

Conventional data serialization tools assume that objects to be coded are usually small in size so a single CPU core can encode it in a timely manner. In the era of Big Data, however, object gets increasingly complex and larger, which makes data serialization become a new performance bottleneck. This paper describes an approach to parallelize data serialization by leveraging multiple cores. Parallelizing data serialization introduces new questions such as how to split the (sub)objects, how to allocate the available cores, and how to minimize its overhead in practice. In this paper we design a framework for parallelly serializing large objects and analyze the design tradeoffs under different scenarios. To validate the proposed approach, we implemented parallel protocol buffers—the parallel version of Google's Protocol Buffers, a widely‐used data serialization utility. Experimental results confirm the effectiveness of Parallel Protocol Buffers: multiple cores employed in data serialization achieve highly scalable performance and incur negligible overhead. Copyright © 2015 John Wiley & Sons, Ltd.     

Java对象的安全迁移研究

该文分析了Java对象动态迁移中存在的安全性问题,提出利用RSA加密与数字签名算法保护Java对象中秘密信息的方案,有效地解决了秘钥分配问题,实现了Java对象的安全迁移,确保了Java对象迁移过程中秘密信息的隐秘性、完整性和可认证性。     

Concurrent Certifications by Intervals of Timestamps in Distributed Database Systems

This paper introduces, as an optimistic concurrency control method, a new certification method by means of intervals of timestamps, usable in a distributed database system. The main advantage of this method is that it allows a chronological commit order which differs from the serialization one (thus avoiding rejections or delays of transactions which occur in usual certification methods or in classical locking or timestamping ones). The use of the dependency graph permits both classifying this method among existing ones and proving it. The certification protocol is first presented under the hypothesis that transactions' certifications are processed in the same order on all the concerned sites; it is then extended to allow concurrent certifications of transactions.     

MS VC++ 永久对象恢复的一个问题

本文提取出ＭＳ ＶＣ＋＋５．０中永久对象序列化的算法机制,对其中潜在的问题进行了分析,提出了一种避免问题的方法。     

一种分布式实时事务调度算法

传统的乐观并发控制策略利用了一些不必要的事务重启来保证数据的一致性，事务重启能够极大的增加系统载荷以及加强资源和数据的竞争，在分布式环境下，由于系统的复杂性和较高的通讯开销加剧了该问题．针对该问题本文提出了一种靳的乐观并发控制策略，通过动态调整事务串行化执行顺序来避免不必要的事务重启．当把这种新的并发控制策略在分布式实时环境中实现时，考虑到分布式事务的实时性要求，本文提出把写阶段从临界区中分离出来的方法，并用顺序加锁的策略来保证分布式事务执行的正确性，最后给出了该实现方法的正确性证明．