< Back to Article

Characterizing Task-Based OpenMP Programs

Fig 4

Task graph of Fibonacci.

Large graph: input n = 8, depth cutoff = ∞. Small graph in inset: input n = 8, depth cutoff = 3. Size of task nodes (gray) indicates instruction count. Critical path is marked by nodes with a red border.

doi: https://doi.org/10.1371/journal.pone.0123545.g004