Task Affinity

Task Affinity is a task scheduling constraint in parallel computing that specifies the preferential or required execution of a task on a particular processing unit or subset of resources based on data locality, load balancing, or prior execution context.

17

Publications

1.4K

Citations

66

Authors

28

Institutions

Publications per year

2017–2026

9

Authors

66

  1. ZM
    Zoltán Majó

    ETH Zurich, Switzerland

    2 publications · 26 citations

    2

    h-index

  2. AA
    Anthony A. Maciejewski

    Colorado State University, United States

    2 publications · 32 citations

    2

    h-index

  3. JC
    Jason Cong

    University of California, Los Angeles, United States

    2 publications · 57 citations

    2

    h-index

  4. ZC
    Zhen Cui

    Nanjing University of Science and Technology, China

    2 publications · 350 citations

    2

    h-index

  5. NS
    Nicu Sebe

    University of Trento, Italy

    2 publications · 350 citations

    2

    h-index

1–5 of 66

Venues

  1. arXiv (Cornell University)

    Repository · 2 publications · 40 citations

    2

    h-index

  2. 1

    h-index

  3. ACM SIGPLAN Notices

    1 publications · 12 citations

    1

    h-index

  4. Information Sciences

    1 publications · 22 citations

    1

    h-index

  5. ACM Transactions on Parallel Computing

    TOPC · 1 publications · 10 citations

    1

    h-index

1–5