Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

DOI10.1016/j.cor.2005.01.005zbMath1086.90021OpenAlexW2084327596MaRDI QIDQ2489280

Tatjana Davidović, Teodor Gabriel Crainic

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.005

zbMATH Keywords

Task schedulingCommunication delaysBenchmark-problem instancesMultiprocessor systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules ⋮ ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems ⋮ A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ MPI Parallelization of Variable Neighborhood Search ⋮ Parallelization strategies for bee colony optimization based on message passing communication protocol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assigning dependency graphs onto processor networks
• NP-complete scheduling problems
• Task scheduling with and without communication delays: A unified approach
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Benchmarking and comparison of the task graph scheduling algorithms
• Optimal scheduling for two-processor systems
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• A note on LPT scheduling

This page was built for publication: Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems