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

Full description

Bibliographic Details
Other Authors: The Pennsylvania State University CiteSeerX Archives
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
_version_ 1821728044289622016
author2 The Pennsylvania State University CiteSeerX Archives
collection Unknown
description 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.
format Text
genre The Pointers
genre_facet The Pointers
id ftciteseerx:oai:CiteSeerX.psu:10.1.1.419.8133
institution Open Polar
language English
op_collection_id ftciteseerx
op_relation 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
op_rights Metadata may be used without restrictions as long as the oai identifier remains attached to it.
op_source http://www.cecs.uci.edu/~papers/compendium94-03/papers/2000/aspdac00/pdffiles/6b_2.pdf
record_format openpolar
spelling ftciteseerx:oai:CiteSeerX.psu:10.1.1.419.8133 2025-01-17T01:06:16+00:00 DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha The Pennsylvania State University CiteSeerX Archives application/pdf 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 en eng 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 Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.cecs.uci.edu/~papers/compendium94-03/papers/2000/aspdac00/pdffiles/6b_2.pdf text ftciteseerx 2016-01-08T03:54:08Z 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. Text The Pointers Unknown
spellingShingle DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title_full DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title_fullStr DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title_full_unstemmed DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title_short DATA MEMORY MINIMIZATION BY SHARING LARGE SIZE BUFFERS Hyunok Oh Soonhoi Ha
title_sort data memory minimization by sharing large size buffers hyunok oh soonhoi ha
url 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