Fast and generalized polynomial time memory consistency verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4144 LNCS, Issue , 2006, Pages 503-516

  Roy, Amitabha ^a   Zeisset, Stephan ^a   Fleckenstein, Charles J ^a   Huang, John C ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; POLYNOMIALS; PROBLEM SOLVING;

MEMORY CONSISTENCY MODEL; MICROPROCESSOR VERIFICATION; MULTITHREADED EXECUTION; POLYNOMIAL TIME MEMORY CONSISTENCY VERIFICATION;

COMPUTER PROGRAMMING;

EID: 33749871751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_46     Document Type: Conference Paper

References (16)

1. Sudheendra Hangal, Durgam Vahia, Chaiyasit Manovit, and Juin-Yeu Joseph Lu. Tsotool: A program for verifying memory systems using the memory consistency model. In ISCA '04: Proceedings of the 31st annual international symposium on Computer architecture, page 114, Washington, DC, USA, 2004. IEEE Computer Society.
2. Phillip B. Gibbons and Ephraim Korach. The complexity of sequential consistency. In SPDP:Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, pages 317-325, 1992.
3. Jason F. Cantin, Mikko H. Lipasti, and James E. Smith. The complexity of verifying memory coherence. In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 254-255, New York, NY, USA, 2003. ACM Press.
4. Cantin, J. F., Lipasti, M. H., and Smith, J. E. "The Complexity of Verifying Memory Coherence". In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (SPAA), pages 254 - 255, San Diego, 2003.
5. Chaiyasit Manovit and Sudheendra Hangal. Efficient algorithms for verifying memory consistency. In SPAA'05: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures, pages 245-252, New York, NY, USA, 2005. ACM Press.
6. Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. Computer, 29(12):66-76, 1996.
7. Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip B. Gibbons, Anoop Gupta, and John L. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In 25 Years ISCA: Retrospectives and Reprints, pages 376-387, 1998.
8. IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide. Intel Corporation, 2005. URL: http://www.intel.com/design/ pentium4/manuals/index-new.htm.
9. Intel Itanium Architecture Volume 1:Application Architecture. Intel Corporation, 2005. URL: http://www.intel.com/design/itanium/manuals/iiasdmanual. htm.
10. Harold W. Cain, Mikko H. Lipasti, and Ravi Nair. Constraint graph analysis of multithreaded programs. In PACT '03: Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques, page 4, Washington, DC, USA, 2003. IEEE Computer Society.
11. Ganesh Gopalakrishnan, Yue Yang, and Hemanthkumar Sivaraj. Qb or not qb: An efficient execution verification tool for memory orderings. In CAV, pages 401-413, 2004.
12. A Formal Specification of Intel Itanium Processor Family Memory Ordering. Intel Corporation, 2005. URL: http://www.intel.com/design/itanium/downloads/ 251429.htm.
13. Stephen Warshall. A theorem on boolean matrices. J. ACM, 9(1):11-12, 1962.
14. Charles J. Fleckenstein John C. Huang Amitabha Roy, Stephan Zeisset. Fast and Generalized Polynomial Time Memory Consistency Verification. Technical Report arXiv:cs.AR/0605039, May 2006.
15. Utpal K. Banerjee. Loop Parallelization. Kluwer Academic Publishers, Norwell, MA, USA, 1994.
16. Bob Bentley. Validating the intel pentium 4 microprocessor. In DAC '01: Proceedings of the 38th conference on Design automation, pages 244-248, New York, NY, USA, 2001. ACM Press.