Static Task Scheduling

Static Task Scheduling is a task scheduling strategy in the domain of task parallelism that belongs to the class of compile-time scheduling methods, distinguished by its assignment of tasks to processors prior to program execution based on static analysis of the task dependency graph and without runtime adaptation.

150

Publications

8.4K

Citations

368

Authors

176

Institutions

Publications per year

2017–2026

23

Variants

Compile-time Task Scheduling

Authors

368

  1. YK
    Yu‐Kwong Kwok

    University of Hong Kong, Hong Kong SAR China

    4 publications · 346 citations

    4

    h-index

  2. ZG
    Zonghua Gu

    Zhejiang University, China

    4 publications · 82 citations

    4

    h-index

  3. MY
    Mingxuan Yuan

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

    4 publications · 82 citations

    4

    h-index

  4. XH
    Xiuqiang He

    Tsinghua University, China

    4 publications · 82 citations

    4

    h-index

  5. ZP
    Zebo Peng

    Linköping University, Sweden

    3 publications · 44 citations

    3

    h-index

1–5 of 368

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 7 publications · 1.3K citations

    7

    h-index

  2. Journal of Parallel and Distributed Computing

    4 publications · 506 citations

    4

    h-index

  3. Proceedings of the International Conference on Parallel Processing

    Conference · 3 publications · 103 citations

    3

    h-index

  4. International Journal of Computer Applications

    3 publications · 221 citations

    3

    h-index

  5. Procedia Computer Science

    3 publications · 227 citations

    3

    h-index

1–5