Skip to main content
SpringerLink
Log in

Modeling relaxed memory consistency protocols

  • Conference paper
  • First Online:
Quantitative Evaluation of Computing and Communication Systems (TOOLS 1995)

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

Abstract

This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN's) for analyzing memory consistency protocols for multiprocessors with Distributed Shared Memory (DSM). DSPN's are a numerically solvable modeling formalism with a graphical representation. The modeling approach addresses in particular the performance degradation due to the amount of message exchange, which is an important issue in software implementations of DSM with shared pages. DSPN's are employed for a comparative performance study of an adaptive memory consistency protocol, an eager-invalidate, and a delayed-invalidate release consistency protocol in a software implementation of DSM.

This work was supported by the Federal Ministry for Research and Technology of Germany (BMFT) and by the German Research Council (DFG) under grants ITR9003, Li 645/1-1 and Li 645/1-2, respectively.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.V. Adve and M.D. Hill, “Weak Ordering — A New Definition”, Proc. 17th Int. Symp. on Computer Architecture, pp. 2–14, 1990.

    Google Scholar 

  2. S.V. Adve and M.D. Hill, “A Unified Formalization of Four Shared-Memory Models”, IEEE Trans. Parallel and Distributed Systems, 4, pp. 613–624, 1993.

    Article  Google Scholar 

  3. M. Ajmone Marsan and G. Chiola, “On Petri Nets with Deterministic and Exponentially Distributed Firing Times”, in: G. Rozenberg (Ed.) Advances in Petri Nets 1986, Lecture Notes in Computer Science 266, pp. 132–145, Springer 1987.

    Google Scholar 

  4. J.B. Carter, J.K. Benett, and W. Zwaenepoel, “Implementation and Performance of Munin”, Proc. 13th ACM Symp. on Operating System Principles, pp. 152–164, 1991.

    Google Scholar 

  5. S. Dwarkadas, P. Keheler, A.L. Cox, and W. Zwaenepoel, “Evaluations of Release Consistent Distributed Shared Memory on Emerging Network Technology”, Proc. 20th Int, Symp. on Computer Architecture, San Diego, California, pp. 144–155, 1993.

    Google Scholar 

  6. K. Gharachorloo, A. Gupta, and J. Henessy, “Performance Evaluation of Memory Consistency Models for Shared-Memory Multiprocessors”, Proc. 4th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, Santa Clara California, pp. 245–257, 1991.

    Google Scholar 

  7. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Henessy, “Memory Consistency and Event Ordering in Scalable Shared Memory Multiprocessors”, Proc. 17th Int. Symp. on Computer Architecture, Seattle Washington, pp. 15–26, 1990.

    Google Scholar 

  8. W.K. Giloi, C. Hastedt, F. Schön, and W. Schröder-Preikschat, “A Distributed Implementation of Shared Virtual Memory with Strong and Weak Consistency”, Proc. 2nd European Distributed Memory Computing Conference, Munich Germany, pp. 23–31, 1991.

    Google Scholar 

  9. P. Keheler, A.L. Cox, and W. Zwaenepoel, “Lazy Release Consistency for Software Distributed Shared Memory”, Proc. 19th Int. Symp. on Computer Architecture, Gold Coast Australia, pp. 13–21, 1992.

    Google Scholar 

  10. K. Li and P. Hudak “Memory Coherence in Shared Virtual Memory”, ACM Trans. on Comp. Systems, 7, pp. 321–359, 1989.

    Article  Google Scholar 

  11. C. Lindemann, “DSPNexpress: A Software Package for the Efficient Solution of Deterministic and Stochastic Petri Nets”, Performance Evaluation, 22, pp. 3–21, 1995.

    Article  Google Scholar 

  12. C. Lindemann and F. Schön, “Evaluating Sequential Consistency in a Shared Virtual Memory System with Deterministic and Stochastic Petri Nets”, Proc. Int. Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, San Diego California, pp. 63–68, 1993.

    Google Scholar 

  13. S.K. Reinhard, M.D. Hill, J.R. Laras, A.R. Lebeck, J.C. Lewis, and D.A. Wood, “The Wisconsin Wind Tunnel: Virtual Prototyping for Parallel Computers”, Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Santa Clara, California, pp. 48–57, 1993.

    Google Scholar 

  14. M.K. Vernon and M.A. Holliday, “Performance Analysis of Multiprocessor Consistency Protocols using Generalized Timed Petri Nets”, Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pp. 9–17, 1986.

    Google Scholar 

  15. R. N. Zucker and J.-L. Baer, “A Performance Study of Memory Consistency Models”, Proc. 19th Int. Symp. on Computer Architecture, Gold Coast, Australia, pp. 2–12, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD Institute for Computer Architecture and Software Technology (GMD-FIRST) at the Technical University of Berlin, Rudower Chaussee 5, 12489, Berlin, Germany

    Christoph Lindemann & Friedrich Schön

Authors
  1. Christoph Lindemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Schön
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz Beilner Falko Bause

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lindemann, C., Schön, F. (1995). Modeling relaxed memory consistency protocols. In: Beilner, H., Bause, F. (eds) Quantitative Evaluation of Computing and Communication Systems. TOOLS 1995. Lecture Notes in Computer Science, vol 977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024329

Download citation

  • DOI: https://doi.org/10.1007/BFb0024329

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60300-9

  • Online ISBN: 978-3-540-44789-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation