Skip to main content
SpringerLink
Log in

Sequential consistency in distributed systems

  • Conference paper
  • First Online:
Theory and Practice in Distributed Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 938))

Abstract

Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simplifies programming. It has been shown that many practical applications using DSMs require competing operations. We have aimed at unifying theory and implementations of protocols for sequential consistency, which provides competing operations. By adopting concepts from concurrency control, we developed theory for sequential consistency, called a sequentializability theory. This paper first presents the sequentializability theory, and then demonstrates the correctness of existing protocols using the theory. Finally, the paper presents a new protocol which requires significantly less communication than previously proposed protocols in systems which do not provide hardware atomic broadcasting facilities.

This work was supported in part by the National Science Foundation under Grant CCR-9201645 and INT-9406785.

This work was supported in part by INRIA-NSF Cooperative Research Program Grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adve, S.V. and Hill, M.D. Weak ordering — a new definition. In Proceedings of the International Symposium on Computer Architecture, pages 2–14, 1990.

    Google Scholar 

  2. Afek, Y., Brown, G., and Merritt, M. Lazy caching. ACM Transactions on Programming Languages and Systems, 15(1):182–205, 1993.

    Google Scholar 

  3. Ahamad, M., Burns, J., Hutto, P., and Neiger, G. Causal memory. In Proceedings of 5th IWDAG, LNCS 579, pages 9–30, 1991.

    Google Scholar 

  4. Attiya, H. and Friedman, R. A correctness condition for high-performance multiprocessors. In Proceedings of the ACM Symposium on Theory of Computing, pages 679–690, 1992.

    Google Scholar 

  5. Attiya, H. and Welch, J. Sequential consistency versus linearizability. ACM TOCS, 12(2):91–122, 1994.

    Google Scholar 

  6. Bernstein, P.A, Hadzilacos, V., and Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Co., 1987.

    Google Scholar 

  7. Brown, G. Asynchronous multicaches. Distributed Computing, 4:31–36, 1990.

    Google Scholar 

  8. Dwarkadas, S., Keleher, P., Cox, A.L., and Zwaenepoel, W. Evaluation of release consistent software distributed shared memory on emerging network technology. In Proceedings of the International Symposium on Computer Architecture, pages 144–155, 1993.

    Google Scholar 

  9. Gharachorloo, K. and Gibbons, P. Detecting violations of sequential consistency. In Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1991.

    Google Scholar 

  10. Gharachorloo, K., Lenoski, D., Laudon J., Gibbons, P., Gupta, A., and Hennessy, J. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the International Symposium on Computer Architecture, pages 15–26, 1990.

    Google Scholar 

  11. Ibaraki T., Kameda T., and Minoura T. Serializability with constraints. ACM Transactions on Database Systems, 12(3):429–452, 1987.

    Google Scholar 

  12. Lamport, L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28:690–691, 1979.

    Google Scholar 

  13. Mizuno, M., Raynal, M., and Zhou J.Z. Sequential consistency in distributed systems: Theory and implementation. Technical Report 871, INRIA, Rennes France October 1994.

    Google Scholar 

  14. Papadimitriou C.H. The serializability of concurrent database updates. Journal of the ACM, 26(4):631–653, 1979.

    Article  Google Scholar 

  15. Raynal, M. and Mizuno, M. How to find his way in the jungle of consistency criteria for distributed shared memories (or how to escape from minos'labyrinth). In Proceedings of the 4th International IEEE Workshop on Future Trends of Distributed Computing Systems, pages 340–346, 1993.

    Google Scholar 

  16. Stenstrom, P. A latency-hiding scheme for multiprocessors with buffered multistage networks. In Proceedings of the 6th International Parallel Processing Symposium, pages 39–42, 1992.

    Google Scholar 

  17. Taylor, R.N. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57–84, 1083.

    Google Scholar 

  18. Zhou, Z., Mizuno, M., and Singh, G. A sequentially consistent distributed shared memory. In Proceedings of the International Conference on Computer and Information, pages 165–169, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing and Info. Sciences, Kansas State University, 66506, Manhattan, KS

    Masaaki Mizuno & James Z. Zhou

  2. IRISA, Campus de Beaulieu, 35042, Rennes Cedex, France

    Michel Raynal

Authors
  1. Masaaki Mizuno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. James Z. Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kenneth P. Birman Friedemann Mattern André Schiper

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mizuno, M., Raynal, M., Zhou, J.Z. (1995). Sequential consistency in distributed systems. In: Birman, K.P., Mattern, F., Schiper, A. (eds) Theory and Practice in Distributed Systems. Lecture Notes in Computer Science, vol 938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60042-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-60042-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60042-8

  • Online ISBN: 978-3-540-49409-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation