Speed of parallel processing for random task graphs
From MaRDI portal
Recommendations
Cited in
(18)- Performance analysis of parallel programs based on directed acyclic graphs
- A new formula for speedup and its characterization
- Limiting properties of random graph models with vertex and edge weights
- Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges
- Barak-Erdős graphs and the infinite-bin model
- Parallel execution of schedules with random dependency graph
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- Long-range last-passage percolation on the line
- On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph
- Performance considerations on a random graph model for parallel processing
- Limit theorems for a random directed slab graph
- Extreme values of phase-type and mixed random variables with parallel-processing examples
- Average execution times of series-parallel networks
- Optimal parallel processing of random task graphs
- Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
- Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
- Regularity of the time constant for last passage percolation on complete directed acyclic graphs
This page was built for publication: Speed of parallel processing for random task graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296343)
