Browse

Memory-optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples

Cited 10 time in Web of Science Cited 16 time in Scopus
Authors
Oh, Hyunok; Ha, Soonhoi
Issue Date
2003-05
Publisher
Hindawi Publishing Corporation
Citation
EURASIP Journal on Applied Signal Processing, Vol. 2003:6, pp. 514-529, 2003
Keywords
software synthesismemory optimizationmultimediadataflow
Abstract
In multimedia and graphics applications, data samples of nonprimitive type require significant amount of buffer memory. This
paper addresses the problem of minimizing the buffer memory requirement for such applications in embedded software synthesis
from graphical dataflow programs based on the synchronous dataflow (SDF) model with the given execution order of nodes. We
propose a memory minimization technique that separates global memory buffers from local pointer buffers: the global buffers
store live data samples and the local buffers store the pointers to the global buffer entries. The proposed algorithm reduces 67%
memory for a JPEG encoder, 40% for an H.263 encoder compared with unshared versions, and 22% compared with the previous
sharing algorithm for the H.263 encoder. Through extensive buffer sharing optimization, we believe that automatic software
synthesis from dataflow program graphs achieves the comparable code quality with the manually optimized code in terms of
memory requirement.
ISSN
1110-8657
Language
English
URI
http://hdl.handle.net/10371/8887
DOI
https://doi.org/10.1155/S1110865703212130
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Computer Science and Engineering (컴퓨터공학부)Journal Papers (저널논문_컴퓨터공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse