Pages that link to "Item:Q1327224"
From MaRDI portal
The following pages link to Tree scheduling with communication delays (Q1327224):
Displaying 17 items.
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- Task scheduling with interprocessor communication delays (Q1197669) (← links)
- Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
- Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (Q1277394) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← 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)
- Scheduling task-trees with additive scales on parallel/distributed machines (Q1391320) (← links)
- Complexity of master-slave tasking on heterogeneous trees (Q1767690) (← links)
- Minimizing the volume in scheduling an out-tree with communication delays and duplication. (Q1853241) (← links)
- New complexity results on scheduling with small communication delays (Q1894375) (← links)
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- C.P.M. Scheduling with Small Communication Delays and Task Duplication (Q3980521) (← links)
- Scheduling UET Trees with Communication Delays on two Processors (Q4497893) (← links)
- Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)
