Y.-K. Kwok and I. Ahmad. E#cient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J. Parallel and Distributed Computing, 47:58--77, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fine Tuning the Scheduling of Tasks through a Genetic.. - Navet, Migge (Correct)
.... nish. In this study, we decided to use the technique of GAs because it has already been extensively used for solving scheduling problems such as Job Shop [12, 43, 18, 15, 46] the Travelling Salesman problem [45, 25] instruction scheduling [8, 7] or scheduling on multiprocessor en4 vironments [30, 48, 16, 33, 11, 17, 53] and has proven to be successful. GA performances have been compared with other optimisation techniques such as Tabu Search [6] or Simulated Annealing [51] and the results show that GAs are never bad on average for a large variety of problems : GA is said to be a robust approach [24] For ....
Y.K. Kwok and I. Ahmad. E cient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing - Special Issue on Parallel Evolutionary Computing, 47(1):5877, November 1997.
A Platform Independent Parallelising Tool Based on Graph.. - Sinnen, Sousa (2000) (Correct)
....better results from these algorithms, three of them MH [2] DLS [16] BSA [17] were among the rst algorithms implemented for the parallelising tool. Most of the DAG algorithms analyse the structure of the DAG for scheduling. New approaches exist that take genetic algorithms into account [24, 25]. Apart from the DAG algorithms, algorithms based on the ITG are being implemented. For this graph model unfolding, re timing and software pipelining are popular techniques [26, 27, 11] Some of these algorithms utilise again DAG scheduling algorithms for partially unfolded ITGs. To bene t from ....
Yu-Kwong Kwok and Ishfaq Ahmad. E cient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing, 47(1):5877, November 1997.
Mathematical Programming-Based Approach to.. - Davidovic.. (2004) (Correct)
No context found.
Y.-K. Kwok and I. Ahmad. E#cient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J. Parallel and Distributed Computing, 47:58--77, 1997.
A Parallel Genetic Scheduling Algorithm to Generate High.. - Solar, Kri, Parada (2001) (Correct)
No context found.
Y. Kwok and I. Ahmad, E#cient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm. Journal on Parallel and Distributed Computing, 47, 1, 58-77, 1997.
Fine Tuning the Scheduling of Tasks on Posix1003.1b Compliant.. - Navet, Migge (1999) (Correct)
No context found.
Y.K. Kwok and I. Ahmad. E cient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing - Special Issue on Parallel Evolutionary Computing, 47(1):5877, November 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC