Bitte wählen Sie ihr Lieferland und ihre Kundengruppe
For a real-time shared-memory database with Optimistic Concurrency Control (OCC), an approximation for the transaction response-time distribution and thus for the deadline miss probability is obtained. Transactions arrive at the database according to a Poisson process. There is a limited number of CPUs that can handle transactions in parallel. Transactions have soft deadlines, and the probability of data conflicts is equal for all transactions. The response time of a transaction consists of possible waiting time (if at arrival all CPUs are occupied) plus a number of execution runs (due to the occurrence of conflicts). In this study, the authors analyze the case where the execution time of all transactions is constant. Although in practice execution times are never really constant, it is important to analyze this simplifying constant case first, before trying to analyze more general execution-time distributions.