Message-passing Models

Message-Passing Models is a computational paradigm in parallel computation where processes or nodes communicate and coordinate by explicitly sending and receiving data packets, known as messages, through a network, distinguishing it from shared-memory models by relying on distributed memory and inter-process communication rather than direct access to a common address space.

625

Publications

52.9K

Citations

1.6K

Authors

488

Institutions

Publications per year

2017–2026

122

Authors

1.6K

  1. CH
    Ching‐Tien Ho

    IBM Research - Almaden, United States

    9 publications · 567 citations

    9

    h-index

  2. AS
    Anthony Skjellum

    University of Tennessee at Chattanooga, United States

    9 publications · 2.5K citations

    9

    h-index

  3. JB
    Jehoshua Bruck

    California Institute of Technology, United States

    9 publications · 563 citations

    9

    h-index

  4. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    9 publications · 672 citations

    9

    h-index

  5. SK
    Shlomo Kipnis

    IBM (United States), United States

    8 publications · 491 citations

    8

    h-index

1–5 of 1.6K

Venues

  1. arXiv (Cornell University)

    Repository · 25 publications · 5.3K citations

    17

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 15 publications · 739 citations

    14

    h-index

  3. Parallel Computing

    14 publications · 2.9K citations

    14

    h-index

  4. Journal of Parallel and Distributed Computing

    13 publications · 791 citations

    12

    h-index

  5. Concurrency Practice and Experience

    10 publications · 436 citations

    10

    h-index

1–5