Abstract
A transaction scheduling mechanism is designed for a shared memory, multiprocessor database system. The scheduler used is a variant of static locking, adapted for real time and more than one processor. It is assumed that transactions arrive according to a Poisson process, execution times of transactions are independent and exponentially distributed and all transactions use the same number of data items. The system is then represented as a Markov model. A steady state is derived from this model. By examining the path through the system of a single transaction, a recursive relation that describes all moments of a transaction's response time is derived. The response time distribution is approximated by fitting a distribution to the first two moments. Simulation shows that this approximation gives excellent results.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems (Hawaii, USA, April 15-16, 1996) |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 118-121 |
| Number of pages | 4 |
| ISBN (Print) | 0-8186-7515-2 |
| DOIs | |
| Publication status | Published - 1996 |
Fingerprint
Dive into the research topics of 'The response time distribution in a multi-processor database with single queue static locking'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver