Task Graph Scheduling

Task Graph Scheduling is a task scheduling method that organizes and executes computational tasks as nodes in a directed acyclic graph, where dependencies between tasks are explicitly represented by edges, distinguishing it from flat or decentralized scheduling approaches by enforcing execution order through graph topology.

93

Publications

4.6K

Citations

219

Authors

119

Institutions

Publications per year

2017–2026

17

Authors

219

  1. YK
    Yu‐Kwong Kwok

    University of Hong Kong, Hong Kong SAR China

    4 publications · 1.5K citations

    4

    h-index

  2. OS
    Oliver Sinnen

    University of Auckland, New Zealand

    3 publications · 51 citations

    3

    h-index

  3. FS
    Frédéric Suter

    Centre National de la Recherche Scientifique, France

    3 publications · 116 citations

    3

    h-index

  4. IA
    Iftikhar Ahmad

    Hong Kong University of Science and Technology, Hong Kong SAR China

    3 publications · 1.1K citations

    3

    h-index

  5. FE
    Frode Eika Sandnes

    OsloMet – Oslo Metropolitan University, Norway

    2 publications · 29 citations

    2

    h-index

1–5 of 219

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 1.2K citations

    8

    h-index

  2. 3

    h-index

  3. Journal of Parallel and Distributed Computing

    3 publications · 597 citations

    3

    h-index

  4. IEEE Transactions on Computers

    2 publications · 46 citations

    3

    h-index

  5. Parallel Computing

    2 publications · 46 citations

    2

    h-index

1–5