Performance evaluation on a real-time database

We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show that when admission control is used it plays a more significant role than specialized real-time data cognizant policies. Our admission control policy considers not only CPU utilizations, but also I/O requirements and utilizations. These results represent one of the few sets of experimental results found for an implemented real-time database; almost all previous results are via simulation.

[1]  Azer Bestavros,et al.  Value-cognizant admission control for RTDB systems , 1996, 17th IEEE Real-Time Systems Symposium.

[2]  Tei-Wei Kuo,et al.  SSP: A semantics-based protocol for real-time data access , 1993, 1993 Proceedings Real-Time Systems Symposium.

[3]  Jörgen Hansson,et al.  Dynamic transaction scheduling and reallocation in overloaded real-time database systems , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[4]  Krithi Ramamritham,et al.  Deriving deadlines and periods for real-time update transactions , 1999, IEEE Transactions on Computers.

[5]  Azer Bestavros,et al.  Admission control for soft-deadline transactions in ACCORD , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[6]  Donald F. Towsley,et al.  Scheduling transactions with temporal constraints: exploiting data semantics , 1996, 17th IEEE Real-Time Systems Symposium.

[7]  Sang Hyuk Son,et al.  Architecture and object model for distributed object-oriented real-time databases , 1998, Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98).

[8]  Donald F. Towsley,et al.  Experimental evaluation of real-time transaction processing , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[9]  Donald F. Towsley,et al.  On using priority inheritance in real-time databases , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[10]  Donald F. Towsley,et al.  Priority inheritance in soft real-time databases , 2004, Real-Time Systems.

[11]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

[12]  Donald F. Towsley,et al.  Priority assignment in real-time active databases , 1996, The VLDB Journal.

[13]  Miron Livny,et al.  Data access scheduling in firm real-time database systems , 1992, Real-Time Systems.

[14]  Tei-Wei Kuo,et al.  Real-Time Data Semantics and Similarity-Based Concurrency Control , 2000, IEEE Trans. Computers.

[15]  Sang Hyuk Son,et al.  BeeHive: Global Multimedia Database Support for Dependable, Real-Time Applications , 1997, ARTDB.

[16]  J. Stankovic,et al.  Priority assignment in real-time active databases 1 , 1994 .

[17]  Miron Livny,et al.  Earliest deadline scheduling for real-time database systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[18]  Hector Garcia-Molina,et al.  Applying update streams in a soft real-time database system , 1995, SIGMOD '95.

[19]  Miron Livny,et al.  On being optimistic about real-time constraints , 1990, PODS '90.

[20]  Jane W.-S. Liu,et al.  Maintaining Temporal Consistency: Pessimistic vs. Optimitic Concurrency Control , 1995, IEEE Trans. Knowl. Data Eng..

[21]  Miron Livny,et al.  Multiclass Query Scheduling in Real-Time Database Systems , 1995, IEEE Trans. Knowl. Data Eng..

[22]  Yi Lin,et al.  Concurrency control in real-time databases by dynamic adjustment of serialization order , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.