To minimization of average time of access to hieratical memory

В.М. Синеглазов, А.С. Юрченко

Abstract

 On the basis of mathematical model of the hierarchical system of memory the task of minimization of mean time of address to the hierarchy of memory is decided at a limit on the total worth of the system of memory.

References

Catthoor K., Danckaert, C., Kulkarni, E., Brockmeyer P. G. , Kjeldsberg T., Van Achteren and T. Omnes Data Access and Storage Management for Embedded Programmable Processors. Kluwer Academic, – Р. 356 – 364, – 2002.

Budiu M., Goldstein S. C. Optimizing Memory Accesses For Spatial Computation, in International Symposium on Code Generation and Optimization. – 2003 – Р. 234 – 242.

Baradaran N., Diniz P. C. A register allocation algorithm in the presence of scalar replacement for fine-grain architecture, in the 2005 Conferenc on Design Automation and Testing in Europe, 2005 – Р. 337 – 345.

Benini A., Macii E., Macii, and M. Pancino. Synthesis of application-specific Memories for power optimization in embedded systems. In Proc. of 37th Design Automation Conference, June 2000. – Р. 300 – 303.

Alex Settle and Daniel A. Connors, Optimization for the Intel Architecture Register Stack, International Conference of in Proceedings of International Symposium of Code Generation and Optimization (CGO), San Francisco, March 2002 – Р. 245 – 252.

Welch T. A. Memory hierarchy configuration analysis // ІEEE. Trans. Comput. – V.27, №5. – 1998. – P. 408 – 413.

Full Text: PDF