Pages that link to "Item:Q2464442"
From MaRDI portal
The following pages link to Scheduling trees with large communication delays on two identical processors (Q2464442):
Displaying 13 items.
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (Q1277394) (← links)
- Minimizing the overhead for some tree-scheduling problems (Q1278303) (← 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)
- Complexity of master-slave tasking on heterogeneous trees (Q1767690) (← links)
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356) (← links)
- Scheduling UET Trees with Communication Delays on two Processors (Q4497893) (← links)
- The complexity of scheduling problems with communication delays for trees (Q5056138) (← links)
- Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
