This Article 
 Bibliographic References 
 Add to: 
Schedulability and Performance Analysis of the Similarity Stack Protocol
May 2003 (vol. 52 no. 5)
pp. 658-669

Abstract—We propose a class of real-time data access protocols called SSP (Similarity Stack Protocol). The correctness of SSP schedules is justified by the concept of similarity which allows different but sufficiently timely data to be used in a computation without adversely affecting the outcome. SSP schedules are deadlock-free, subject to limited blocking, and do not use locks. We give a schedulability bound for SSP and also report simulation results which show that SSP is especially useful for scheduling real-time data access on multiprocessor systems. Finally, we present a variation of SSP which can be implemented in an autonomous fashion in the sense that scheduling decisions can be made with local information only.

[1] R. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions: A Performance Evaluation,” Proc. 14th Very Large Databases Conf., pp. 1-12, 1988.
[2] T.P. Baker, A Stack-Based Resource Allocation Policy for Real-Time Processes Proc. IEEE Real-Time Systems Symp., pp. 191-200, 1990.
[3] P.C. Clements, C.L. Heitmeyer, and A.K. Mok, “Applying Formal Methods to an Embedded Real-Time Avionics System,” Proc. First IEEE Workshop Real-Time Applications, May 1993.
[4] P.C. Clements, B. Labaw, and A. Bull, “Modeling a Parallel Real-Time Avionics System with Modechart,” technical report, US Naval Research Laboratory, Apr. 1993.
[5] R.P. Cook, S. H. Son, H.Y. Oh, and J. Lee, “New Paradigms for Real-Time Database Systems,” Proc. Real-Time Workshop, 1991.
[6] W. Du and A.K. Elmagarmid, “Quasi Serializability: A Correctness Criterion for Global Concurrency Control in Interbase,” Proc. 15th Int'l Conf. Very Large Data Base, pp. 347-355, 1989.
[7] S.B. Davidson and A. Watters, “Partial Computation in Real-Time Database Systems,” Proc. Fifth Workshop Real-Time Software and Operating Systems, pp. 117-121, May 1988.
[8] H. Garcia-Molina and K. Salem, “Sagas,” Proc. 1987 ACM SIGMOD Conf. Management of Data, pp. 249-259, 1987.
[9] H. Garcia-Molina and G. Wiederhold, “Read-Only Transactions in a Distributed Database,” ACM Trans. Database Systems, vol. 7, no. 2, pp. 209-234, June 1982.
[10] J.R. Haritsa, M.J. Carey, and M. Livny, “On Being Optimistic About Real-Time Constraints,” Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 331-343, Apr. 1990.
[11] J. Huang,J. Stankovic,K. Ramamritham,, and D. Towsley,,“On using priority inheritance in real-time databases,” Proc. 12th Real-Time Systems Symp., pp. 210-221, 1991.
[12] K.L. Heninger, J.W. Kallander, and J.E. Shore, “Software Requirements for the A-7E Aircraft,” Technical Report, NRL Memorandum Report 3876, Nov. 1978.
[13] T.-W. Kuo and A.K. Mok, “Load Adjustment in Adaptive Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1991.
[14] 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.
[15] T.-W. Kuo and A.K. Mok, “Real-Time Data Semantics and Similarity-Based Concurrency Control,” IEEE Trans. Computers, vol. 49, no. 11, pp. 1241-1254, Nov. 2000.
[16] 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.
[17] H.F. Korth, N. Soparkar, and A. Silberschatz, “Triggered Real Time Databases with Consistency Constraints,” Proc. 16th Very Large Databases Conf., Aug. 1990.
[18] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[19] 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.
[20] 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.
[21] 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.
[22] C.D. Locke, D.R. Vogel, and T.J. Mesler, “Building a Predictable Avionics Platform in Ada: A Case Study,” Proc. IEEE 12th Real-Time Systems Symp., Dec. 1991.
[23] A.M. Mok, “Fundamental Design Problems for the Hard Real-Time Environment,” PhD dissertation, MIT, Cambridge, Mass., 1983.
[24] H. Pang,M. Livny,, and M.J. Carey,“Transaction scheduling in multiclass real-time database systems,” Proc. 13th IEEE Real-Time Systems Symp. (RTSS), Dec. 1992.
[25] C. Papadimitriou, The Theory of Database Concurrency Control. Computer Science Press, 1986.
[26] C. Pu and A. Leff, “Epsilon-Serializability,” Technical Report CUCS-054-90, Dept. of Computer Science, Columbia Univ., Jan. 1991.
[27] K. Ramamritham and C. Pu, “A Formal Characterization of Epsilon Serializability,” Technical Report CUCS-044-91, Dept. of Computer Science, Columbia Univ., 1991.
[28] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” Technical Report 9, CMU-CS-87-181, Dept. of Computer Science, Carnegie Mellon Univ., Nov. 1987, also in IEEE Trans. Computers, vol. 39, no. 9, Sept. 1990.
[29] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Concurrency Control for Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, no. 1, pp. 82-98, Mar. 1988.
[30] X. Song and J.W.-S. Liu, “Performance of Multiversion Concurrency Control Algorithms in Maintaining Temporal Consistency,” technical report, Univ. of Illinois at Urbana-Champaign, 1990.

Index Terms:
Real-time databases, concurrency control, real-time data access, data similarity, \Delta-serializability, distributed data management, process scheduling.
Tei-Wei Kuo, Aloysius K. Mok, "Schedulability and Performance Analysis of the Similarity Stack Protocol," IEEE Transactions on Computers, vol. 52, no. 5, pp. 658-669, May 2003, doi:10.1109/TC.2003.1197131
Usage of this product signifies your acceptance of the Terms of Use.