Evolutionary Model of Optimization of Modular Associative Memory for Dataflow Machines Based on Genetic Algorithm

Authors:
A. V. Nikitin;L. I. Nikitina
Affiliations:
Moscow State University, Vorob'evy gory, Moscow, 119899 Russia;Institute of Nuclear Physics, Moscow State University, Vorob'evy gory, Moscow, 119899 Russia
Venue:
Programming and Computing Software
Year:
2002

Citing 3
Cited 0

Multithreading: a revisionist view of dataflow architectures

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

An evolutionary model of modular associative memory for machines with dataflow architecture is suggested. A problem of determination of optimal allocation of a dataflow in a computational system with modular associative memory is formulated. The model suggested is based on graph representation of the dataflow. The allocation of the dataflow among modules is realized by means of a hash function. A method for searching for optimal hashing with the use of a genetic algorithm is suggested. The convergence of the genetic algorithm is studied. Estimates of optimal allocation among modules of associative memory for various computational problems are obtained.