Skip to main content
Log in

Problem of the optimization of memory hierarchies in automated control systems

  • Published:
Cybernetics Aims and scope

Conclusion

Thus the algorithm described allows us to construct a set of optimal hierarchical memory structures for an actual information system and to investigate their cost-time parameters.

When practical use is made of the method of optimizing hierarchical memory structures, it is necessary to take into account certain features of real information-storage systems. These include, in particular, the following factors:

The maximum number of homogeneous blocks of certain memory types may be restricted by the possibilities of the corresponding communication channels to the processor.

As the number of modules of given types of memory is increased by some step, an additional control device is needed (when the number of blocks is decreased, the converse applies) so that the overall cost will vary not in direct proportion to the number of modules.

For a serial-access memory (magnetic-tape-store type), the cost-time results of the transfer of information with highest activity into the major types of memory requires a more detailed analysis based on taking into account the variation of the location structure of actual information elements.

These and certain other factors may be taken into account within the framework of the proposed method by making the algorithm correspondingly more complicated without changing its essence.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Literature Cited

  1. K. M. Chandy and C. V. Ramamoorthy, “Optimization of information storage systems,” Information and Control,13, No. 6, 509–526 (1968).

    Google Scholar 

  2. C. V. Ramamoorthy and K. M. Chandy, “Optimization of memory hierarchies in multiprogrammed systems,” J. Assoc. Comput. Mach.,17, No. 3, 426–445 (1970).

    Google Scholar 

  3. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge University Press (1952).

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 14–20, May–June, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Litvinov, V.A., Sapozhnikov, A.S. & Timofeev, B.B. Problem of the optimization of memory hierarchies in automated control systems. Cybern Syst Anal 9, 385–391 (1973). https://doi.org/10.1007/BF01069191

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation