Pages that link to "Item:Q3833608"

The following pages link to Scheduling Precedence Graphs in Systems with Interprocessor Communication Times (Q3833608):

Displaying 36 items.

• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• Decentralized list scheduling (Q367649) (← links)
• Scheduling malleable tasks with precedence constraints (Q414874) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
• Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems (Q543079) (← links)
• Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
• A bipartite genetic algorithm for multi-processor task scheduling (Q735353) (← links)
• Entropic grid scheduling (Q851181) (← links)
• Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling (Q1208593) (← links)
• Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
• Two-way dominant sequence clustering for processor scheduling (Q1318742) (← 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)
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms (Q1850711) (← links)
• An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
• Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
• Trusted dynamic level scheduling based on Bayes trust model (Q2385417) (← links)
• A comparison of multiprocessor task scheduling algorithms with communication costs (Q2456658) (← links)
• Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
• Open shop scheduling with delays (Q4020512) (← links)
• On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS (Q4366900) (← links)
• Scheduling Precedence Task Graphs with Disturbances (Q4467894) (← links)
• (Q4473911) (← links)
• On-line Scheduling with Optimal Worst-Case Response Time (Q4718601) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS (Q4820116) (← 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)
• List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity (Q5445761) (← links)
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays (Q5929309) (← links)
• Bounds and algorithms for a practical task allocation model (extended abstract) (Q6487459) (← links)
• Communication-aware scheduling of precedence-constrained tasks on related machines (Q6556208) (← links)