Skip to main content
SpringerLink
Log in

Performance Studies of Shared-Nothing Parallel Transaction Processing Systems

  • Conference paper
  • First Online:
Book cover Parallel Computing Technologies (PaCT 1999)

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

Included in the following conference series:

Abstract

We study the system performance affected by Degree of Declustering (DD) and the additional overheads in shared-nothing par- allel transaction processing systems with the widely used two-phased locking (2PL) concurrency control method by simulation. We show that for the environment of high resource contention, a large DD is beneficial. For a system in the environment of low resource contention, if we have infinite frontend resource, a large DD is beneficial; otherwise a large DD would degrade system performance. It is shown that as the level of the resource contention in disks decreases, the additional overhead of par- allelism increases. Furthermore, it is shown that the functions attached to frontend nodes affect system performance to a significant degree for shared-nothing parallel TP systems. These results provide insights for improving performance of shared-nothing parallel transaction processing systems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. P. Bernstein and E. Newcomer, Principles of Transaction Processing. Morgan Kaufmann, Inc., San Francisco, California, 1997.

    MATH  Google Scholar 

  2. H. Boral, et al., Prototyping Bubba, A Highly Parallel Database System, IEEE Trans. Knowledge Data Eng. Vol. 1, pp. 4–24, 1990.

    Article  Google Scholar 

  3. S. P. Dandamudi, and C. Y. Chow, Performance of Transaction Scheduling Policies for Parallel Database Systems, Proc. 11th IEEE Conf. Distributed Computing Sys., pp. 116–124, 1991.

    Google Scholar 

  4. D. J. DeWitt, et al., GAMMA-A High Performance Dataflow Database Machine, in: Proc. 12th VLDB Conf., (Kyoto, Japan, 1986) 25–28.

    Google Scholar 

  5. D. J. DeWitt, S. Ghandeharizadeh, D. Schneider, A Performance Analysis of the Gamma Database Machine, in Proc. ACM SIGMOD Conf. on Management of Data, pp. 350–360, Chicago, 1988.

    Google Scholar 

  6. S. Englert, R. Glasstone and W. Hashan, Parallelism and Its Price: A Case Study of NopStop SQL/MP, ACM SIGMOD Rec. Vol. 24, No. 4, pp. 61–71, Dec. 1995.

    Article  Google Scholar 

  7. K. P. Eswaran, J. N. Gray, R. A. Lorie and I. L. Traiger, The Notions of Consistency and Predicate Locks in a Database System, Commun. ACM, Vol. 11, pp. 624–633, 1976.

    Article  MathSciNet  Google Scholar 

  8. P. A. Franaszek, J. R. Haritsa, J. T. Robinson and A. Thomasian, Distributed Concurrency Control Based on Limited Wait-Depth, IEEE Trans. Parallel Distributed Sys. Vol. 11, pp. 1246–1264, 1993.

    Article  Google Scholar 

  9. S. Ghandeharizadeh and D. J. DeWitt, “Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines, ” Proc. 16th VLDB Conf., pp.481–492, Melbourne, Australia, 1990.

    Google Scholar 

  10. B. C. Jenq, B. C. Twitchell, and T. W. Keller, “Locking Performance in a Shared-Nothing Parallel Database Machine, ” IEEE Trans. Knowledge Data Eng., Vol.1, No.4, pp.530–543, Dec. 1989.

    Article  Google Scholar 

  11. R. Maret and E. Rahm, “Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems, ” Proc. PARLE’92, Lecture Notes in Computer Science, Vol. 605 (Springer) pp.295–310, 1992.

    Google Scholar 

  12. K. Salem, H. Garca-Molina and J. Shands, “Altruistic Locking” ACM Trans. on Database Systems, Vol.19, pp.117–165, 1994.

    Article  Google Scholar 

  13. M. Stonebraker, “The Case for Shared Nothing, ” Database Eng. Bull., Vol.9, No.1, pp.4–9, Mar. 1986.

    Google Scholar 

  14. Tandem, “Cyclone/R Message System Performance, ” Technical Report, Tandem Computers

    Google Scholar 

  15. Tandem Database Group, “NonStop SQL, A Distributed, High-Performance, High-Reliability Implementation of SQL, ” Proc. 2nd Workshop on High Performance Transaction Systems, pp.60–104. CA, 1987. ia]16._ Tandem Performance Group, “A Benchmark of NonStop SQL on the Debit Credit Transaction, ” Proc. ACM SIGMOD Conf. on Management of Data, pp.337–341, Chicago, 1988.

    Google Scholar 

  16. Y. C. Tay, N. Goodman, and R. Suri, “Locking Performance in Centralized Databases, ” ACM Trans. Database Sys., Vol.10, No.4, pp.415–462, 1985.

    Article  MATH  Google Scholar 

  17. Teradata, “DBC/1012 Data Base Computer Concepts & Facilities, ” Document No. C02-001-00, Teradata Corp., 1983.

    Google Scholar 

  18. A. Thomasian, “Centralized Concurrency Control Methods for High-End TP, ” ACM SIGMOD Rec. Vol. 20, No. 3, pp. 106–115, Sep. 1991.

    Article  Google Scholar 

  19. A. Thomasian, “Two-Phase Locking Performance and Its Thrashing Behavior, ” ACM Trans. Database Sys. Vol. 18, No. 4, pp. 579–625, 1993.

    Article  Google Scholar 

  20. J. Wang, J. Li, and H. Kameda, “Simulation Studies on Concurrency Control in Parallel Transaction Processing Systems, ” Parallel Computing Vol. 23,, Issue 6, pp. 755–775, June, 1997.

    Article  MATH  Google Scholar 

  21. J. Wang, J. Li, and H. Kameda, “Distributed Concurrency Control with Local Wait-Depth Control Policy, ” IEICE Trans. on Information and Systems, Vol. E81-D, No. 6, pp. 513–520, June, 1998.

    Google Scholar 

  22. P. S. Yu, “Modeling and Analysis of Transaction Processing Systems” Lecture Notes in Computer Science, 729, pp. 651–675, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba Science City, Ibaraki, 305-8573, Japan

    Jie Li & Hisao Kameda

  2. Faculty of Software and Information Sciences, Iwate Prefectural University, Iwate, 020-0173, Japan

    Jiahong Wang

Authors
  1. Jie Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiahong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hisao Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Center, 6 Lavrentiev Avenue, Novosibirsk, 630090, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, J., Wang, J., Kameda, H. (1999). Performance Studies of Shared-Nothing Parallel Transaction Processing Systems. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66363-8

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation