- 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 Scholar
- 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 ScholarDigital Library
- 3.William W. Collier. Reasoning About Parallel Architectures. Prentice-Hall, Inc., 1992. Google ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 13.Daniel Lenoski. Personal communication, March 1998.Google Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 18.Fong Pong and Michel Dubois. Verification Techniques for Cache Coherence Protocols. ACM Computing Surveys, 29(1):82-126, March 1997. Google ScholarDigital Library
- 19.J. Protic, M. Tomasevic, and V. Milutinovic. Distributed Shared Memory: Concepts and Systems. IEEE Parallel and Distributed Technology, pages 63-79, 1996. Google ScholarDigital Library
- 20.Christoph Scheurich. Access Ordering and Coherence in Shared Memory Multiprocessors. Ph.D. Dissertation CENG 89-19, University of Southern California, May 1989. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 Scholar
Index Terms
- Lamport clocks: verifying a directory cache-coherence protocol
Recommendations
Design and Analysis of a Scalable Cache Coherence Scheme Based on Clocks and Timestamps
A timestamp-based software-assisted cache coherence scheme that does not require any global communication to enforce the coherence of multiple private caches is proposed. It is intended for shared memory multiprocessors. The scheme is based on a compile-...
A Hybrid Approach for Synchronizing Clocks in Distributed Systems
Cloud Computing – CLOUD 2019AbstractThe art of synchronizing clocks across a wide area network has got a new dimension when it comes to the reality of achieving the demand for high-accuracy synchronization; even for local or small computing systems. Before implementing any clock ...
Using integer clocks to verify clock-synchronization protocols
We use the Uppaal model checker for timed automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN), the clock-synchronization algorithm of Lenzen, Locher and Wattenhofer (LLW) for general distributed systems, and the ...
Comments