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

DOI10.1016/J.COR.2013.03.015MaRDI QIDQ336513zbMATH OpenOpenAlexFDO

Authors 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

graph theoryparticle swarm optimizationcombinatorial problemsparallel processingNP-complete problemmultiprocessor scheduling

Mathematics Subject Classification ID

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

Recommendations

• A comparison of multiprocessor task scheduling algorithms with communication costs
• Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
• Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments
• Directed acyclic task graph scheduling for heterogeneous computing systems by dynamic critical path duplication algorithm
• Process scheduling in heterogeneous multiprocessor systems

Cites work

• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• 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
• Optimal scheduling for two-processor systems
• Scheduling independent tasks to reduce mean finishing time

Cited in

(11)

• scientific article; zbMATH DE number 1859739 (Why is no real title available?)
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• A comprehensive survey on particle swarm optimization algorithm and its applications
• Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments
• EFFICIENT CLUSTERING FOR PARALLEL TASKS EXECUTION IN DISTRIBUTED SYSTEMS
• Particle swarm optimization based sequential and parallel tasks scheduling model for heterogeneous multiprocessor systems
• A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
• scientific article; zbMATH DE number 1863252 (Why is no real title available?)
• Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
• Multi-core processor scheduling with respect to data bus bandwidth
• PARAdeg-processor scheduling for acyclic SWITCH-less program nets

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

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