skip to main content
10.1145/277651.277672acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article
Free Access

Lamport clocks: verifying a directory cache-coherence protocol

Authors Info & Claims
Published:01 June 1998Publication History
First page image

References

  1. 1.ianta v. AOve and Mark D. Hill. Weak urderlngmA New Definition. in Proceedings of the 17th Annual International symposium on Computer Architecture, pages 2-14, Seattle, Washington, May 28-31, 1990.Google ScholarGoogle Scholar
  2. 2.Hagit Attiya and Roy Friedman. A Correctness Condition for High-performance Multiprocessors. in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 679- 690, May 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.William W. Collier. Reasoning About Parallel Architectures. Prentice-Hall, Inc., 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.David Culler, Jaswinder Pal Singh, and Anoop Gupta. Draft of Parallel Computer Architecture: A Hardware#Software Approach, chapter 8: Directory-based Cache Coherence. Morgan Kaufmann, 1997.Google ScholarGoogle Scholar
  5. 5.Michel Dubois, Christoph Scheurich, and Faye Briggs. Memory Access Buffering in Multiprocessors. In Proceedings of the 13th Annual International Symposium on Computer Atchitecture, pages 434-442, June 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.AsgeirTh. Eiriksson and Ken L. McMillan. Using Formal Verification/Analysis Methods on the Critical Path in Systems Design: A Case Study. In Proceedings of the Computer Aided Verification Conference, Liege, Belgium, 1995. appears a#s LNCS 939, Springer Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Kourosh Gharachorloo, Sarita V. Adve, Anoop Gupta, John L. Hennessy, and Mark D. Hill. Specifying System Requirements for Memory Consistency Models. Technical Report CS-TR-1199, University of Wisconsin - Madison, December 1993.Google ScholarGoogle Scholar
  8. 8.Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip Gibbons, Anoop Gupta, and John Hennessy. Memory Consistency and Event Ordering in Scalable Shared-memory Multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26, May 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Phillip B. Gibbons, Michael Men'itt, and Kourosh Gharachorloo. Proving Sequential Consistency of High-Performance Shared Memories. In Symposium on Parallel Algorithms and Architectures, pages 292-303, July 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Leslie Lamport. Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558-565, July 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):241-248, September 1979.Google ScholarGoogle Scholar
  12. 12.James P. Laudon and Daniel Lenoski. The SGI Origin: A ccNUMA Highly Scalable Server. In Proceedings of the 24th International Symposium on Computer Architecture, Denver, CO, June 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Daniel Lenoski. Personal communication, March 1998.Google ScholarGoogle Scholar
  14. 14.Gil Neiger and Sam Toueg. Simulating Synchronized Clocks and Common Knowledge in Distributed Systems. Journal of the Association .tbr Computing Machinery, 40(2):334-367, April 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.Seungjoon Park and David L. Dill. An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order). In Proceedings of the 7th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 34-41, Santa Barbara, California, July 17-19, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Seungjoon Park and David L. Dill. Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions. In Proceedings of the 8th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 288-296, Padua, Italy, June 24-26, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.Fong Pong, Michael Browne, Andreas Nowatzyk, and Michel Dubois. Design Verification of the S3.mp Cache-Coherent Shared- Memory System. IEEE Transactions on Computers, 47( 1): 135- 140, January 1998, Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.Fong Pong and Michel Dubois. Verification Techniques for Cache Coherence Protocols. ACM Computing Surveys, 29(1):82-126, March 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.J. Protic, M. Tomasevic, and V. Milutinovic. Distributed Shared Memory: Concepts and Systems. IEEE Parallel and Distributed Technology, pages 63-79, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.Christoph Scheurich. Access Ordering and Coherence in Shared Memory Multiprocessors. Ph.D. Dissertation CENG 89-19, University of Southern California, May 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.Dennis Shasha and Marc Snir. Efficient and Correct Execution of Parallel Programs that Share Memory. ACM Transactions on Programming Languages and Systems, 10(2):282-312, April 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.Xiaowei Shen and Arvind. Specification of Memory Models and Design of Provably Correct Cache Coherence Protocols. Group Memo 398, Massachusetts Institute of Technology, June 1997.Google ScholarGoogle Scholar
  23. 23.Daniel J. Sorin, Manoj Plakal, Mark D. Hill, and Anne E. Condon. Lamport Clocks: Reasoning About Shared-Memory Correctness. Technical Report CS-TR- 1367, University of Wisconsin-Madison, March 1998.Google ScholarGoogle Scholar

Index Terms

  1. Lamport clocks: verifying a directory cache-coherence protocol

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
          June 1998
          312 pages
          ISBN:0897919890
          DOI:10.1145/277651

          Copyright © 1998 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 June 1998

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          SPAA '98 Paper Acceptance Rate30of84submissions,36%Overall Acceptance Rate447of1,461submissions,31%

          Upcoming Conference

          SPAA '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader