Skip to main content
SpringerLink
Log in

Shared Memory Contention and Its Impact on Multiprocessor Call Control Throughput

  • Chapter
  • First Online:
Performance Engineering (WOSP 2000, GWPESD 2000)

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

  • 358 Accesses

Abstract

A Shared-Memory Multi-Processor Call Control (SMMPCC) is described when the executing transactions contend for access to shared memory addresses. First, memory contention is characterized, then the system throughput is modelled analytically. Based on the model, bounds for the throughput are found. Also shown are how the throughput depends on the number of processors, contention level and on how far into transaction execution a contention on memory access happens.

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. Thomasian, A.: Two-Phase Locking Performance and Its Thrashing behavior. ACM Transactions on Database Systems, December, 18(1993)4, 579–625

    Article  Google Scholar 

  2. Tay, Y.C., Suri, R., Goodman, N.: A Mean Value Performance Model for Locking in Databases: The No-Waiting Case. Journal of the Association for Computing Machinery, July, 32(1985)3, 618–651

    MATH  MathSciNet  Google Scholar 

  3. Thomasian, A.: On a More Realistic Lock Contention Model and Its Analysis (1994) 2–9

    Google Scholar 

  4. Thomasian, A.: Performance Evaluation of Centralized Databases with Static Locking. IEEE Trans. Software Engineering, April, 11(1985)4, 346–355

    Article  Google Scholar 

  5. Cooper, R.: Introduction to Queueing Theory. Macmillan, New York (1972)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nortel Networks, PO Box 3511, Station C, Ottawa, ON, Canada, K1Y 4H7

    T. Drwiega

Authors
  1. T. Drwiega
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Otto-von-Guericke-Universität Magdeburg, Postfach 4120, 39016, Magdeburg, Germany

    Reiner Dumke , Claus Rautenstrauch  & André Scholz ,  & 

  2. EZ Berlin, Deutsche Telekom AG, Wittestraße 30 H, 13509, Berlin

    Andreas Schmietendorf

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Drwiega, T. (2001). Shared Memory Contention and Its Impact on Multiprocessor Call Control Throughput. In: Dumke, R., Rautenstrauch, C., Scholz, A., Schmietendorf, A. (eds) Performance Engineering. WOSP GWPESD 2000 2000. Lecture Notes in Computer Science, vol 2047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45156-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45156-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42145-0

  • Online ISBN: 978-3-540-45156-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation