Pages that link to "Item:Q1350013"

The following pages link to A heuristic for scheduling task graphs with communication delays onto multiprocessors (Q1350013):

Displaying 12 items.

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors (Q1208577) (← links)
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays (Q1260649) (← links)
• A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning (Q1268800) (← links)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
• Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
• Unconstrained static scheduling with communication weights (Q1850709) (← links)
• A new multi-resolution parallel framework for SPH (Q1986949) (← links)
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
• PPM -- a highly efficient parallel particle-mesh library for the simulation of continuum systems (Q2495743) (← links)
• Optimal schedules for d-D grid graphs with communication delays (Q4593968) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)