Advertisement

Integrating an entry consistency memory model and concurrent object-oriented programming

  • Antonio J. Nebro
  • Ernesto Pimentel
  • José M. Troya
Workshop 05+06: Programming Languages and Concurrent Object-Oriented Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1300)

Abstract

Entry consistency is a weak memory consistency model that makes possible the efficient implementation of distributed shared memory (DSM) languages and systems. In this paper we study a way an entry consistency based memory model can be integrated into concurrent object-oriented languages. One problem to be solved is how to satisfy the entry consistency requirements when objects include synchronization constraints. We propose a solution based on the definition of a programming model with the following characteristics: (1) the establishment of ownership relations among objects, (2) a distinction between command and query operations, and (3) a lazy wait synchronization mechanism. Preliminary results show that significant speed-ups can be obtained.

Keywords

Travel Salesman Problem Distribute Shared Memory Query Operation Object Replication Synchronization Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agha, G: “Actors: A Model of Concurrent Computation in Distributed Systems”. The MIT Press. 1987.Google Scholar
  2. 2.
    Bershard, B. N., Zekauskas, M. J. “Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors”. Tech. Report CMU-CS-91-170. 1991.Google Scholar
  3. 3.
    Karamcheti, V., Chien, A.: “Concert-Efficient Runtime Support for Concurrent Object-Oriented Programming Languages on Stock Hardware”. In Proceedings of Supercomputing'93, Portland, Oregon. November 1993.Google Scholar
  4. 4.
    Matsuoka, S., Taura, K., Yonezawa, A.: “Highly Efficient and Encapsulated Re-use of Synchronization Code in Concurrent Object-Oriented Languages”. OOPSLA'93.Google Scholar
  5. 5.
    Meyer, B: “Systematic Concurrent Object-Oriented Programming”. Communications of the ACM, vol. 36, no. 9. September 1993.Google Scholar
  6. 6.
    Nitzberg, B., Lo, V.: “Distributed Shared Memory: A Survey of Issues and Algorithms”. IEEE Computer, vol 24. August 1991.Google Scholar
  7. 7.
    Papathomas, M.: “Concurrency Issues in Object-Oriented Languages”. Tech. Rep. Centre Universitaire Informatique. University of Geneva, D. Tsichritzis, Ed., 1989. 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antonio J. Nebro
    • 1
  • Ernesto Pimentel
    • 1
  • José M. Troya
    • 1
  1. 1.Depto. de Lenguajes y Ciencias de la ComputaciónUniversidad de MálagaMálagaSpain

Personalised recommendations