A causal-phase protocol to order soft real-time transactions in a distributed database
Bruno Sadeg, Laurent Amanton, Samia Saad-Bouzefrane
Abstract
Bruno Sadeg, Laurent Amanton, Samia Saad-Bouzefrane
Abstract
Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.
Key concepts: Distributed transaction, Computer science, Serializability, Compensating transaction, Transaction processing, Database transaction, Distributed database, Concurrency control