A hierarchical approach for bounding the completion time distribution of stochastic task graphs

DOI10.1016/S0166-5316(99)00054-1zbMath1016.68059OpenAlexW2137560467MaRDI QIDQ4779269

Salvatore Tucci, Francesco Lo Presti, Michele Colajanni

Publication date: 27 November 2002

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-5316(99)00054-1

zbMATH Keywords

Shogan algorithmTree\(\_\)Bound method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: A hierarchical approach for bounding the completion time distribution of stochastic task graphs