An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System


KIPS Transactions on Computer and Communication Systems, Vol. 2, No. 2, pp. 59-66, Feb. 2013
10.3745/KTCCS.2013.2.2.59,   PDF Download:

Abstract

In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. There for, we proved to reduce the execution time of programs.


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]
J. U. Chang and C. H. Lin, "An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System," KIPS Transactions on Computer and Communication Systems, vol. 2, no. 2, pp. 59-66, 2013. DOI: 10.3745/KTCCS.2013.2.2.59.

[ACM Style]
Jeong Uk Chang and Chi Ho Lin. 2013. An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System. KIPS Transactions on Computer and Communication Systems, 2, 2, (2013), 59-66. DOI: 10.3745/KTCCS.2013.2.2.59.