Title :
A quantitative analysis for optimizing memory allocation
Author :
Hong, Youn-Sik ; Cho, Choong-Nee ; Gajski, Daniel D.
Author_Institution :
Dept. of Comput. Sci., Inchon Univ., South Korea
Abstract :
Memory allocation problem has two independent goals: minimization of number of memories and minimization of number of registers in one memory. Our concern is the ordering of bindings during memory allocation. We formulate and analyze three different memory allocation algorithms by changing their binding order. It is shown that when we combine these subtasks and solve them simultaneously by heuristic cost function significant savings (up to 20%) can be obtained in the total area of memories
Keywords :
integrated memory circuits; memory architecture; optimisation; heuristic cost function; memory allocation; ordering of bindings; quantitative analysis; registers; subtasks; total area of memories; Algorithm design and analysis; Computer science; Constraint optimization; Cost function; Registers; Silicon; Simultaneous localization and mapping; Throughput;
Conference_Titel :
Design Automation Conference, 1997. Proceedings of the ASP-DAC '97 Asia and South Pacific
Conference_Location :
Chiba
Print_ISBN :
0-7803-3662-3
DOI :
10.1109/ASPDAC.1997.600131
