Pages that link to "Item:Q5056138"
From MaRDI portal
The following pages link to The complexity of scheduling problems with communication delays for trees (Q5056138):
Displaying 10 items.
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems (Q1285547) (← links)
- Tree scheduling with communication delays (Q1327224) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- New complexity results on scheduling with small communication delays (Q1894375) (← links)
- Complexity of a class of task scheduling problems (Q2711272) (← links)
- Scheduling UET Trees with Communication Delays on two Processors (Q4497893) (← links)
- The complexity of scheduling problems with communication delays for trees (Q5056138) (← links)
- Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
- Data transmission in processor networks (Q6084553) (← links)