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.
- G. Bernat, A. Colin, and S. Petters. WCET analysis of probabilistic hard real-time systems. IEEE, Real-Time Systems Symposium (RTSS), pages 279--288, 2002. Google ScholarDigital Library
- S. Edgar and A. Burns. Statistical analysis of WCET for scheduling. IEEE RTSS'01, pages 215--224, 2001. Google ScholarDigital Library
- R. Haritsa, M. Carey, and M. Livny. On being optimistic about real-time constraints. In ACM PODS, pages 331--343, 1990. Google ScholarDigital Library
- K. Ramamritham, H. Son, and L. Dipippo. Real-time database and data services. Real-Time Systems Journal, 28:179--215, 2004. Google ScholarDigital Library
- S. Semghouni, B. Sadeg, A. L., and A. Berred. Statistical model for real-time dbms performances. In Proc. of the Intl. Conceptual Modeling and Simulation Conf. (CMS), part of I3M, pages 11--18, France, 2005.Google Scholar
- V. Singhal and A. Smith. Analysis of locking behavior in three real database systems. VLDB Journal 6 (1), pages 40--52, 1997. Google ScholarDigital Library
Index Terms
- Stochastic study of real-time transactions success ratio
Recommendations
Concurrency control for real-time database systems with mixed transactions
RTCSA '97: Proceedings of the 4th International Workshop on Real-Time Computing Systems and ApplicationsThis paper proposes a real-time concurrency control protocol called Reduced Ceiling Protocol (RCP) for database systems consisting of hard and soft real-time transactions. In the RCP, the schedulability of hard real-time transactions is guaranteed by ...
Committing conflicting transactions in an STM
PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programmingDependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages dependences between conflicting, uncommitted transactions so that they commit ...
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Comments