Stochastic study of real-time transactions success ratio

Authors:
Samy Semghouni;Bruno Sadeg;Laurent Amanton;Alexandre Berred
Affiliations:
LIH-University of Le Havre;LIH-University of Le Havre;LIH-University of Le Havre;LMAH-University of Le Havre
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 5
Cited 0

On being optimistic about real-time constraints

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Analysis of locking behavior in three real database systems

The VLDB Journal — The International Journal on Very Large Data Bases
WCET Analysis of Probabilistic Hard Real-Time Systems

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Statistical Analysis of WCET for Scheduling

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Real-Time Databases and Data Services

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known and accepted criterion for measuring real-time database systems (RTDBSs) performances is to maximize the transactions success ratio. In this paper, we focus on a stochastic study of firm real-time transactions, i.e, transactions which are aborted and discarded as soon as they have missed their deadlines. The results we obtained is the reasonable approximation of this ratio behavior by a probabilistic distribution with defined parameters. To achieve this objective and due to the lack of real data, we have designed a simulator based on components including probabilistic characteristics: a transactions generator and a conflicts generator. The latter is based on data conflicts level. After testing two kinds of concurrency control protocols, a pessimistic and an optimistic one, simulation results have helped us to determine load conditions where a kind of protocol is better than the other.