DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
Abstract- This paper presents software synthesis techniques to deal with non-primitive data type from graphical dataflow programs based on the synchronous dataflow (SDF) model. Non-primitive data types, often used in multimedia and graphics applications, require buffer memory of large size. To minim...
| Other Authors: | |
|---|---|
| Format: | Text |
| Language: | English |
| Subjects: | |
| Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.8133 http://www.cecs.uci.edu/~papers/compendium94-03/papers/2000/aspdac00/pdffiles/6b_2.pdf |
| Summary: | Abstract- This paper presents software synthesis techniques to deal with non-primitive data type from graphical dataflow programs based on the synchronous dataflow (SDF) model. Non-primitive data types, often used in multimedia and graphics applications, require buffer memory of large size. To minimize the buffer requirement, we separate global data buffers and local pointer buffers. The proposed approach first allocates the minimum size of global buffers and next binds the local buffers to the global buffers by setting the pointers. Static binding and dynamic binding techniques are devised. Experimental results prove the significance of the proposed techniques. I. |
|---|