Scheduling tasks of a parallel program in two-processor systems with use of cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1388, Issue , 1998, Pages 261-269

  Seredyński, Franciszek ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA; GENETIC ALGORITHMS; MULTIPROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

INITIAL ALLOCATIONS; MULTI PROCESSOR SYSTEMS; PARALLEL PROGRAM; SCHEDULING TASKS; SECOND PHASE; TWO PROCESSORS;

PROGRAM PROCESSORS;

EID: 84947418048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64359-1_696     Document Type: Conference Paper

References (6)

1. I. Ahmad (Ed.). Special Issue on Resource Management in Parallel and Distributed Systems with Dynamic Scheduling: Dynamic Scheduling, Concurrency: Practice and Experience, 7(7), 1995
2. R. Das, M. Mitchell, and J. P. Crutchfield, A genetic algorithm.discovers particle-based computation in cellular automata, In Davidor, Y., Schwefel, H.-P., Männer, R. (Eds.). Parallel Problem Solving from Nature-PPSN III. LNCS 866, Springer, 1994.
3. H. El-Rewini, T. G. Lewis, and H. H. All, Task Scheduling in Parallel and Distributed Systems. PTR Prentice Hall, 1994.
4. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989
5. Y. K. Kwok and I. Ahmad, Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. on Parallel and Distributed Systems. 7, N 5, May. 1996, pp. 506-521.
6. S. Wolfram, Universality and Complexity in Cellular Automata, Physica D 10, 1-35, 1984