• Home
  • Search
  • Global memory optimisation for embedded systems allowed by code duplication
  • Cite Icon22
  • https://doi.org/10.1145/1140389.1140397Copy DOI Icon

Global memory optimisation for embedded systems allowed by code duplication

  • Jan 1, 2005
  • Martin Palkovic +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The data transfers and storage are dominating contributors to the area and power consumption for all modern multimedia embedded systems. Modern high-level memory optimisations can ensure cost-efficient realisation of these systems. An important step in these optimisations are loop transformations performed on a geometrical model. However, these loop transformations traditionally cannot optimise code across data dependent conditions.In this paper we selectively duplicate the code in order to enable global loop transformations across data dependent conditions. We propose a technique which finds in a systematic way the Pareto curve in 2D exploration space: the better memory optimisations vs. the code increase. Our technique has been tested on an MP3 audio decoder. Results show 45.8% decrease in the number of main memory accesses which requires a 16.2% increase of code size.

Similar Papers
  • Research Article
  • Citations7

Enhanced applicability of loop transformations

  • Jan 01, 2007
  • Data Archiving and Networked Services (DANS)
  • Martin Palkovič
  • Research Article
  • Citations4

Dealing with data dependent conditions to enable general global source code transformations

  • Jan 01, 2009
  • International Journal of Embedded Systems
  • Martin Palkovic +2
  • Research Article
  • Citations18

Incremental hierarchical memory size estimation for steering of loop transformations

  • Sep 01, 2007
  • ACM Transactions on Design Automation of Electronic Systems
  • Q Hu +4
  • Conference Article
  • Citations120

Source code optimization and profiling of energy consumption in embedded systems

  • Sep 20, 2000
  • T Simunic +3
  • Book Chapter

An Equivalence Checking Framework for Array-Intensive Programs

  • Jan 01, 2017
  • Kunal Banerjee +2
  • Conference Article
  • Citations13

Fast-path loop unrolling of non-counted loops to enable subsequent compiler optimizations

  • Jan 01, 2018
  • David Leopoldseder +5
  • Conference Article
  • Citations3

Code optimization of parallel programs

  • Apr 06, 2008
  • Vivek Sarkar
  • Book Chapter
  • Citations7

Challenges in Code Optimization of Parallel Programs

  • Jan 01, 2009
  • Vivek Sarkar
  • Conference Article
  • Citations8

Prophetic branches: a branch architecture for code compaction and efficient execution

  • Dec 01, 1993
  • Apoorv Srivastava +1
  • Book Chapter
  • Citations5

Applying Code Specialization to FFT Libraries for Integral Parameters

  • Jan 01, 2007
  • Minhaj Ahmad Khan +1
  • Conference Article
  • Citations9

Size-constrained code placement for cache miss rate reduction

  • Dec 23, 2002
  • H Tomiyama +1
  • Conference Article
  • Citations10

Size-constrained code placement for cache miss rate reduction

  • Nov 06, 1996
  • Hiroyuki Tomiyama +1
  • Conference Article
  • Citations10

Clocked and asynchronous instruction pipelines

  • Jan 01, 1993
  • Mark A Franklin +1
  • Conference Article
  • Citations14

Prophetic branches: a branch architecture for code compaction and efficient execution

  • Jan 01, 1993
  • Apoorv Srivastava +1
  • Conference Article
  • Citations7

Using machine learning to predict the code size impact of duplication heuristics in a dynamic compiler

  • Sep 29, 2021
  • Raphael Mosaner +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.