This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Similarity-Based Load Adjustment for Static Real-Time Transaction Systems
February 2000 (vol. 49 no. 2)
pp. 112-126

Abstract—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 [4], [7], [8], [9], [18], [19], [22]. Distinct from past work, this paper exploits the trade-off between data consistency and system workload. The definition of similarity [8] 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 [20].

[1] A. Bestavros and S. Braoudakis, “Timeliness via Speculation for Real-Time Databases,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[2] A. Bestavros and S. Nagy, “Value-Cognizant Admission Control for RTDB,” Proc. IEEE 16th Real-Time Systems Symp., Dec. 1996.
[3] S.B. Davidson and A. Watters, “Partial Computation in Real-Time Database Systems,” Proc. Fifth Workshop Real-time Operating Systems and Software, pp. 117-121, May 1988.
[4] L.B.C. Dipippo and V.F. Wolfe, “Object-Based Semantic Real-Time Concurrency Control,” Proc. IEEE Real-Time Systems Symp., Dec. 1993.
[5] R. Gerber, S. Hong, and M. Saksena, “Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[6] C.-W. Hsueh, K.-J. Lin, and N. Fan, “Distributed Pinwheel Scheduling with End-to-End Timing Constraints,” Proc. IEEE Real-Time Systems Symp., Dec. 1995.
[7] M.U. Kamath and K. Ramamritham, “Performance Characteristics of Epsilon Serializability with Hierarchical Inconsistency Bounds,” Proc. Int'l Conf. Data Eng., pp. 587-594, Apr. 1993.
[8] T.-W. Kuo and A.K. Mok, “Application Semantics and Concurrency Control of Real-Time Data-Intensive Applications,” Proc. IEEE 13th Real-Time Systems Symp., 1992.
[9] T.-W. Kuo and A.K. Mok, “SSP: A Semantics-Based Protocol for Real-Time Data Access,” Proc. IEEE 14th Real-Time Systems Symp., Dec. 1993.
[10] T.-W. Kuo, D. Locke, and F. Wang, “Error Propagation Analysis of Real-Time Data-Intensive Application,” Proc. IEEE 1997 Real-Time Technology and Applications Symp., June 1997.
[11] H.F. Korth, N. Soparkar, and A. Silberschatz, “Triggered Real Time Databases with Consistency Constraints,” Proc. 16th VLDB Conf., Aug. 1990.
[12] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[13] K.J. Lin and M.-J. Lin, “Enchancing Availability in Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, no. 1, pp. 34-43, Mar. 1988.
[14] K.J. Lin, S. Natarajan, and J.W.-S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proc. IEEE Eighth Real-Time Systems Symp., pp. 210-217, Dec. 1987.
[15] Y. Lin and S.H. Son, “Concurrency Control in Real-Time Databases by Dynamic Adjustment of Serialization Order,” Proc. IEEE 11th Real-Time Systems Symp., Dec. 1990.
[16] M.D. Natale and J.A. Stankovic, “Dynamic End-to-End Guarantees in Distributed Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[17] C. Papadimitriou, The Theory of Database Concurrency Control. Computer Science Press, 1986.
[18] K. Ramamrithan and C. Pu, "A Formal Characterization of Epsilon-Serializability," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 6, pp. 997-1,007, Dec. 1995.
[19] C.-S. Peng and K.-J. Lin, “A Semantic-Based Concurrency Control Protocol for Real-Time Transactions,” Proc. IEEE 1996 Real-Time Technology and Applications Symp., 1996.
[20] C.-S. Peng, K.-J. Lin, and T. Ng, “A Performance Study of the Semantics-Based Concurrency Control Protocol for Air Traffic Control System,” Proc. Int'l Workshop Real-Time Databases, Sept. 1997
[21] X. Song and J.W.S. Liu, “Maintaining Temporal Consistency: Pessimistic versus Optimistic Concurrency Control,” Proc. IEEE Trans. Knowledge and Data Eng., vol. 7, no. 5, pp. 786-796, Oct. 1995.
[22] M. Xiong, R.M. Sivasankaran, J. Stankovic, K. Ramamritham, and D. Towsley, “Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics,” Proc. IEEE 17th Real-Time Systems Symp., pp. 240-251, Dec. 1996.

Index Terms:
Real-time databases, load adjustment, data similarity, serializability.
Citation:
Tei-Wei Kuo, Shao-Juen Ho, "Similarity-Based Load Adjustment for Static Real-Time Transaction Systems," IEEE Transactions on Computers, vol. 49, no. 2, pp. 112-126, Feb. 2000, doi:10.1109/12.833108
Usage of this product signifies your acceptance of the Terms of Use.