Skip to main content
SpringerLink
Log in

Speculative Algorithms for Concurrency Control in Responsive Databases

  • Chapter
Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 297))

Abstract

Speculative Concurrency Control (SCC) is a new concurrency control approach, especially suited for responsive database systems [5]. SCC uses potentially redundant computations to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. We present SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms. Under SCC-nS, shadows executing on behalf of a transaction are eitheroptimisticorspeculative.Optimistic shadows execute under an assumed serialization order, which requires them to wait for no other conflicting transactions. They execute unhindered until they are either aborted or committed. Alternately, speculative shadows execute under an assumed serialization order, which requires them to wait forsomeconflicting transactions to commit We single out three SCC-nS family members, which differ in the amount of resources they require, and thus the level of speculation they perform. Finally, we present some simulation results that establish the correlation between speculation and timeliness.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robert Abbott, Hector Garcia-Molina. “Scheduling real-time transactions: A performance evaluation.” InProoceedings of the 14th International Conference on Very Large Data BasesLos Angeles, Ca, 1988.

    Google Scholar 

  2. R. Abbott and H. Garcia-Molina. “Scheduling real-time transaction: A performance evaluation.”ACM Transactions on Database Systems17(3):513–560, September 1992.

    Article  Google Scholar 

  3. R. Agrawal, M. Carey, and M. Linvy. “Concurency control performance modeling: Alternatives and implications.”ACM Transaction on Database Systems12(4), December 1987.

    Google Scholar 

  4. A. Bernstein, A. Philip, V. Hadzilacos, and N. Goodman.Concurrency Control And Recovery In Database Systems.Addison-Wesley, 1987.

    Google Scholar 

  5. Azer Bestavros. “Speculative Concurrency Control: A position statement.” Technical Report TR-92–016, Computer Science Department, Boston University, Boston, MA, July 1992.

    Google Scholar 

  6. Azer Bestavros, Spyridon Braoudakis, and Euthimios Panagos. “Performance evaluation of Two-shadow Speculative Concurrency Control.” Technical Report TR-93–001, Computer Science Department, Boston University, Boston, MA, January 1993.

    Google Scholar 

  7. C. Boksenbaum, M. Cart, J. Ferrié, and J. Francois. “Concurrent certifications by intervals of timestamps in distributed database systems.”IEEE Transactions on Software Engineeringpages 409–419, April 1987.

    Google Scholar 

  8. Spyridon Braoudakis. ConcurrencyControl Protocols for Real-Time Databases.PhD thesis, Computer Science Department, Boston University, Boston, MA 02215, expected June 1994.

    Google Scholar 

  9. A. P. Buchmann, D. C. McCarthy, M. Hsu, and U. Dayal. “Time-critical database scheduling: A framework for integrating real-time scheduling and concurrency controls.” InProceedings of the 5th International Conference on Data EngineeringLos Angeles, California, February 1989.

    Google Scholar 

  10. K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. “The notions of consistency and predicate locks in a database system.”Communications of the ACM19(11):624–633, November 1976.

    Article  MathSciNet  MATH  Google Scholar 

  11. Peter Franaszek and John Robinson. “Limitations of concurrency in transaction processing.”ACM Transactions on Database Systems 10(1)March 1985.

    Google Scholar 

  12. J. N. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger. “Granularity of locks and degrees of consistensy in a shared data base.” In G. M. Nijssen, editorModeling in Data Base Management Systemspages 365–395. North-Holland, Amsterdam, The Netherlands, 1976.

    Google Scholar 

  13. Jayant R. Haritsa, Michael J. Carey, and Miron Linvy. “Dynamic real-time optimistic concurrency control.” InProoceedings of the 11th Real-Time Systems SymposiumDecember 1990.

    Google Scholar 

  14. Jayant R. Haritsa, Michael J. Carey, and Miron Linvy. “On being optimistic about real-time constraints.” InProoceedings of the 1990 ACM PODS SymposiumApril 1990.

    Google Scholar 

  15. J. Huang, J. A. Stankovic, D. Towsley, and K. Ramamritham. “Experimental evaluation of real-time transaction processing.” InProceedings of the 10th Real-Time Systems SymposiumDecember 1989.

    Google Scholar 

  16. Jiandong Huang, John A. Stankovic, Krithi Ramamritham, and Don Towslwy. “Experimental evaluation of real-time optimistic concurrency control schemes.” InProoceedings of the 17th International Conference on Very Large Data BasesBarcelona, Spain, September 1991.

    Google Scholar 

  17. Woosaeng Kim and Jaideep Srivastava. “Enhancing real-time dbms performance with multiversion data and priority based disk scheduling.” InProoceedings of the 12th Real-Time Systems SymposiumDecember 1991.

    Google Scholar 

  18. Henry Korth. “Triggered real-time databases with consistency constraints.” InProceedings of the 16th International Conference on Very Large Data BasesBrisbane, Australia, 1990.

    Google Scholar 

  19. H. Kung and John Robinson. “On optimistic methods for concurrency control.”ACM Transactions on Database Systems 6(2)June 1981.

    Google Scholar 

  20. Yi Lin and Sang Son. “Concurrency control in real-time databases by dynamic adjustment of serialization order.” InProceedings of the 11th Real-Time Systems SymposiumDecember 1990.

    Google Scholar 

  21. D. Menasce and T. Nakanishi. “Optimistic versus pessimistic concurrency control mechanisms in database management systems.”Information Systems 7(1)1982.

    Google Scholar 

  22. Christos Papadimitriou. “The serializability of concurrent database updates.”Journal of the ACM26(4):631–653, October 1979.

    Article  MathSciNet  MATH  Google Scholar 

  23. Krithi Ramamritham and Panos Chrysanthis. “In search of acceptability criteria: Database consistency requirements and transaction correctness properties.” Technical Report COINS-TR-91–92, University of Massachusetts at Amherst, December 1991.

    Google Scholar 

  24. Krithi Ramamritham. “Real-time databases.”International journal of Distributed and Parallel Databases (Invited Paper — toappear), 1992.

    Google Scholar 

  25. John Robinson.Design of Concurrency Controls for Transaction Processing Systems. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1982.

    Google Scholar 

  26. L. Sha, R. Rajkumar, and J. Lehoczky. “Priority inheritance protocols: An approach to real-time synchronization.” Technical Report CMU-CS87–181, Carnegie Mellon University, Computer Science Department, December 1987.

    Google Scholar 

  27. Lui Sha, R. Rajkumar, and J. Lehoczky. “Concurrency control for distributed real-time databases.”ACM SIGMOD Record 17(1):82–981988.

    Article  Google Scholar 

  28. Lui Sha, R. Rajkumar, Sang Son, and Chun-Hyon Chang. “A real-time locking protocol.”IEEE Transactions on Computers40(7):793–800, 1991.

    Article  Google Scholar 

  29. Mukesh Singhal. “Issues and approaches to design real-time database systems.”ACM SIGMOD Record17(1):19–33, 1988.

    Article  Google Scholar 

  30. S. Son, S. Park, and Y. Lin. “An integrated real-time locking protocol.” InProoceedings of the IEEE International Conference on Data EngineeringTempe, AZ, February 1992.

    Google Scholar 

  31. John Stankovic and Wei Zhao. “On real-time transactions.”ACM SIG-MOD Record17(1):4–18, 1988.

    Article  Google Scholar 

  32. John Stankovic and Krithi Ramamritham. “Scheduling in real-time transaction systems.” Technical Report COINS-TR-91–46, University of Massachusetts at Amherst, December 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, CLA, Boston University, Boston, MA, 02215, USA

    Azer Bestavros

Authors
  1. Azer Bestavros
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The University of Texas at Austin, Austin, Texas, USA

    Donald S. Fussell

  2. Humboldt-Universität, Berlin, Germany

    Miroslaw Malek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this chapter

Cite this chapter

Bestavros, A. (1995). Speculative Algorithms for Concurrency Control in Responsive Databases. In: Fussell, D.S., Malek, M. (eds) Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems. The Springer International Series in Engineering and Computer Science, vol 297. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2271-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2271-3_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-9563-8

  • Online ISBN: 978-1-4615-2271-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation