Skip to main content

Multi-scheduler Concurrency Control for Parallel Database Systems

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2834))

Included in the following conference series:

  • 546 Accesses

Abstract

Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as – very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion – Parallel Database Quasi-Serializability.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bhide, A.: An Analysis of Three Transaction Processing Architectures. In: Proceedings of 14th VLDB Conference, pp. 339–350 (1988)

    Google Scholar 

  2. DeWitt, D.J., Gray, J.: Parallel Database Systems: The Future of High Performance Database Systems. Communication of the ACM 35(6), 85–98 (1992)

    Article  Google Scholar 

  3. Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1993)

    MATH  Google Scholar 

  4. Sha, L., Rajkumar, R., Lehoczky, J.: Priority Inheritance Protocols: An Approach to Realtime Synchronization. IEEE Transactions 39(9), 1175–1185 (1990)

    Article  MathSciNet  Google Scholar 

  5. Stonebraker, M.: The Case for Shared-Nothing. IEEE Data Engineering 9(1), 4–9 (1986)

    Google Scholar 

  6. Neimat, M.-A., Schneider, D.A.: Achieving Transactional Scaleup on Unix. In: Parallel and Distributed Information Systems. In: Proceedings of the 3rd Intl. Conf. on, pp. 249–252 (1994)

    Google Scholar 

  7. Valduriez, P.: Parallel Database Systems: The Case For Shared Something. In: Proceedings of the International Conference on Data Engineering, pp. 460–465 (1993)

    Google Scholar 

  8. Valduriez, P.: Parallel Database Systems: Open Problems and New Issues. Distributed and Parallel Databases 1, 137–165 (1993)

    Article  Google Scholar 

  9. Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addision-Wesley, Reading (1987)

    Google Scholar 

  10. Thakkar, S.S., Sweiger, M.: Performance of an OLTP Application on Symmetry Multiprocessor System. In: Proceeding, 17th Intl. Conf. on Comp. Arch., pp. 228–238 (1990)

    Google Scholar 

  11. kuo, T.-W., Wu, J., Hsih, H.-C.: Real-time concurrency control in multiprocessor environment. IEEE Transaction, Parallel and Dist. Sys. 13(6), 659–671 (2002)

    Article  Google Scholar 

  12. Chen, S.D., Shen, H., Topor, R.: Permutation-based range-join algorithms on Ndimensional meshes. Parallel and Dist. Sys., IEEE Trans. 13(4), 413–431 (2002)

    Article  Google Scholar 

  13. Chen, C.-M., Sinha, R.K.: Analysis and comparison of declustering schemes for interactive navigation queries. IEEE Transactions on Knowledge and Data Engineering 12(5), 763–778 (2000)

    Article  Google Scholar 

  14. Barker, K.: Transaction Management on Multidatabase Systems, PhD thesis, Department of Computer Science, The university of Alberta, Canada (1990)

    Google Scholar 

  15. Ozsu, T., Valduriez, P.: Distributed and Parallel Database Systems. ACM Computing Surveys 28(1), 125–128 (1996)

    Article  Google Scholar 

  16. Ozsu, M.T., Valduriez, P. (eds.): Principles of Distributed Database Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goel, S., Sharda, H., Taniar, D. (2003). Multi-scheduler Concurrency Control for Parallel Database Systems. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics