Pages that link to "Item:Q1260649"
From MaRDI portal
The following pages link to Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649):
Displaying 10 items.
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems (Q1898204) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- (Q4473911) (← links)
- Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
- Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
