一种实时数据库事务处理策略的应用

通过对实时事务特点的分析和对实时数据库中事务处理策略的研究，提出了一种把优先级分配策略与定时调度策略相结合的实时事务调度策略，并融合快照机制与优先级分配策略建立了一种新的基于乐观法的并发控制策略。将这种策略应用于一个实时系统的实时数据库，系统的性能和稳定性明显提高。实验结果表明所给出的新策略及方法的正确性和有效性。     

一种实时数据库事务处理策略的应用

通过对实时事务特点的分析和对实时数据库中事务处理策略的研究,提出了一种把优先级分配策略与定时调度策略相结合的实时事务调度策略,并融合快照机制与优先级分配策略建立了一种新的基于乐观法的并发控制策略。将这种策略应用于一个实时系统的实时数据库,系统的性能和稳定性明显提高。实验结果表明所给出的新策略及方法的正确性和有效性。     

嵌入式数据库中实时事务管理器的设计与实现

为解决传统嵌入式数据库系统只支持基本的事务操作,使得系统无法满足实时性应用需求的问题,分析了实时系统的特点和要求,并综合嵌入式数据库系统事务管理机制,提出了实时事务管理器作为嵌入式数据库系统的实时性解决方案,该管理器的核心算法包括事务截止期分析、事务优先级动态分配策略、事务调度策略和事务接纳策略几个部分。通过应用于嵌入式数据库管理系统Tyche_DB可知,该系统具备了实时系统的特点,满足实时性应用的需求。     

运行时间自适应的事务调度算法

实时数据库中是基于事务的不同优先级进行事务的调度,所以事务优先级的确定对实时数据库的效率有着至关重要的作用。本文讨论了一个运行时间自适应的事务调度算法,对算法思想和调度策略进行了深入的研究。该算法事务的估计运行时间与CPU时钟无关,具有自适应的能力,并且可以得到周期性事务的准确运行时间,对于周期性事务比例比较高的应用系统非常适合。     

实时数据库缓冲区管理算法的设计和实现

分析了实时数据库的事务特征,对以往的研究成果进行了总结,以满足事务的按时完成比率（Success Ratio）为目标,为实时系统设计了一种使用反馈控制思想的基于优先级的实时数据库缓冲区管理算法FCLRU2dl,并将该算法与常用的实时数据库事务调度算法和并发控制策略配合进行了测试和评估,证明了算法的优越性。实验中得到的另一个结论是在特定的事务调度算法和并发控制策略下,实时数据库不需要全部位于内存中,可以不是内存数据库。     

实时数据库事务的调度与并发控制

实时数据库的核心问题是事务的处理既要确保数据的一致性,又要保证事务的正确性,而它们都与定时相关联。本文对混合实时事务的真实时和非实时部分加以区别定义,建立了混合实时数据库模型,并分析了混合实时事务的调度与并发控制,可以更好地满足实时性时间约束需求,从而提高系统效率。     

工业监控系统中的分布式实时数据库研究

分析了工业监控系统中的分布式实时数据库的的功能与特点、结构、数据对象和事务的种类。提出建立内存数据库保证系统实时性并讨论了PC机和嵌入系统上实现内存数据库管理的区别和难点。着重研究了根据数据相关度分配数据的分布机制的实现和基于价值函数的事务并发调度。为构建工业监控系统中的分布式实时数据库提供了一条思路。     

实时数据库事务的研究与实现

根据设计的实时数据库操作类型,对实时事务进行了分类,时间性是实时事务重要属性,提供了实时事务的时间性、原子性、并发性以及优先级分配的策略,对实时事务进行有效的调度。     

实时数据库管理系统—实时事务调度与并发控制子系统的设计与实现

实时数据库管理系统(RTDBMS)是建立在UNIX环境下,以关系数据模型为基础,借鉴实时系统管理特征而实现的数据库管理系统。RTDBMS包括内存数据库管理、触发器管理、实时事务调度与并发控制、数据操纵、用户接口与数据说明等五个子系统。实时事务调度与并发控制子系统(简称实时事务调度子系统)是其中之一。 本文主要介绍了实时事务调度子系统为实现RTDBMS的最终目标——对数据与事务的定时限制而必须具备的功能,如事务的优先数分配、并发控制、冲突处理、按原则调度事务等。这些功能模块的实现,使得对事务的“时间识别”处理,即:既满足数据的一致性(逻辑一致,绝对一致,相对一致),又满足事务的时限要求成为现实。     

一种MapReduce实时调度算法设计及实现

MapReduce是云计算中重要的批数据处理框架,多任务共享MapReduce机群并满足任务实时性要求是调度算法急需解决的问题。提出两阶段实时调度算法,将调度划分为任务间调度和任务内调度。对于任务间调度,使用抽样法和经验值法确定子任务执行时间,利用该参数建立资源分配模型,动态确定任务优先级进行调度;对于子任务使用延迟调度策略进行调度,保证计算的本地性。实验结果显示,两阶段实时调度算法相比公平调度算法和FIFO算法,在保证吞吐量的同时能够满足任务实时性要求。     

Priority Scheduling of Transactions in Distributed Real-Time Databases

One of the most important issues in the design of distributed real-time database system (DRTDBS) is transaction scheduling which consists of two parts: priority scheduling and real-time concurrency control. In the past studies, mostly, these issues are studied separately although they have a very close interaction with each other. In this paper, we propose new priority assignment policies for DRTDBS and study their impact on two typical real-time concurrency control protocols (RT-CCPs), High Priority Two Phase Locking (HP-2PL) and Optimistic Concurrency Control with Broadcast Commit (OCC-BC). Our performance results show that many factors, such as data conflict resolution, degree of data contention and transaction restarts, that are unique to database systems, have significant impact on the performance of the policies which in turn affect the performance of the real-time concurrency control protocols. OCC-BC is more affected by the priority assignment policies than HP-2PL owing to the late detection of conflict. In the design of priority assignment policies, we have found that neither the purely deadline driven policies nor data contention driven policies are suitable for DRTDBS. Our proposed policy, the Mixed Method (MM), which considers both transaction timeliness and data contention, outperforms other policies over a wide range of system parameter settings.     

基于价值密度的替代与事务优先级分派策略

针对基于替代/补偿的实时事务模型中的优先级分派问题,提出基于价值密度的替代与事务优先级分派策略PBAC。在PBAC中,替代优先级基于替代的价值密度,并与替代的执行时间和紧迫性相关,事务优先级继承自替代的优先级,并受事务执行度的影响。仿真实验结果证明,该策略使系统可以更好地对基于替代/补偿的事务模型进行调度。     

Real-time transaction scheduling in database systems

A database system supporting a real-time application, which can be called “a real-time database system (RTDBS)”, has to provide real-time information to the executing transactions. Each RTDB transaction is associated with a timing constraint, usually in the form of a deadline. Efficient resource scheduling algorithms and concurrency control protocols are required to schedule the transactions so as to satisfy both timing constraints and data consistency requirements. In this paper,^† we concentrate on the concurrency control problem in RTDBSs. Our work has two basic goals: real-time performance evaluation of existing concurrency control approaches in RTDBSs, and proposing new concurrency control protocols with improved performance. One of the new protocols is locking-based, and it prevents the priority inversion problem^{, †} by scheduling the data lock requests based on prioritizing data items. The second new protocol extends the basic timestamp-ordering method by involving real-time priorities of transactions in the timestamp assignment procedure. Performance of the protocols is evaluated through simulations by using a detailed model of a single-site RTDBS. The relative performance of the protocols is examined as a function of transaction load, data contention (which is determined by a number of system parameters) and resource contention. The protocols are also tested under various real-time transaction processing environments. The performance of the proposed protocols appears to be good, especially under conditions of high transaction load and high data contention.     

Real-Time Transaction Scheduling: A Framework for Synthesizing Static and Dynamic Factors

Real-time databases are poised to be an important component of complex embedded real-time systems. In real-time databases (as opposed to real-time systems), transactions must satisfy the ACID properties in addition to satisfying the timing constraints specified for each transaction (or task). Although several approaches have been proposed to combine real-time scheduling and database concurrency control methods, to the best of our knowledge, none of them provide a framework for taking into account the dynamic cost associated with aborts, rollbacks, and restarts of transactions. In this paper, we propose a framework in which both static and dynamic costs of transactions can be taken into account. Specifically, we present: i) a method for pre-analyzing transactions based on the notion of branch-points for data accessed up to a branch point and predicting expected data access to be incurred for completing the transaction, ii) a formulation of cost that includes static and dynamic factors for prioritizing transactions, iii) a scheduling algorithm which uses the above two, and iv) simulation of the algorithm for several operating conditions and workload. Our dynamic priority assignment policy (termed the cost conscious approach or CCA) adapts well to fluctuations in the system load without causing excessive numbers of transaction restarts. Our simulations indicate that i) CCA performs better than the EDF-HP algorithm for both soft and firm deadlines, ii) CCA is more fair than EDF-HP, iii) CCA is better than EDF-CR for soft deadline, even though CCA requires and uses less information, and iv) CCA is especially good for disk-resident data.     

嵌入式实时数据库ARTs-EDB事务调度实现技术

着重讨论了嵌入式实时数据库系统ARTs-EDB中事务调度实现技术。给出了ARTs-EDB中事务的执行模型、状态及状态变迁；设计了一个考虑事务类型和截止期的多层动态可调整优先级分派方法；给出了一个优先级驱动可抢占的实时事务调度策略，以保证更多事务满足截止期要求。     

基于EDF算法的可行性判定及实现

实时调度算法是实时系统中的关键技术。验证实时调度算法的可行性是在实时系统中实施某种调度算法的必经环节。在介绍实时系统中常用的各种实时调度算法,包括固定优先级调度算法和动态优先级调度算法基础上,详细分析了动态优先级调度算法EDF算法的运算过程和使用条件。提出了该算法在实际应用中存在的问题。针对该硬实时调度算法,提出了分别在简单模型上和复杂模型上如何判定实时任务的可行性。为实际应用中实现该实时调度算法确定了依据。     

Feasibility analysis of real-time transactions

The objective of this paper is two-fold: give a survey of response time analysis (RTA), and contribute to schedulability analysis for the real-time transaction model. The RTA is studied under fixed priority policies (FPP), while schedulability analysis assumes an optimal scheduling algorithm (like the deadline driven scheduling algorithm EDF) in a preemptive context on uniprocessor systems. We compare the transaction model to the family of multiframe models, then present the exact, and approximated methods, as well as a tunable method to compute the RTA. Finally we present a new schedulability analysis method and an efficient algorithm to speed up this test.     

Multiclass query scheduling in real-time database systems

In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emergence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system's admission, memory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms that PAQRS is very effective for real-time query scheduling