Total Store Order

Total Store Order is a memory consistency model that enforces a global order on all memory store operations such that all processors observe writes to memory in a uniform sequence, thereby preserving program order for writes while allowing limited reordering of other operations to optimize performance.

30

Publications

1.1K

Citations

77

Authors

45

Institutions

Publications per year

2017–2026

4

Authors

77

  1. CM
    Chaiyasit Manovit

    Stanford University, United States

    3 publications · 159 citations

    3

    h-index

  2. SH
    Sudheendra Hangal

    Stanford University, United States

    3 publications · 159 citations

    3

    h-index

  3. MF
    Mohamed Faouzi Atig

    Uppsala University, Sweden

    3 publications · 187 citations

    3

    h-index

  4. SB
    Sebastian Burckhardt

    Microsoft (United States), United States

    3 publications · 184 citations

    3

    h-index

  5. SH
    Shiyou Huang

    Texas A&M University, United States

    2 publications · 52 citations

    2

    h-index

1–5 of 77

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 22 citations

    2

    h-index

  2. ACM SIGARCH Computer Architecture News

    2 publications · 147 citations

    2

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 46 citations

    2

    h-index

  4. Kent Academic Repository (University of Kent)

    Repository · 1 publications · 30 citations

    1

    h-index

  5. ePrints Soton (University of Southampton)

    Repository · 1 publications · 19 citations

    1

    h-index

1–5