Pages that link to "Item:Q1285547"

The following pages link to Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems (Q1285547):

Displaying 9 items.

• Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
• Tree scheduling with communication delays (Q1327224) (← links)
• Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
• Scheduling with interjob communication on parallel processors (Q1631686) (← links)
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
• An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
• Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
• Scheduling UET Trees with Communication Delays on two Processors (Q4497893) (← links)
• Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)