Pages that link to "Item:Q2508774"
From MaRDI portal
The following pages link to Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph (Q2508774):
Displaying 6 items.
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors (Q1706041) (← links)
- Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)