| Presentation | 2003/1/10 Memory Allocation Method for Indirect Addressing with ±2^n Auto-modification Masashi HORI, Nobuhiko SUGINO, Akinori NISHIHARA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Indirect addressing with ±2～n auto-modification is assumed, and a memory allocation method based on graph representation is proposed. Although such an indirect addressing can be easily implemented on hardware, careful allocation of program variables is required in order to reduce overhead codes. For such indirect addressing, besides its simple hardware implementation, careful allocation of program variables is required in order to avoid overhead codes. In this article, the method removes unrealizable constraints over memory allocation from a given graph representation. The proposed method in this article, first, examines memory allocation constraints, and removes constraints unrealizable by ±2～n auto-modification, so that less overhead codes are required at these unrealizable constraints. Finally according to the derived overhead-free constraint graph, the method assigns a memory address to every program variables. The proposed method is applied to a DSP compiler, and its effectiveness is shown by codes generated for several examples. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | ±2^nauto-modification / Access graph / Address allocation / Indirect memory addressing / DSP compiler |
| Paper # | DSP2002-188,SAT2002-138,RCS2002-257 |
| Date of Issue |
| Conference Information | |
| Committee | SAT |
|---|---|
| Conference Date | 2003/1/10(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Satellite Telecommunications (SAT) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Memory Allocation Method for Indirect Addressing with ±2^n Auto-modification |
| Sub Title (in English) | |
| Keyword(1) | ±2^nauto-modification |
| Keyword(2) | Access graph |
| Keyword(3) | Address allocation |
| Keyword(4) | Indirect memory addressing |
| Keyword(5) | DSP compiler |
| 1st Author's Name | Masashi HORI |
| 1st Author's Affiliation | Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology() |
| 2nd Author's Name | Nobuhiko SUGINO |
| 2nd Author's Affiliation | Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology |
| 3rd Author's Name | Akinori NISHIHARA |
| 3rd Author's Affiliation | The Center for Research and Debelopment of Educational Technology Tokyo Institute of Technology |
| Date | 2003/1/10 |
| Paper # | DSP2002-188,SAT2002-138,RCS2002-257 |
| Volume (vol) | vol.102 |
| Number (no) | 548 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |