Experimental evaluation of real-time transaction processing

Abstract

Results are presented of empirical evaluations carried out on the RT-CARAT testbed. This testbed was used evaluating a set of integrated protocols that support real-time transactions. A basic locking scheme for concurrency control was used to develop and evaluate several algorithms for handling CPU scheduling, data-conflict resolution, deadlock resolution, transaction wakeup, and transaction restart. The performance data indicate that the CPU scheduling algorithm is the most significant of all the algorithms in improving the performance of real-time transactions, conflict-resolution protocols which directly address deadlines and criticality can have a substantial impact on performance compared to protocols that ignore such information, both criticality and deadline distributions strongly affect transaction performance, and overheads such as locking and message communication are nonnegligible and cannot be ignored in real-time transaction analysis. It is believed that these empirical results represent the first experimental results for real-time transactions on a testbed system.