Pages that link to "Item:Q4296343"
From MaRDI portal
The following pages link to Speed of parallel processing for random task graphs (Q4296343):
Displaying 15 items.
- Limit theorems for a random directed slab graph (Q417081) (← links)
- Performance analysis of parallel programs based on directed acyclic graphs (Q1358615) (← links)
- A new formula for speedup and its characterization (Q1364412) (← links)
- Limiting properties of random graph models with vertex and edge weights (Q1633963) (← links)
- Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges (Q2044129) (← links)
- Barak-Erdős graphs and the infinite-bin model (Q2077352) (← links)
- Parallel execution of schedules with random dependency graph (Q2317877) (← links)
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs (Q2325381) (← links)
- Long-range last-passage percolation on the line (Q2443191) (← links)
- On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph (Q2633393) (← links)
- Performance considerations on a random graph model for parallel processing (Q3142270) (← links)
- Extreme values of phase-type and mixed random variables with parallel-processing examples (Q4261297) (← links)
- Optimal parallel processing of random task graphs (Q5939271) (← links)
- Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph (Q6103986) (← links)
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models (Q6601394) (← links)