Data-aware Task Scheduling

Data-Aware Task Scheduling is a task scheduling strategy that incorporates knowledge of data location, access patterns, and movement costs to optimize task placement and execution order, thereby minimizing data transfer overhead and improving data locality in distributed computing environments.

46

Publications

2.2K

Citations

174

Authors

86

Institutions

Publications per year

2017–2026

18

Authors

174

  1. RB
    Rajkumar Buyya

    The University of Melbourne, Australia

    3 publications · 54 citations

    3

    h-index

  2. IF
    Ian Foster

    Argonne National Laboratory, United States

    3 publications · 118 citations

    3

    h-index

  3. JM
    Justin M. Wozniak

    Argonne National Laboratory, United States

    3 publications · 53 citations

    3

    h-index

  4. FR
    Francisco Rodrigo Duro

    Universidad Carlos III de Madrid, Spain

    2 publications · 29 citations

    2

    h-index

  5. DS
    Daniel S. Katz

    University of Illinois Urbana-Champaign, United States

    2 publications · 42 citations

    2

    h-index

1–5 of 174

Venues

  1. Future Generation Computer Systems

    FGCS · 4 publications · 378 citations

    4

    h-index

  2. 2

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 211 citations

    2

    h-index

  4. Journal of Parallel and Distributed Computing

    2 publications · 35 citations

    2

    h-index

  5. Digital Communications and Networks

    DCN · 1 publications · 48 citations

    1

    h-index

1–5