Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization

DOI10.1016/j.cor.2013.03.015zbMath1348.68022OpenAlexW2030065083MaRDI QIDQ336513

Ahmad Al Badawi, Ali Shatnawi

Publication date: 10 November 2016

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

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

zbMATH Keywords

multiprocessor schedulinggraph theorycombinatorial problemsparallel processingparticle swarm optimizationNP-complete problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A comprehensive survey on particle swarm optimization algorithm and its applications ⋮ A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues

Cites Work

• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Optimal scheduling for two-processor systems
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
• Optimal Scheduling of Digital Signal Processing Data-flow Graphs using Shortest-path Algorithms
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization