Message Reordering

Message Reordering is a message ordering mechanism in distributed systems that belongs to the class of causal ordering protocols and specifically ensures that messages are delivered to receivers in an order that preserves causality by reordering messages upon arrival based on their logical timestamps or dependencies.

25

Publications

1.4K

Citations

66

Authors

33

Institutions

Publications per year

2017–2026

3

Authors

66

  1. DA
    D. Agarwal

    Lawrence Berkeley National Laboratory, United States

    3 publications · 443 citations

    3

    h-index

  2. PM
    P. M. Melliar‐Smith

    University of California, Santa Barbara, United States

    3 publications · 443 citations

    3

    h-index

  3. LM
    L.E. Moser

    University of California, Santa Barbara, United States

    3 publications · 443 citations

    3

    h-index

  4. JM
    Justin Manweiler

    Duke University, United States

    2 publications · 75 citations

    2

    h-index

  5. YH
    Yennun Huang

    AT&T (United States), United States

    2 publications · 79 citations

    2

    h-index

1–5 of 66

Venues

  1. ACM Transactions on Computer Systems

    TOCS · 2 publications · 350 citations

    2

    h-index

  2. 1

    h-index

  3. Machine Translation

    1 publications · 59 citations

    1

    h-index

  4. Journal of Systems Architecture

    JSA · 1 publications · 13 citations

    1

    h-index

  5. IEEE Transactions on Computers

    1 publications · 25 citations

    1

    h-index

1–5