Abstract
This paper presents a general framework for understanding precedence-based memory models, which are generalizations of standard multiprocessor models. Precedence-based models need not mention processes explicitly, and can express any conditions that rely only on some operations being required to precede other operations. We define a generalized notion of sequential consistency and per-location sequential consistency in this framework, and we analyze the Backer algorithm used in the Cilk system (3), showing that it implements per-location sequential consistency. We also give conditions under which client processes cannot distinguish a per-location sequentially consistent memory from a sequentially consistent one.
Supported by AFOSR-ONR contract F49640-941-0199, by ARPA contracts N00014-92-J-4033 and F19628-95-C-0118, and by NSF grant 9225124-CCR.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Technical Report 9512, Rice University, Sept. 1995.
H. Attiya, S. Chaudhuri, R. Friedman, and J. Welch. Shared memory consistency conditions for non-sequential execution: Definitions and programming strategies. In Proc. of the Fifth ACM Symp. on Parallel Algorithms and Architectures, June 1993.
R. D. Blumofe, M. Frigo, C. F. Joerg, C. E. Leiserson, and K. H. Randall. Dag-consistent distributed shared memory. In Proc. of the 10th Int'l Parallel Processing Symp., Honolulu, Hawaii, Apr. 1996.
R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proc. of the Fifth ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP), pages 207–216, Santa Barbara, California, July 1995.
A. Fekete, D. Gupta, V. Luchangco, N. Lynch, and A. Shvartsman. Eventually-serializable data services. In Proc. of the 15th ACM Symp. on Principles of Distributed Computing, pages 300–309, May 1996.
G. R. Gao and V. Sarkar. Location consistency: Stepping beyond the barriers of memory coherence and serializability. Technical Report 78, McGill University, ACAPS Laboratory, Dec. 1993.
K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. of the 17th Int'l Symp. on Computer Architecture, pages 15–26, Seattle, Washington, June 1990.
P. Gibbons and M. Merritt. Specifying nonblocking shared memories. In Proc. of the Fourth ACM Symp. on Parallel Algorithms and Architectures, June 1992.
J. R. Goodman. Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherent Interface (SCI) Working Group, Mar. 1989.
L. Iftode, J. P. Singh, and K. Li. Scope consistency: A bridge between release consistency and entry consistency. In Proc. of the Eighth ACM Symp. on Parallel Algorithms and Architectures, June 1996.
L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690–691, Sept. 1979.
N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, Calif., 1996.
Supercomputing Technologies Group. Cilk 4.0 Reference Manual. MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts 02139, June 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luchangco, V. (1997). Precedence-based memory models. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030686
Download citation
DOI: https://doi.org/10.1007/BFb0030686
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63575-8
Online ISBN: 978-3-540-69600-1
eBook Packages: Springer Book Archive