Computation-centric memory models

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computation-centric memory models

Full text

Pdf (1.32 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures table of contents

Puerto Vallarta, Mexico

Pages: 240 - 249

Year of Publication: 1998

ISBN:0-89791-989-0

Authors

Matteo Frigo	MIT Laboratory for Computer Science, 545 Technology Square NE43-203, Cambridge, MA
Victor Luchangco	Massachusetts Institute of Technology, 545 Technology Square NE43-369, Cambridge, MA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/277651.277690 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AG96	Sarita V. Adve , Kourosh Gharachorloo, Shared Memory Consistency Models: A Tutorial, Computer, v.29 n.12, p.66-76, December 1996 [doi>10.1109/2.546611]
	AH90	Sarita V. Adve , Mark D. Hill, Weak ordering—a new definition, Proceedings of the 17th annual international symposium on Computer Architecture, p.2-14, May 28-31, 1990, Seattle, Washington, United States
	AMNS96	Arvind, J. W. Maessen, R. S. Nikhil, and Joe Stoy. Lambda-S: an implicitly parallel lambda-calculus with letrec, synchronization and side-effects. Technical report, MIT Laboratory for Computer Science, Nov 1996. Computation Structures Group Memo 393, also available at http : //www. csg. lcs .mit. edu : 8001/pubs / csgmemo, html.
	Arv98	Arvind. Personal communication, January 1998.
	BFJ+96a	Robert D. Blumofe , Matteo Frigo , Christopher F. Joerg , Charles E. Leiserson , Keith H. Randall, An analysis of dag-consistent distributed shared-memory algorithms, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.297-308, June 24-26, 1996, Padua, Italy [doi>10.1145/237502.237574]
	BFJ+96b	Robert D. Blumofe , Matteo Frigo , Christopher F. Joerg , Charles E. Leiserson , Keith H. Randall, Dag-Consistent Distributed Shared Memory, Proceedings of the 10th International Parallel Processing Symposium, p.132-141, April 15-19, 1996
	BJK+95	Robert D. Blumofe , Christopher F. Joerg , Bradley C. Kuszmaul , Charles E. Leiserson , Keith H. Randall , Yuli Zhou, Cilk: an efficient multithreaded runtime system, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.207-216, July 19-21, 1995, Santa Barbara, California, United States
	Blu95	Robert D. Blumofe, Executing multithreaded programs efficiently, Massachusetts Institute of Technology, Cambridge, MA, 1996
	BZS93	Brian N. Bershad, Matthew J. Zekauskas, and Wayne A. Sawdon. The Midway distributed shared memory system. In Digest of Papers from the Thirty- Eighth IEEE Computer Society International Conference (Spring COMPCON), pages 528-537, San Francisco, California, February 1993.
	DSB86	M. Dubois , C. Scheurich , F. Briggs, Memory access buffering in multiprocessors, Proceedings of the 13th annual international symposium on Computer architecture, p.434-442, June 02-05, 1986, Tokyo, Japan
	Fri98	Matteo Frigo. The weakest reasonable memory model. Master's thesis, Massachusetts Institute of Technology, 1998.
	Gha95	Kourosh Gharachorloo, Memory consistency models for shared-memory multiprocessors, Stanford University, Stanford, CA, 1996
	GK94	Phillip B. Gibbons , Ephraim Korach, On testing cache-coherent shared memories, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.177-188, June 27-29, 1994, Cape May, New Jersey, United States [doi>10.1145/181014.181328]
	GLL+90	Kourosh Gharachorloo , Daniel Lenoski , James Laudon , Phillip Gibbons , Anoop Gupta , John Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, Proceedings of the 17th annual international symposium on Computer Architecture, p.15-26, May 28-31, 1990, Seattle, Washington, United States
	GM92	Phillip B. Gibbons , Michael Merritt, Specifying non-blocking shared memories (extended abstract), Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.306-315, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141895]
	GMG91	Phillip B. Gibbons , Michael Merritt , Kourosh Gharachorloo, Proving sequential consistency of high-performance shared memories (extended abstract), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.292-303, July 21-24, 1991, Hilton Head, South Carolina, United States [doi>10.1145/113379.113406]
	Goo89	James R. Goodman. Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherent Interface (SCI) Working Group, March 1989.
	GS95	Guang R. Gao and Vivek Sarkar. Location consistency: Stepping beyond memory coherence barrier. In Proceedings of the 1995 International Conference on Parallel Processing, pages 73-76, Oconomowoc, Wisconsin, August 1995.
	HP96	John L. Hennessy , David A. Patterson, Computer architecture (2nd ed.): a quantitative approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
	ISL96	Liviu Iftode , Jaswinder Pal Singh , Kai Li, Scope consistency: a bridge between release consistency and entry consistency, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.277-287, June 24-26, 1996, Padua, Italy [doi>10.1145/237502.237567]
	Joe96	Christopher F. Joerg, The cilk system for parallel multithreaded computing, Massachusetts Institute of Technology, Cambridge, MA, 1996
	KCZ92	Pete Keleher , Alan L. Cox , Willy Zwaenepoel, Lazy release consistency for software distributed shared memory, Proceedings of the 19th annual international symposium on Computer architecture, p.13-21, May 19-21, 1992, Queensland, Australia
	Lam79	Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690--691, September 1979.
	LT87	Nancy A. Lynch , Mark R. Tuttle, Hierarchical correctness proofs for distributed algorithms, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.137-151, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41852]
	Luc97	Victor Luchangco, Precedence-Based Memory Models, Proceedings of the 11th International Workshop on Distributed Algorithms, p.215-229, September 24-26, 1997

CITED BY 9

	Robert D. Blumofe , Charles E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM (JACM), v.46 n.5, p.720-748, Sept. 1999
	Victor Luchangco, Modeling weakly consistent memories with locks, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, p.332-333, July 2001, Crete Island, Greece
	Liang Peng , Weng-Fai Wong , Chung-Kwong Yuen, SilkRoad II: mixed paradigm cluster computing with RC_dag consistency, Parallel Computing, v.29 n.8, p.1091-1115, 1 August 2003
	Xiaowei Shen , Arvind , Larry Rudolph, Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers, ACM SIGARCH Computer Architecture News, v.27 n.2, p.150-161, May 1999
	Amol Nayate , Mike Dahlin , Arun Iyengar, Transparent information dissemination, Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware, October 18-22, 2004, Toronto, Canada
	Kunal Agrawal , Charles E. Leiserson , Jim Sukha, Memory models for open-nested transactions, Proceedings of the 2006 workshop on Memory system performance and correctness, October 22-22, 2006, San Jose, California
	Katherine F. Moore , Dan Grossman, High-level small-step operational semantics for transactions, ACM SIGPLAN Notices, v.43 n.1, January 2008
	Arvind Arvind , Jan-Willem Maessen, Memory Model = Instruction Reordering + Store Atomicity, ACM SIGARCH Computer Architecture News, v.34 n.2, p.29-40, May 2006
	Guoping Long , Dongrui Fan , Junchao Zhang, Architectural support for cilk computations on many-core architectures, Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, February 14-18, 2009, Raleigh, NC, USA