Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Similarity-Based Load Adjustment for Static Real-Time Transaction Systems

Published: 01 February 2000 Publication History

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].

References

[1]
A. Bestavros, “Timeliness Via Speculation for Real-Time Databases,” Proc. IEEE 15th Real-Time Systems Symp., 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. 46-61, Jan. 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. Ramamritham 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 vs. Optimistic Concurrency Control,” IEEE Trans. Knowledge and Data Eng., pp. 787-796, Oct. 1995.
[22]
M. Xiong K. Ramamritham R. Sivasankaran J.A. Stankovic and D. Towsley, “Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics,” Proc. IEEE Real-Time Systems Symp., pp. 240-251, Dec. 1996.

Cited By

View all
  • (2024)Deadline and Period Assignment for Guaranteeing Timely Response of the Cyber-Physical SystemACM Transactions on Design Automation of Electronic Systems10.1145/368904830:1(1-26)Online publication date: 24-Aug-2024
  • (2022)FAS-DQN: Freshness-Aware Scheduling via Reinforcement Learning for Latency-Sensitive ApplicationsIEEE Transactions on Computers10.1109/TC.2021.312934271:10(2381-2394)Online publication date: 1-Oct-2022
  • (2021)Guaranteeing Timely Response to Changes of Monitored Objects by Assigning Deadlines and Periods to TasksACM Transactions on Embedded Computing Systems10.1145/347702720:5s(1-22)Online publication date: 22-Sep-2021
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers
IEEE Transactions on Computers  Volume 49, Issue 2
February 2000
93 pages
ISSN:0018-9340
Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 February 2000

Author Tags

  1. Real-time databases
  2. data similarity
  3. load adjustment
  4. serializability.

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Deadline and Period Assignment for Guaranteeing Timely Response of the Cyber-Physical SystemACM Transactions on Design Automation of Electronic Systems10.1145/368904830:1(1-26)Online publication date: 24-Aug-2024
  • (2022)FAS-DQN: Freshness-Aware Scheduling via Reinforcement Learning for Latency-Sensitive ApplicationsIEEE Transactions on Computers10.1109/TC.2021.312934271:10(2381-2394)Online publication date: 1-Oct-2022
  • (2021)Guaranteeing Timely Response to Changes of Monitored Objects by Assigning Deadlines and Periods to TasksACM Transactions on Embedded Computing Systems10.1145/347702720:5s(1-22)Online publication date: 22-Sep-2021
  • (2006)Specification and Management of QoS in Real-Time Databases Supporting Imprecise ComputationsIEEE Transactions on Computers10.1109/TC.2006.4555:3(304-319)Online publication date: 1-Mar-2006
  • (2002)Concurrency Control for Mixed Transactions in Real-Time DatabasesIEEE Transactions on Computers10.1109/TC.2002.101770251:7(821-834)Online publication date: 1-Jul-2002

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media