A hierarchical approach for bounding the completion time distribution of stochastic task graphs.
Michele ColajanniFrancesco Lo PrestiSalvatore TucciPublished in: Perform. Evaluation (2000)
Keyphrases
- monte carlo
- probability distribution
- graph matching
- stochastic optimization
- upper bound
- random variables
- graph databases
- graph representation
- uniformly distributed
- spatial distribution
- uniform random
- attributed graphs
- marginal distributions
- power law
- spanning tree
- neural network
- graph mining
- graph theory
- learning algorithm