Data-intensive Scheduling

Data-Intensive Scheduling is a scheduling paradigm that orchestrates computational tasks with primary emphasis on minimizing data movement and maximizing data locality, particularly in environments where the volume, velocity, and variability of data significantly influence scheduling decisions.

101

Publications

4K

Citations

313

Authors

158

Institutions

Publications per year

2017–2026

24

Authors

313

  1. ED
    Ewa Deelman

    University of Southern California, United States

    5 publications · 596 citations

    5

    h-index

  2. KW
    Kun Wang

    Nanjing University of Posts and Telecommunications, China

    3 publications · 108 citations

    3

    h-index

  3. KV
    Karan Vahi

    University of Southern California, United States

    3 publications · 535 citations

    3

    h-index

  4. ÜV
    Ümit V. Çatalyürek

    The Ohio State University, United States

    3 publications · 111 citations

    3

    h-index

  5. QZ
    Qihua Zhou

    Hong Kong Polytechnic University, Hong Kong SAR China

    3 publications · 108 citations

    3

    h-index

1–5 of 313

Venues

  1. Future Generation Computer Systems

    FGCS · 5 publications · 251 citations

    5

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 90 citations

    3

    h-index

  3. 3

    h-index

  4. Journal of Grid Computing

    3 publications · 143 citations

    3

    h-index

  5. The Computer Journal

    2 publications · 36 citations

    2

    h-index

1–5