Pages that link to "Item:Q1898204"
From MaRDI portal
The following pages link to Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems (Q1898204):
Displaying 8 items.
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
- Minimizing the schedule length for a parallel 3D-grid precedence graph (Q1278401) (← links)
- Lower bounds on precedence-constrained scheduling for parallel processors. (Q1853033) (← links)
- ILP formulations for scheduling ordered tasks on a bounded number of processors (Q2741499) (← links)
- (Q4473911) (← links)
- (Q4529450) (← links)
- (Q4536380) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)