Automatic storage optimization

Fabri, Janet

doi:10.1145/800229.806957

Cited by 44 publications

(36 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Strong links between register allocation and local memory management have been discovered for more than 30 years by Fabri [1]. This seminal paper also studied the interplay with loop transformations.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing Local Memory Allocation and Assignment through a Decoupled Approach

Diouf

Öztürk

Cohen

2010

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

Abstract. Software-controlled local memories (LMs) are widely used to provide fast, scalable, power efficient and predictable access to critical data. While many studies addressed LM management, keeping hot data in the LM continues to cause major headache. This paper revisits LM management of arrays in light of recent progresses in register allocation, supporting multiple live-range splitting schemes through a generic integer linear program. These schemes differ in the grain of decision points. The model can also be extended to address fragmentation, assigning live ranges to precise offsets. We show that the links between LM management and register allocation have been underexploited, leaving much fundamental questions open and effective applications to be explored.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Compilation-time LM management has been connected to register allocation for at least 30 years [1]. Register allocation is just emerging from a series of tremendous, fundamental and applied progresses [2,3,4,5,6], redefining design of compiler backends.…”

Section: Introductionmentioning

confidence: 99%

Optimizing Local Memory Allocation and Assignment through a Decoupled Approach

Diouf

Öztürk

Cohen

2010

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

show abstract

“…Finding this optimal allocation based on a MEG can be achieved by solving the equivalent Interval Coloring Problem [4,12].…”

Section: Insu Cient Memorymentioning

confidence: 99%

“…Prior work on memory issues for MPSoCs mostly focused on optimization techniques that minimize the amount of memory allocated to run an application, thus reducing the required memory real estate of the developed system [21,12]. These techniques may only be applied during late stages of the system design process because they rely on a precise knowledge of the system behavior, particularly the mapping and scheduling of the application tasks on the system processors.…”

Section: Introductionmentioning

confidence: 99%

Memory Analysis and Optimized Allocation of Dataflow Applications on Shared-Memory MPSoCs

Desnos

Pelcat

Nezan

et al. 2014

J Sign Process Syst

View full text Add to dashboard Cite

The majority of applications, ranging from the low complexity to very multifaceted entities requiring dedicated hardware accelerators, are very well suited for Multiprocessor Systems-on-Chips (MPSoCs). It is critical to understand the general characteristics of a given embedded application: its behavior and its requirements in terms of MPSoC resources.This paper presents a complete method to study the important aspect of memory characteristic of an application. This method spans the theoretical, architectureindependent memory characterization to the quasi optimal static memory allocation of an application on a real shared-memory MPSoC. The application is modeled as an Synchronous Dataflow (SDF) graph which is used to derive a Memory Exclusion Graph (MEG) essential for the analysis and allocation techniques. Practical considerations, such as cache coherence and memory broadcasting, are extensively treated.Memory footprint optimization is demonstrated using the example of a stereo matching algorithm from the computer vision domain. Experimental results show a reduction of the memory footprint by up to 43% compared to a state-of-the-art minimization technique, a throughput improvement of 33% over dynamic allocation, and the introduction of a tradeoff between multicore scheduling flexibility and memory footprint.

show abstract

“…Our technique of characterizing the times at which tokens are written and read differs from the lifetimebased approach used by many HLL compilers [18,19], SDF compilers [6], and high level synthesis tools [20,21]. Briefly, the lifetime-based approaches try to determine the first time the token is written (buffer start time) and the time it is read (buffer stop time).…”

Section: Related Workmentioning

confidence: 99%

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Bhattacharyya

Murthy

2004

The Journal of VLSI Signal Processing-Systems for Signal, Image

View full text Add to dashboard Cite

Abstract. Memory consumption is an important metric for DSP software implementation. In this paper, we develop a module characterization technique that promotes more economical use of memory resources at the system level. Our work is developed in the context of software synthesis from signal/video/image processing applications expressed as synchronous dataflow (SDF) graphs. SDF is a restricted form of dataflow where each computational module (actor) consumes and produces a fixed number of data values (tokens) on each execution. Usually, no assumption is made about when during the execution of an actor, the tokens are actually consumed and produced; the firing of an actor is treated as an atomic event for most purposes. However, we show in this paper that it is possible to concisely and precisely capture key properties pertaining to the relative times at which tokens are produced and consumed by an actor. We show this by introducing the consumed-before-produced (CBP) parameter, which provides a general method for characterizing the token transfer of an SDF actor. Good bounds on the CBP parameter can aid an SDF compiler in performing more aggressive optimizations for reducing buffer sizes on the edges between actors. We formally define the CBP parameter; derive some useful properties of this parameter; illustrate how the value of the parameter is derived by examining in detail the multirate FIR filter, which is a fundamental actor in multirate signal processing applications; and examine CBP parameterizations for several other practical SDF actors.

show abstract

Automatic storage optimization

Cited by 44 publications

References 1 publication

Optimizing Local Memory Allocation and Assignment through a Decoupled Approach

Optimizing Local Memory Allocation and Assignment through a Decoupled Approach

Memory Analysis and Optimized Allocation of Dataflow Applications on Shared-Memory MPSoCs

The CBP Parameter: A Module Characterization Approach for DSP Software Optimization

Contact Info

Product

Resources

About