Scheduling parallel processes using genetic algorithms
暂无分享，去创建一个
[1] Peter M. A. Sloot,et al. The implementation of dynamite: an environment for migrating PVM tasks , 2000, OPSR.
[2] Larry J. Eshelman,et al. Biases in the Crossover Landscape , 1989, ICGA.
[3] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.
[4] Vaidy S. Sunderam,et al. Performance of the NAS Parallel Benchmarks on PVM-Based Networks , 1995, J. Parallel Distributed Comput..
[5] Marian Bubak,et al. Performance Measurement, Debugging and Load Balancing for Metacomputing , 2000 .
[6] G. Amdhal,et al. Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).
[7] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.
[8] Peter M. A. Sloot,et al. Experiments with Migration of PVM Tasks , 2000 .
[9] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[10] John L. Gustafson,et al. Reevaluating Amdahl's law , 1988, CACM.
[11] Jack Dongarra,et al. Pvm 3 user's guide and reference manual , 1993 .
[12] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[13] Peter M. A. Sloot,et al. Experiments with Migration of Message-Passing Tasks , 2000, GRID.
[14] Jack Dongarra,et al. A User''s Guide to PVM Parallel Virtual Machine , 1991 .
[15] Peter M. A. Sloot,et al. Performance Measurements on Dynamite/DPVM , 2000, PVM/MPI.