Parallel Search On Distributed Memory

Parallel Search On Distributed Memory is a computational method that enables concurrent exploration of search spaces across multiple processors with non-shared memory architectures, distinguished by its reliance on message-passing protocols to coordinate and synchronize search operations among distributed nodes.

11

Publications

345

Citations

31

Authors

13

Institutions

Publications per year

2017–2026

0

Authors

31

  1. TW
    Terence Wilson

    1 publications · 12 citations

    1

    h-index

  2. ED
    E. D’Azevedo

    Oak Ridge National Laboratory, United States

    1 publications · 35 citations

    1

    h-index

  3. CR
    C.H. Romine

    Oak Ridge National Laboratory, United States

    1 publications · 35 citations

    1

    h-index

  4. KK
    Kunihiko Kaneko

    The University of Tokyo, Japan

    1 publications · 18 citations

    1

    h-index

  5. CG
    Chittibabu Guda

    University of Nebraska Medical Center, United States

    1 publications · 29 citations

    1

    h-index

1–5 of 31

Venues

  1. Computer applications in the biosciences

    CABIOS · 1 publications · 21 citations

    1

    h-index

  2. Computational Economics

    1 publications · 40 citations

    1

    h-index

  3. International Journal of Parallel Programming

    1 publications · 21 citations

    1

    h-index

  4. Nucleic Acids Research

    1 publications · 29 citations

    1

    h-index

  5. Engineering Computations

    1 publications · 61 citations

    1

    h-index

1–5