Pages that link to "Item:Q4864438"
From MaRDI portal
The following pages link to The Complexity of Scheduling Trees with Communication Delays (Q4864438):
Displayed 12 items.
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
- Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Unconstrained static scheduling with communication weights (Q1850709) (← links)
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
- Performance of critical path type algorithms for scheduling on parallel processors (Q5949904) (← links)