Parallel Algorithmic Skeletons

Parallel Algorithmic Skeletons is a formal computational framework that belongs to the class of high-level parallel programming models, distinguished by its provision of predefined, reusable patterns of parallelism that abstract low-level synchronization and communication details to enable scalable and efficient algorithm design.

86

Publications

2.9K

Citations

170

Authors

76

Institutions

Publications per year

2017–2026

5

Variants

Algorithmic Skeletons

Authors

170

  1. MD
    Marco Danelutto

    University of Pisa, Italy

    11 publications · 252 citations

    11

    h-index

  2. HK
    Herbert Kuchen

    University of Münster, Germany

    11 publications · 314 citations

    11

    h-index

  3. MA
    Marco Aldinucci

    University of Turin, Italy

    5 publications · 144 citations

    5

    h-index

  4. ZH
    Zhenjiang Hu

    National Institute of Informatics, Japan

    4 publications · 144 citations

    4

    h-index

  5. KH
    Kevin Hammond

    University of St Andrews, United Kingdom

    4 publications · 48 citations

    4

    h-index

1–5 of 170

Venues

  1. Parallel Processing Letters

    8 publications · 196 citations

    8

    h-index

  2. Parallel Computing

    7 publications · 643 citations

    7

    h-index

  3. International Journal of Parallel Programming

    7 publications · 125 citations

    7

    h-index

  4. Procedia Computer Science

    4 publications · 64 citations

    4

    h-index

  5. 2

    h-index

1–5