Pages that link to "Item:Q1318555"

The following pages link to List scheduling with and without communication delays (Q1318555):

Displaying 18 items.

• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
• Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems (Q543079) (← links)
• Sensitivity bounds for machine scheduling with uncertain communication delays (Q880514) (← links)
• List scheduling in the presence of branches. A theoretical evaluation (Q1128736) (← links)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← 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)
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
• List scheduling revisited (Q1919183) (← links)
• Communication contention in APN list scheduling algorithm (Q2267003) (← links)
• Quantum circuit physical design methodology with emphasis on physical synthesis (Q2454210) (← links)
• A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures (Q4671284) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• Scheduling 2-dimensional grids with large communication delays (Q5247700) (← links)
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL (Q5249015) (← links)
• CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS (Q5291296) (← links)
• Cooperative<i>ad hoc</i>computing: towards enabling cooperative processing in wireless environments (Q5451176) (← links)