Skip to main content
SpringerLink
Log in

Optimization of modular associative memory

  • Mathematical Models of Control
  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

Abstract

Mathematical models are proposed for optimizing the structure of modular associative memory. Optimal hashing is considered. The optimization problem is solved using a genetic algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. S. Burtsev, “A new system for organizing the execution of highly parallel computational processes: examples of possible architectural solutions of supercomputer design,” in: Parallelism of Computational Processes and Development of Supercomputer Architectures [in Russian], Moscow (1997).

  2. G. Popadopoulos and K. Traub, “Multithreading: a revisionist view of dataflow architecture,” SIGARCH Computer Arch. News,19, No. 3 (1991).

  3. V. S. Burtsev, “Using optical data processing methods in supercomputer architectures,” in: Parallelism of Computational Processes and Development of Supercomputer Architectures [in Russian], Moscow (1997).

  4. V. S. Burtsev and V. B. Fedorov, “Associative memory using optical data processing principles for new generation supercomputers,” in: Non-Traditional Computer Architectures. Supercomputers [in Russian], No. 2, Moscow (1994).

  5. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA (1989).

    Google Scholar 

  6. A. V. Nikitin, “Using GA for parallelization of programs,” in: Proc. EvCA '96.

  7. Thang Nguyen Bui and Byung Ro Moon, “Genetic algorithm and graph partitioning,” IEEE Trans. Comput.,45, No. 7 (July 1996).

  8. K. DeJong, “Evolutionary computation: recent development and open issues,” in: Proc. EvCA '96.

  9. A. S. Olenin, “Representative computations for investigating supercomputer architectures,” in: Non-Traditional Computer Architectures. Supercomputers [in Russian], No. 6, Moscow (1997).

Download references

Authors
  1. A. V. Nikitin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Popov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by Ministry of Science grants 201.03.002 and 201.03.003.

Translated from Chislennye Metody i Vychislitel'nyi Eksperiment, Moscow State University, pp. 97–106, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nikitin, A.V., Popov, A.M. Optimization of modular associative memory. Comput Math Model 10, 405–411 (1999). https://doi.org/10.1007/BF02359090

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02359090

Keywords

Search

Navigation