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

DOI10.1016/J.COR.2005.01.005zbMATH Open1086.90021OpenAlexW2084327596MaRDI QIDQ2489280FDOQ2489280

Authors: 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

Recommendations

• A heuristic for scheduling task graphs with communication delays onto multiprocessors
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• Scheduling tasks with communication delays on parallel processors
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• Task scheduling with and without communication delays: A unified approach
• Benchmarking and comparison of the task graph scheduling algorithms
• On the minimum number of processors for scheduling problems with communication delays

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)

Cites Work

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

Cited In (14)

• A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
• ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
• New MIP model for multiprocessor scheduling problem with communication delays
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
• 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
• Title not available (Why is that?)
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
• MPI parallelization of variable neighborhood search
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Parallelization strategies for bee colony optimization based on message passing communication protocol
• Bee colony optimization for scheduling independent tasks to identical processors
• A comparison of random task graph generation methods for scheduling problems
• PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489280)