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

Computers and Operations Research

Volumn 40, Issue 10, 2013, Pages 2322-2328

  Al Badawi, Ahmad ^a   Shatnawi, Ali ^b  

^a TAIF UNIVERSITY   (Saudi Arabia)

^b JORDAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Jordan)

Author keywords

Combinatorial problems; Graph theory; Multiprocessor scheduling; NP complete; Parallel processing; Particle swarm optimization

Indexed keywords

COMBINATORIAL PROBLEM; DIRECTED ACYCLIC GRAPH (DAG); MULTI PROCESSOR SCHEDULING; MULTIPROCESSOR TASK SCHEDULING; NP COMPLETE; PARALLEL PROCESSING; PRECEDENCE CONSTRAINTS; SYSTEMATIC INVESTIGATIONS;

COMPUTATIONAL COMPLEXITY; DATA FLOW ANALYSIS; DATA FLOW GRAPHS; GENETIC ALGORITHMS; GRAPH THEORY; MULTIPROCESSING SYSTEMS; PARTICLE SWARM OPTIMIZATION (PSO);

SCHEDULING;

EID: 84878146550     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.03.015     Document Type: Article

References (20)

1. Braun TD, Siegel HJ, Beck N, Bölöni LL, Maheswaran M, Reuther AI et al. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Eighth heterogeneous computing workshop (HWC), 1999. p. 15-23.
2. J. Bruno, E.G. Coffman Jr., and R. Sethi Scheduling independent tasks to reduce mean finishing time Communications of the ACM 17 7 1974 382 387
3. Y.C. Chow, and W.H. Kohler Models for dynamic load balancing in a heterogeneous multiple processor system IEEE Transactions on Computers 28 1979 354 361
4. E.G. Coffman, and R.L. Graham Optimal scheduling for two-processor systems Acta Informatica 1 3 1972 200 213
5. T. Cormen, C. Leiserson, R. Rivest, and C. Stein Introduction to algorithms 2nd ed. 2003 MIT Press
6. H.N. Gabow An almost linear algorithm for two-processor scheduling Journal of the ACM 29 3 1982 766 780
7. E.S.H. Hou, N. Ansari, and H. Ren A genetic algorithm for multiprocessor scheduling IEEE Transactions on Parallel and Distributed Systems 5 2 1994 113 120
8. O.H. Ibarra, and C.E. Kim Heuristic algorithms for scheduling independent tasks on non-identical processors Journal of the ACM 24 2 1977 280 289
9. Jin S, Schiavone G, Turgut D. A performance study of multiprocessor task scheduling algorithms, vol. 43. Springer; 2008. p. 77-97.
10. De Jong GG. Data flow graphs: system specification with the most unrestricted semantics. In: Proceedings of the European conference on design automation (EDAC), 1994. p. 401-5.
11. J. Kennedy, R.C. Eberhart, and Y. Shi Swarm intelligence 1st ed. 2001 Morgan Kaufmann San Francisco, USA
12. Kruatrachue B, Lewis T. Duplication scheduling heuristic DSH: a new precedence task scheduler for parallel processing systems. PhD thesis. Corvallis: Oregon State University; 1987.
13. Kwok YK, Ahmad I. Benchmarking the task graph scheduling algorithms. In: HKUST, 2003.
14. McCreary CL, Khan AA, Thompson J, McArdle ME. A comparison of heuristics for scheduling DAGs on multiprocessors. In: Proceedings of the eighth international parallel processing symposium, 1994. p. 446-51.
15. R. Mendes, J. Kennedy, and J. Neves The fully informed particle swarm simpler, maybe better IEEE Transactions on Evolutionary Computation 8 2004 204 210
16. Z. Sevkli, F.E. Sevilgen, and Ö. Keleş Particle swarm optimization for the orienteering problem Algorithmica 35 1 2004 30 39
17. A. Shatnawi, M.O. Ahmad, and M.N.S. Swamy Optimal scheduling of digital signal processing data-flow graphs using shortest-path algorithm British Computer Society 45 1 2002 88 100 (Pubitemid 34160009)
18. O. Sinnen Task scheduling for parallel systems 1st ed. 2007 John Wiley and Sons Inc Hoboken, NJ
19. Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: IEEE Congress on Evolutionary Computation, 2004. CEC2004, vol. 2, 2004. p. 1412-9.
20. T. Tobita, and H. Kasahara A standard task graph set for fair evaluation of multiprocessor scheduling algorithms Journal of Scheduling 5 2002 379 394 (Pubitemid 41604842)