Abstract
There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions, and a concurrency control algorithm must attempt to meet the deadlines as well as preserve data consistency. This paper proposes a class of simple and efficient abort-oriented concurrency control algorithms based on the notion of compatibility. The schedulability of a transaction system is improved by aborting transactions that introduce excessive blockings. We consider different levels of the aborting relationship among transactions and evaluate the impacts of the aborting relationship when the relationship is built in an on-line or off-line fashion. The strengths of the work is demonstrated by improving the worst-case schedulability of an avionics example [9], a satellite control system [3], and randomly generated transaction sets.
| Original language | English |
|---|---|
| Pages | 118-125 |
| Number of pages | 8 |
| Publication status | Published - 1996 Dec 1 |
| Event | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications - Seoul, South Korea Duration: 1996 Oct 30 → 1996 Nov 1 |
Other
| Other | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications |
|---|---|
| City | Seoul, South Korea |
| Period | 96-10-30 → 96-11-01 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)