Pages that link to "Item:Q1904382"

The following pages link to Scheduling tasks with communication delays on parallel processors (Q1904382):

Displaying 14 items.

• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
• Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
• Multiprocessor scheduling with communication delays (Q922681) (← links)
• Scheduling tasks and communications on a virtual distributed system (Q1278306) (← links)
• Scheduling series-parallel orders subject to 0/1-communication delays (Q1285545) (← links)
• Scheduling series--parallel orders subject to 0/1-communication delays (Q1292209) (← links)
• A very difficult scheduling problem with communication delays (Q1604057) (← links)
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (Q2168731) (← links)
• A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658) (← links)
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
• Parallel processor scheduling with delay constraints (Q2768351) (← links)
• A linear time algorithm for scheduling outforests with communication delays on three processors (Q4805397) (← links)
• (Q4813028) (← links)