Bounding variance and expectation of longest path lengths in DAGs

Authors:
Jeff Edmonds;Supratik Chakraborty
Affiliations:
York University, Canada;IIT Bombay, India
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 7
Cited 0

Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Approximate Mean Value Analysis for Stochastic Marked Graphs

IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Algorithms in C

Algorithms in C
Introduction to Algorithms

Introduction to Algorithms
Probabilistic Timing Analysis of Asynchronous Systems with Moments of Delays

ASYNC '02 Proceedings of the 8th International Symposium on Asynchronus Circuits and Systems
Numerical analysis of stochastic marked graph nets

PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Systems Analysis and Design with UML

Systems Analysis and Design with UML

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of computing bounds on the variance and expectation of the longest path length in a DAG from knowledge of variance and expectation of edge lengths. We focus primarily on the case where all edge lengths are non-negative and the DAG has a single source and sink node. We present analytic bounds for various simple DAG structures, and present a new algorithm to compute bounds for more general DAG structures. Our algorithm is motivated by an analogy with balance of forces in a network of "strange" springs.