Skip Navigation

The Computer Journal 2000 43(1):65-80; doi:10.1093/comjnl/43.1.65
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lam, K.-y.
Right arrow Articles by Law, G. C. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Reduced Ceiling Protocol for Concurrency Control in Real-time Databases with Mixed Transactions

Kam-yiu Lam1, Tei-Wei Kuo2, Wai-Hung Tsang1 and Gary C. K. Law1

1 Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong Email: cskylam@cityu.edu.hk 2 Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, 621 Taiwan, Republic of China

This paper proposes a real-time concurrency control protocol called the reduced ceiling protocol (RCP) for real-time database systems consisting of hard and soft real-time transactions. The schedulability of hard real-time transactions can be improved by bounding the blocking time from soft real-time transactions. Different concurrency control strategies are proposed to resolve data conflicts between different combinations of hard and soft real-time transactions, and the properties of the RCP schedules are shown. In the RCP, methodologies are proposed to reduce the number of aborts for soft real-time transactions due to data conflicts with hard real-time transactions. Simulation experiments have been performed to study the performance of the RCP as compared with the optimistic concurrency control with wait 50 (OCC wait-50) under different workloads of soft real-time transactions, various ratios of read/write operations and deadline constraints. It has been found that the RCP can not only guarantee the performance of hard real-time transactions but also reduce the number of deadlines missed by the soft real-time transactions under all situations.

Received 28 April, 1998. Revised 3 November, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.