Skip to main content
SpringerLink
Log in

Prescheduling policy for real-time concurrency control: A performance evaluation

  • Published:
Journal of Systems Integration

Abstract

A new priority management policy, aprescheduling policy, is proposed. This policy can be applied on any conventional concurrency control protocol to schedule a real-time transaction. Costly preemption is avoided by the prescheduling policy, and parsing dataset of a transaction is not needed. Three widely used conventional concurrency control protocols (dynamic two-phase locking, basic timestamp ordering, and optimistic) are incorporated with the prescheduling policy to form three real-time concurrency control protocols. Performance of the three protocols is evaluated from three different viewpoints: database management systems, protocols, and transaction. From a database management system viewpoint, we show the prescheduling policy can improve the performance of protocols by raising thevalid ratio and reducingrestart counts. In general, two-phase locking with the prescheduling policy performs the best in most cases and yields the best choice for concurrency control in a real-time application. Deciding factors that affect performance of each protocol are identified from protocol viewpoint. Some suggestions are given for writing a timely transaction from the aspect of transaction viewpoint.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Abbott and H. Garcia-Molina, “Scheduling real-time transactions: a performance evaluation,” inProceedings 14th Int. Conf. on Very Large Data Base, Los Angeles, CA, pp. 1–12, 1988.

  2. R. Abbott and H. Garcia-Molina, “Scheduling real-time transactions with disk resident data,” inProceedings 15th Int. Conf. on Very Large Data Base, Amsterdam, pp. 385–396, 1989.

  3. R. Agrawal, M. J. Carey, and M. Livny, “Concurrency control performance modeling: alternatives and implications,”ACM Trans. Database Syst., vol. 12, no. 4, pp. 609–654, 1987.

    Article  Google Scholar 

  4. P. A. Bernstein, D. W. Shipman, and J. B. Rothnie, Jr., “Concurrency control in a system for distributed database (SDD-1),”ACM Trans. Database Syst., vol. 5, no. 1, pp. 18–51, 1980.

    Article  Google Scholar 

  5. P. Bernstein and N. Goodman, “Timestamp-based algorithms for concurrency control in distributed database systems,” inProceedings 6th Int. Conf. on Very Large Data Base, Montreal, Canada, pp. 285–300, October 1980.

  6. A. P. Buchmann, D. R. McCarthy, M. Hsu, and V. Dayal, “Time-critical database scheduling: A framework for integrating real-time scheduling and concurrency control,” inProc. of IEEE Real-Time Systems Symposium, Santa Molic, CA, pp. 470–480, 1989.

  7. M. J. Carey and M. R. Stonebraker, “The performance of concurrency control algorithms for database management systems,” inProceedings 10th Int. Conf. on Very Large Data Base, Singapore, pp. 107–117, 1984.

  8. K. Chrysanthis and K. Ramamritham, “ACTA: A framework for specifying and reasoning about transaction structure and behavior,” inProceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, pp. 194–203, 1990.

  9. J. Gray, “Notes on database operating systems,” inOperating Systems: An Advanced Course, Springer-Verlag, 1979.

  10. E. D. Jensen, C. D. Locke, and H. Tokuda, “A time-driven model for real-time operating systems,” inProc. IEEE Real-Time Systems Symposium, San Jose, CA, pp. 112–122, 1986.

  11. A. Kumar and M. Stonebraker, “Performance evaluation of an operating system transactions manager,” inProceedings 13th Int. Conf. on Very Large Data Base, Brighton, England, pp. 473–481, 1987.

  12. H. T. Kung and J. T. Robinson, “On optimistic methods for concurrency control,”ACM Trans. Database Syst., vol. 6, no. 2, pp. 213–226, 1981.

    Article  Google Scholar 

  13. C. U. Orji, L. Lilien, and J. Hyziak, “A performance analysis of an optimistic and a basic timestamp-ordering concurrency control algorithms for centralized database systems,” inProc. of IEEE International Conference on Data Engineering, Los Angeles, CA, pp. 64–71, 1988.

  14. R. Sargent, “Statistic analysis of simulation output data,” inProceedings of the 4th Annual Symposium on the Simulation of Computer Systems, pp. 39–50, August 1976.

  15. L. Sha, R. Rajkumar, and J. P. Lehoczky, “Concurrency control for distributed real-time databases,”SIGMOD RECORD, vol. 17, no. 1, pp. 82–98, 1988.

    Google Scholar 

  16. A. D. Stoyenko, V. C. Hamacher, and R. C. Holt, “Analyzing hard-real-time programs for guaranteed schedulability,”IEEE Trans. Software Engineering, vol. 17, no. 8, pp. 737–750, July 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, National Tsing Hua University, 30043, Hsinchu, Taiwan

    S. M. Tseng & Y. H. Chin

Authors
  1. S. M. Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. H. Chin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseng, S.M., Chin, Y.H. Prescheduling policy for real-time concurrency control: A performance evaluation. Journal of Systems Integration 3, 23–42 (1993). https://doi.org/10.1007/BF01974170

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01974170

Key Words

Search

Navigation