Pages that link to "Item:Q1403166"
From MaRDI portal
The following pages link to Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166):
Displaying 4 items.
- A note on Graham's bound (Q916353) (← links)
- Minimizing the number of machines for minimum length schedules (Q1042210) (← links)
- On the minimum number of processors for scheduling problems with communication delays (Q1290161) (← links)
- Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times (Q4210092) (← links)