Generating high-quality random numbers in parallel by cellular automata
Future Generation Computer Systems - Special issue on cellular automata: promise in computational science
Non-Standard Computation
A parallel approach for multiprocessor scheduling
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Coevolutionary Life-Time Learning
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Immune-Like System Approach to Cellular Automata-Based Scheduling
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A distributed evolutionary method to design scheduling policies for volunteer computing
Proceedings of the 5th conference on Computing frontiers
A distributed evolutionary method to design scheduling policies for volunteer computing
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
The paper reports new results on developing parallel algorithms for multiprocessor scheduling with use of cellular automata (CAs). The simpliest case when a multiprocessor system is limited to two processors, but without of any limitations on a size and parameters of parallel programs is considered. An approach called a selected neighborhood is used to design a structure of CAs for a given program graph. Coevolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem is proposed. Sequential and parallel scheduling algorithms discovered in the context of CAs - based scheduleing system are compared.