Abstract
This paper proposes a generic framework to integrate real-time scheduling algorithms, conventional concurrency control algorithms, and aborting algorithms. The schedulability of a transaction system is improved by aborting excessive blocking from lower priority transactions. A schedulability analysis model is proposed to better manage the schedulability of a transaction system.
Original language | English |
---|---|
Pages (from-to) | 670-675 |
Number of pages | 6 |
Journal | IEEE Transactions on Computers |
Volume | 52 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2003 May |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics