Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization
DOI10.1016/J.COR.2013.03.015zbMATH Open1348.68022OpenAlexW2030065083MaRDI QIDQ336513FDOQ336513
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
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
graph theoryparticle swarm optimizationcombinatorial problemsparallel processingNP-complete problemmultiprocessor scheduling
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)
Cites Work
- Optimal scheduling for two-processor systems
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Scheduling independent tasks to reduce mean finishing time
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- 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
Cited In (11)
- Title not available (Why is that?)
- Particle swarm optimization based sequential and parallel tasks scheduling model for heterogeneous multiprocessor systems
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- A comprehensive survey on particle swarm optimization algorithm and its applications
- Title not available (Why is that?)
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
- A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
- 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
- EFFICIENT CLUSTERING FOR PARALLEL TASKS EXECUTION IN DISTRIBUTED SYSTEMS
- Multi-core processor scheduling with respect to data bus bandwidth
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)
