Computer
Memory storage patterns in parallel processing
Memory storage patterns in parallel processing
Data optimization: allocation of arrays to reduce communication on SIMD machines
Journal of Parallel and Distributed Computing - Massively parallel computation
A data locality optimizing algorithm
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Automatic data mapping for distributed-memory parallel computers
ICS '92 Proceedings of the 6th international conference on Supercomputing
Global optimizations for parallelism and locality on scalable parallel machines
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Communication-free hyperplane partitioning of nested loops
Journal of Parallel and Distributed Computing
Efficient Algorithms for Data Distribution on Distributed Memory Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A comparative workload-based methodology for performance evaluation of parallel computers
Future Generation Computer Systems
Deriving Array Distributions by Optimization Techniques
The Journal of Supercomputing
Matrix Multiplication on Heterogeneous Platforms
IEEE Transactions on Parallel and Distributed Systems
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers)
IEEE Transactions on Computers
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Compile-Time Techniques for Data Distribution in Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Automatic Data Layout Using 0-1 Integer Programming
PACT '94 Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques
Steady State Memetic Algorithm for Partial Shape Matching
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Selected Papers from AISB Workshop on Evolutionary Computing
Optimization of Data Distribution and Processor Allocation Problem Using Simulated Annealing
The Journal of Supercomputing
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Performance of parallel programs: model and analyses
Performance of parallel programs: model and analyses
Compiler techniques for optimizing communication and data distribution for distributed-memory multicomputers
A Study on the use of "self-generation'' in memetic algorithms
Natural Computing: an international journal
Genetic algorithms and artificial life
Artificial Life
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Memetic algorithms for nurse rostering
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Journal of Systems and Software
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A genetic algorithm for generating improvised music
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
The Interleaved Constructive Memetic Algorithm and its application to timetabling
Computers and Operations Research
| Hi-index | 0.00 |
Discovering the optimum number of processors and the distribution of data on distributed memory parallel computers for a given algorithm is a demanding task. A memetic algorithm (MA) is proposed here to find the best number of processors and the best data distribution method to be used for each stage of a parallel program. Steady state memetic algorithm is compared with transgenerational memetic algorithm using different crossover operators and hill-climbing methods. A self-adaptive MA is also implemented, based on a multimeme strategy. All the experiments are carried out on computationally intensive, communication intensive, and mixed problem instances. The MA performs successfully for the illustrative problem instances.