Skip to main content

Performance issues in high performance transaction processing architectures

  • Performance Evaluation
  • Conference paper
  • First Online:
High Performance Transaction Systems (HPTS 1987)

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

Included in the following conference series:

Abstract

In this paper, we investigate the issues involved in using multiprocessors for high performance transaction processing applications. We use a simulation model to compare the performance of two different architectures, namely, Shared Everything and Shared Nothing. In Shared Everything, any processor can access any disk and all memory is shared. In Shared Nothing, neither disks nor memory is shared. We study the effects of response time constraints in both of these architectures and compare their performance in the presence of load imbalances. In addition, we study how intra-query parallelism affects the performance of both architectures under different operating conditions.

This research was sponsored by the Defense Advanced Research Projects Agency (DoD), Arpa Order No. 4871, monitored by Space and Naval Warfare Systems Command under Contract N00039-84-C-0089.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Agrawal, R., et. al., “Models for Studying Concurrency Control Performance: Alternatives and Implications,” Proceedings of the 1985 SIGMOD Conference, June 1985.

    Google Scholar 

  2. Bartlett, J.F., “A Non-Stop Kernel,” Proc. 8th Symposium on Operating Systems Principles, 1981.

    Google Scholar 

  3. Balter, R., et. al., “Why Control of Concurency Level in Distributed Systems is More Fundamental than Deadlock Management” Proc. 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Aug 1982.

    Google Scholar 

  4. Bhide, A., and Stonebraker, M., “A Performance Comparison of Two Architectures for Transaction Processing” Proc. 4th Intl. Conference on Data Engineering, Feb 1988.

    Google Scholar 

  5. Carey, M., et. al., “Dynamic Task Allocation in a Distributed Database System,” Proceedings of the 5th Intl. Conference on Distributed Computing Systems, May 1985.

    Google Scholar 

  6. Carey, M., et. al., “Load Balancing in a Locally Distributed Database System,” Computer Sciences Technical Report #625, U.W.-Madison, Dec 1985.

    Google Scholar 

  7. Demurjian, S.A., et. al., “A Multi-Backend Database System for Performance Gains,” Proceedings of 2nd International Conference on Data Engineering, Feb 1986.

    Google Scholar 

  8. Dewitt, D.J., “DIRECT-A Multiprocessor Organization for Supporting Relational Database Management Systems,” IEEE Trans. on Computers, June, 1979.

    Google Scholar 

  9. Dewitt, D.J., et. al., “GAMMA: A High Performance Dataflow Database Machine,” University of Wisconsin — Madison, C.S. Tech. Report 635.

    Google Scholar 

  10. Elhard, K. and Bayer, R., “A Database Cache for High Performance and Fast Restart in Database Systems,” ACM Trans. on Database Systems, Dec 1984.

    Google Scholar 

  11. Fishman, D.H. et. al., “Overview of the JASMIN Database Machine,” Proceedings of the 1984 SIGMOD Conference, June 1984.

    Google Scholar 

  12. Gardarin, G., et. al., “Design of a Multiprocessor Relational Database Machine,” Proceedings of the 1983 IFIP Conference, Paris, 1983.

    Google Scholar 

  13. Gray, J., et al. “A Measure of Transaction Processing Power,” Datamation 1984.

    Google Scholar 

  14. Gray, J., (private communication)

    Google Scholar 

  15. Hill, M., et. al., “Design Decisions in SPUR,” IEEE Computer, Nov. 1986.

    Google Scholar 

  16. Kakuta, T., et. al., “The Design and Implementation of the Relational Database Machine Delta,” Database Machines: Proceedings of the 4th International Workshop, Springer Verlag.

    Google Scholar 

  17. Reuter, A., “Load Control and Load Balancing in a Shared Database Management System,” Proceedings of Intl. Conference on Data Engineering, Feb 1986.

    Google Scholar 

  18. Sequent Computers, “Balance Guide to Parallel Programming,” June. 1986.

    Google Scholar 

  19. Skeen, D., “Non-blocking Commit Protocols,” Proceedings ACM SIGMOD Conference on Management of Data, June, 1982.

    Google Scholar 

  20. Su, S. et. al., “Parallel Algorithms and their Implementation in MICRONET”, Proceedings of the 8th VLDB Conference, Sept. 1982.

    Google Scholar 

  21. Tay, Y.C., and Suri, R., “Choice and Performance in Locking for Databases,” Proceedings of the 10th International Conference on Very Large Data Bases, Aug. 1984.

    Google Scholar 

  22. “Terradata: DBC/1012 Database Computer Concepts & Facilities, Teradata Corp. Document no. C02-0001-00, 1983.

    Google Scholar 

  23. Ubell, M., “The Intelligent Database Machine IDM,” Query Processing in Database Systems, Springer-Verlag, 1985.

    Google Scholar 

  24. Yu, P., et. al., ““On Coupling Many Small Systems for Transaction Processing,” The 13th Annual Symp. on Computer Architecture, June 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dieter Gawlick Mark Haynie Andreas Reuter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhide, A., Stonebraker, M. (1989). Performance issues in high performance transaction processing architectures. In: Gawlick, D., Haynie, M., Reuter, A. (eds) High Performance Transaction Systems. HPTS 1987. Lecture Notes in Computer Science, vol 359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51085-0_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-51085-0_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51085-7

  • Online ISBN: 978-3-540-46155-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics