Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
From MaRDI portal
Recommendations
- On the minimum number of processors for scheduling problems with communication delays
- Task scheduling with and without communication delays: A unified approach
- A Heuristic for a Scheduling Problem with Communication Delays
- UET scheduling with unit interprocessor communication delays
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
Cited in
(39)- Communication-aware scheduling of precedence-constrained tasks on related machines
- scientific article; zbMATH DE number 1424463 (Why is no real title available?)
- Scheduling with uncertainties on new computing platforms
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Scheduling 2-dimensional grids with large communication delays
- An EPTAS for scheduling fork-join graphs with communication delay
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems
- List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
- Task scheduling with and without communication delays: A unified approach
- Scheduling malleable tasks with precedence constraints
- CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
- Entropic grid scheduling
- On the Complexity of Scheduling to Optimize Average Response Time
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
- A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS
- CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS
- A bipartite genetic algorithm for multi-processor task scheduling
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- Scheduling in the presence of processor networks : complexity and approximation
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- Two-way dominant sequence clustering for processor scheduling
- scientific article; zbMATH DE number 2080870 (Why is no real title available?)
- Reducing the solution space of optimal task scheduling
- Trusted dynamic level scheduling based on Bayes trust model
- Open shop scheduling with delays
- SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
- Upper bound on the number of processors for scheduling with interprocessor communication delays.
- An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
- Decentralized list scheduling
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
- Non-preemptive scheduling to maximize the minimum global inter-completion time
- Scheduling Precedence Task Graphs with Disturbances
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
- Bounds and algorithms for a practical task allocation model (extended abstract)
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- On-line Scheduling with Optimal Worst-Case Response Time
- Parallel Machine Scheduling with Uncertain Communication Delays
This page was built for publication: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833608)
