The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—How to exploit application semantics to improve the performance of a real-time data-intensive application has been an active research topic in the past few years. Weaker correctness criteria and semantics-based concurrency control algorithms were proposed to provide more flexibility in reordering read and write events [<ref type="bib" rid="bibT01124">4</ref>], [<ref type="bib" rid="bibT01127">7</ref>], [<ref type="bib" rid="bibT01128">8</ref>], [<ref type="bib" rid="bibT01129">9</ref>], [<ref type="bib" rid="bibT011218">18</ref>], [<ref type="bib" rid="bibT011219">19</ref>], [<ref type="bib" rid="bibT011222">22</ref>]. Distinct from past work, this paper exploits the trade-off between data consistency and system workload. The definition of similarity [<ref type="bib" rid="bibT01128">8</ref>] is combined with the idea of transaction skipping to provide a theoretical foundation for reducing the workload of a transaction system. We also propose guidelines to adjust the execution frequencies of a static set of transactions and prove their correctness. The strengths of this work were verified by simulation experiments on an air traffic control example [<ref type="bib" rid="bibT011220">20</ref>].</p>
Real-time databases, load adjustment, data similarity, serializability.

S. Ho and T. Kuo, "Similarity-Based Load Adjustment for Static Real-Time Transaction Systems," in IEEE Transactions on Computers, vol. 49, no. , pp. 112-126, 2000.
93 ms
(Ver 3.3 (11022016))