Data Memory Minimization By Sharing Large Size Buffers

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

Full description

Bibliographic Details
Main Authors: Hyunok Oh, Soonhoi Ha
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: 2000
Subjects:
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.2897
http://mirage.snu.ac.kr/publications/./papers/asp_dac2000.pdf
Description
Summary: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.