A Quantitative Analysis for An Efficient Memory Allocation


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 9, pp. 2395-2403, Sep. 1998
10.3745/KIPSTE.1998.5.9.2395,   PDF Download:

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 the 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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. Y. Shik, "A Quantitative Analysis for An Efficient Memory Allocation," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 9, pp. 2395-2403, 1998. DOI: 10.3745/KIPSTE.1998.5.9.2395.

[ACM Style]
Hong Yun Shik. 1998. A Quantitative Analysis for An Efficient Memory Allocation. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 9, (1998), 2395-2403. DOI: 10.3745/KIPSTE.1998.5.9.2395.