Pages that link to "Item:Q1266702"
From MaRDI portal
The following pages link to Task scheduling with and without communication delays: A unified approach (Q1266702):
Displaying 25 items.
- Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems (Q332517) (← links)
- Delay-bounded scheduling without delay! (Q832185) (← links)
- Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
- A robust compile time method for scheduling task parallelism on distributed memory machines (Q1275335) (← links)
- Upper and lower bounds on the makespan of schedules for tree dags on linear arrays (Q1277394) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Scheduling tasks and communications on a virtual distributed system (Q1278306) (← links)
- A versatile cost modelling approach for multicomputer task scheduling: Special issue on task scheduling problems for parallel and distributed systems (Q1285551) (← links)
- List scheduling with and without communication delays (Q1318555) (← links)
- A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013) (← links)
- Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
- On multiprocessor system scheduling (Q1383800) (← links)
- A task duplication based scalable scheduling algorithm for distributed memory systems (Q1384519) (← links)
- Scheduling loosely connected task graphs. (Q1401986) (← links)
- Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166) (← links)
- Adaptive scheduling of computations and communications on distributed-memory systems (Q1579743) (← links)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- Unconstrained static scheduling with communication weights (Q1850709) (← links)
- Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems (Q1898204) (← links)
- An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- Scheduling on Two Unbounded Resources with Communication Costs (Q3297565) (← links)
- Parallel Processing and Applied Mathematics (Q5307420) (← links)
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
