Relaxed memory models: an operational approach

Conference object English OPEN
Boudol, Gérard; Petri, Gustavo;
  • Publisher: HAL CCSD
  • Subject: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages | ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.4: Processors/D.3.4.6: Optimization | [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

International audience; Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to have in a given model. A minimal guarantee memory models should provid... View more
  • References (34)
    34 references, page 1 of 4

    [1] M. ABADI, A. BIRRELL, T. HARRIS, M. ISARD, Semantics of transactional memory and automatic mutual exclusion, POPL'08 (2008) 63-74.

    [2] S. V. ADVE, Designing Memory Consistency Models for SharedMemory Multiprocessors, PhD Thesis, Univ. of Wisconsin (1993).

    [3] S. A. ADVE, K. GHARACHORLOO, Shared memory consistency models: a tutorial, IEEE Computer Vol. 29 No. 12 (1996) 66-76.

    [4] S. ADVE, M. D. HILL, Weak ordering - A new definition, ISCA'90 (1990) 2-14.

    [5] D. ASPINALL, J. S˘ EV C˘´IK, Formalising Java's data race free guarantee, TPHOLs'07, Lecture Notes in Comput. Sci. 4732 (2007) 22-37.

    [6] D. ASPINALL, J. S˘EV C˘´IK, Java memory model examples: good, bad and ugly, VAMP'07 (2007).

    [7] G. BERRY, J.-J. L E´VY, Minimal and optimal computations of recursive programs, J. of ACM 26 (1979) 148-175.

    [8] H.-J. BOEHM, S. V. ADVE, Foundations of the C++ concurrency model, PLDI'08 (2008) 68-78.

    [9] C. BLUNDELL, E. C. LEWIS, M. M. K. MARTIN, Subtleties of transactional memory atomicity semantics, IEEE Comput. Architecture Letters Vol. 5 No. 2 (2006).

    [10] G. BOUDOL, Atomic actions, INRIA Res. Rep. 1026 and EATCS Bull. 38 (1989) 136-144.

  • Metrics
Share - Bookmark