Task Graph Analysis

Task Graph Analysis is a formal method within Worst-Case Execution Time Analysis that models program execution as a directed graph to capture task dependencies, control flow, and resource contention, enabling precise computation of worst-case timing bounds.

118

Publications

5.6K

Citations

334

Authors

134

Institutions

Publications per year

2017–2026

19

Authors

334

  1. MJ
    Marco J.G. Bekooij

    NXP (Netherlands), Netherlands

    5 publications · 119 citations

    5

    h-index

  2. NG
    Nan Guan

    Northeastern University, China

    3 publications · 160 citations

    5

    h-index

  3. MH
    Maarten H. Wiggers

    University of Twente, Netherlands

    4 publications · 101 citations

    4

    h-index

  4. ZG
    Zhishan Guo

    University of Central Florida, United States

    1 publications · 88 citations

    3

    h-index

  5. MR
    Mustafizur Rahman

    The University of Melbourne, Australia

    2 publications · 262 citations

    2

    h-index

1–5 of 334

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 449 citations

    4

    h-index

  2. IEEE Transactions on Computers

    2 publications · 40 citations

    2

    h-index

  3. Real-Time Systems

    1 publications · 10 citations

    2

    h-index

  4. 2

    h-index

  5. The Journal of Supercomputing

    1 publications · 16 citations

    1

    h-index

1–5