2005Unpublished venueRequires access

CPAHR: AN CONCURRENCY CONTROL PROTOCOL AGAINST HARD REAL-TIME TRANSACTIONS

Jiali Xia

Open publisher page 0 citations

Abstract

When a hard real-time transaction conflicts with some un-hard real-time transactions, the traditional concurrency control protocols make the hard real-time transaction prior obtain system resources through enhancing its priority and preemption. They ignore how to deal with confliction between some hard real-time transactions. This paper aims at resolving this problem. It proposes a concurrency control protocol CPaHR. One hard real-time transaction includes some alternatives, an alternative describes one execution routine. Any alternative success means the hard real-time transaction can commit, otherwise. If new hard real-time transaction conflicts with some alternatives of running hard real_time transaction, it aborts these alternatives but the transactions. Our experiment shows that CPaHR can improve success_ratio of hard real_time transactions obviously.

About this research paper

What this paper is about

When a hard real-time transaction conflicts with some un-hard real-time transactions, the traditional concurrency control protocols make the hard real-time transaction prior obtain system resources through enhancing its priority and preemption. They ignore how to deal with confliction between some hard real-time transactions. This paper aims at resolving this problem. It proposes a concurrency control protocol CPaHR. One hard real-time transaction includes some alternatives, an alternative describes one execution routine. Any alternative success means the hard real-time transaction can commit, otherwise. If new hard real-time transaction conflicts with some alternatives of running hard real_time transaction, it aborts these alternatives but the transactions. Our experiment shows that CPaHR can improve success_ratio of hard real_time transactions obviously.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

When a hard real-time transaction conflicts with some un-hard real-time transactions, the traditional concurrency control protocols make the hard real-time transaction prior obtain system resources through enhancing its priority and preemption. They ignore how to deal with confliction between some hard real-time transactions. This paper aims at resolving this problem. It proposes a concurrency control protocol CPaHR. One hard real-time transaction includes some alternatives, an alternative describes one execution routine. Any alternative success means the hard real-time transaction can commit, otherwise. If new hard real-time transaction conflicts with some alternatives of running hard real_time transaction, it aborts these alternatives but the transactions. Our experiment shows that CPaHR can improve success_ratio of hard real_time transactions obviously.

Key concepts: Distributed transaction, Computer science, Serializability, Database transaction, Concurrency control, Commit, Compensating transaction, Online transaction processing

Related papers

Back to paper searchBrowse research topicsOriginal source
CPAHR: AN CONCURRENCY CONTROL PROTOCOL AGAINST HARD REAL-TIME TRANSACTIONS — Research Paper | ScholarLens