Advertisement

Algorithm for Minimizing Operational Memory

  • N. V. Bukhgol’ts
  • V. F. D’yachenko
  • V. G. Lazarev
  • K. K. Chernyshev
  • V. A. Sharov

Abstract

The problem of economizing the memory of digital computer (DC) is of particular interest when one is designing specialized DC (SDC) for which the list of problems to be solved is fixed [1].

Keywords

Digital Computer Source Program Subroutine Call Program Branch Trial Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    A. P. Ershov, “Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs,” Dokl. Akad. Nauk SSSR, 142(4):785–787 (1962).Google Scholar
  2. 2.
    S. S. Lavrov, “On memory economies in closed operator schema,” Zh. Vychisl. Matem. i Matem. Fiz., Vol. 1, No. 4 (1961).Google Scholar
  3. 3.
    N. V. Bukhgol’ts, V. F. D’yachenko, V. G. Lazarev, K. K. Chernyshev, and V. A. Sharov, “On the question of economizing digital computer operational memory,” in: Computing Systems, Vol. 18, Novosibirsk (1965).Google Scholar
  4. 4.
    A. D Zakrevskii, “Automating the synthesis of discrete automata on the basis of the algorithms of language LYaPAS,” in: Computing Systems, Vol. 18, Novosibirsk (1965).Google Scholar

Copyright information

© Consultants Bureau, New York 1969

Authors and Affiliations

  • N. V. Bukhgol’ts
  • V. F. D’yachenko
  • V. G. Lazarev
  • K. K. Chernyshev
  • V. A. Sharov

There are no affiliations available

Personalised recommendations