Pages that link to "Item:Q5939271"
From MaRDI portal
The following pages link to Optimal parallel processing of random task graphs (Q5939271):
Displaying 13 items.
- An optimal parallel processor bound in strong orientation of an undirected graph (Q1062459) (← links)
- Parallel algorithms for redundant precedence relations elimination in task systems (Q1179246) (← links)
- Optimal parallel scheduling for the 2-steps graph with constant task cost (Q1186173) (← links)
- Performance analysis of parallel programs based on directed acyclic graphs (Q1358615) (← links)
- Random allocation of jobs with weights and precedence (Q1365938) (← links)
- Dynamic scheduling of parallel computations (Q1583589) (← links)
- An empirical study of dynamic scheduling on rings of processors (Q1960607) (← links)
- Parallel execution of schedules with random dependency graph (Q2317877) (← links)
- Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems (Q2498703) (← links)
- Performance considerations on a random graph model for parallel processing (Q3142270) (← links)
- Speed of parallel processing for random task graphs (Q4296343) (← links)
- Applying Cilk in Provably Efficient Task Scheduling (Q4950864) (← links)
- On scheduling parallel tasks at twilight (Q5929028) (← links)