Response Time Distribution in a Real-Time Database with Optimistic ConcurrencyControl

摘要

For a real-time shared-memory database with optimistic concurrency control, anapproximation for the transaction response time distribution is obtained. The model assumes that transactions arrive at the database according to a Poisson process, that every transaction uses an equal number of data-items uniformly chosen, and that the multiprogramming level is bounded. The analysis is based on a decomposition approach: results for the closed system with a fixed number of transactions are used to derive the response time distribution in the open system with Poisson arrivals.