SpringerOpen Newsletter

Receive periodic news and updates relating to SpringerOpen.

This article is part of the series Rapid Prototyping of DSP Systems.

Open Access Research Article

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

Hyunok Oh* and Soonhoi Ha

Author Affiliations

The School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Korea

For all author emails, please log on.

EURASIP Journal on Advances in Signal Processing 2003, 2003:650391  doi:10.1155/S1110865703212130

The electronic version of this article is the complete one and can be found online at: http://asp.eurasipjournals.com/content/2003/6/650391

Received:28 February 2002
Revisions received:15 October 2002
Published:20 May 2003

© 2003 Copyright © 2003 Hindawi Publishing Corporation

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.

software synthesis; memory optimization; multimedia; dataflow

Research Article