Pages that link to "Item:Q1097163"

The following pages link to UET scheduling with unit interprocessor communication delays (Q1097163):

Displaying 47 items.

• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
• Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
• Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
• A note on Graham's bound (Q916353) (← links)
• Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
• Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
• UET-scheduling with constrained processor allocations (Q1185984) (← links)
• Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• On the complexity of scheduling with large communication delays (Q1278302) (← links)
• Minimizing the overhead for some tree-scheduling problems (Q1278303) (← links)
• Optimal scheduling for UET/UET-UCT generalized \(n\)-dimensional grid task graphs (Q1291010) (← links)
• Tree scheduling with communication delays (Q1327224) (← links)
• Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284) (← links)
• Scheduling UET-UCT series-parallel graphs on two processors (Q1365936) (← links)
• Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
• Using duplication for scheduling unitary tasks on m processors with unit communication delays (Q1391530) (← links)
• 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
• Upper bound on the number of processors for scheduling with interprocessor communication delays. (Q1403166) (← links)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
• Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
• Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
• Scheduling rooted forests with communication delays (Q1842095) (← links)
• Scheduling chains on uniform processors with communication delays (Q1860371) (← 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)
• 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 in the presence of processor networks : complexity and approximation (Q2893338) (← links)
• Open shop scheduling with delays (Q4020512) (← links)
• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS (Q4366900) (← links)
• Scheduling UET Trees with Communication Delays on two Processors (Q4497893) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• (Q4843446) (← links)
• Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
• (Q5875469) (← links)
• New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← links)
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)
• Performance of critical path type algorithms for scheduling on parallel processors (Q5949904) (← links)
• Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
• Malleable scheduling beyond identical machines (Q6090217) (← links)
• Optimising makespan and energy consumption in task scheduling for parallel systems (Q6164588) (← links)
• A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays (Q6487185) (← links)