A priority-driven concurrency control protocol based on data contention rates for distributed real-time database systems

The paper presents a priority-driven concurrency control protocol to schedule active transactions accessing distributed real-time databases based on priority information. This protocol controls real-time transactions with different priority more effectively. By combining flexible synchronization techniques for desirable real-time conflict resolution, it intends to avoid unnecessary aborts or blocking of conflicting transactions. Thus, flexible priority-driven scheduling enables this protocol to interleave and complete as many transactions as possible without sacrificing data or timing constraints. Performance is achieved by increasing the number of transactions, especially with higher priority.<>