Access pattern-based code compression for memory-constrained embedded systems

O. Ozturk, H. Saputra, Mahmut Kandemir, I. Kolcu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into account, that is, the same compression/decompression strategy is used irrespective of the application being optimized. This paper presents a code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts.

Original languageEnglish (US)
Title of host publicationProceedings - Design, Automation and Test in Europe, DATE '05
Pages882-887
Number of pages6
DOIs
StatePublished - Dec 1 2005
EventDesign, Automation and Test in Europe, DATE '05 - Munich, Germany
Duration: Mar 7 2005Mar 11 2005

Publication series

NameProceedings -Design, Automation and Test in Europe, DATE '05
VolumeII
ISSN (Print)1530-1591

Other

OtherDesign, Automation and Test in Europe, DATE '05
CountryGermany
CityMunich
Period3/7/053/11/05

Fingerprint

Embedded systems
Data storage equipment
Flow graphs
Hardware

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Ozturk, O., Saputra, H., Kandemir, M., & Kolcu, I. (2005). Access pattern-based code compression for memory-constrained embedded systems. In Proceedings - Design, Automation and Test in Europe, DATE '05 (pp. 882-887). [1395694] (Proceedings -Design, Automation and Test in Europe, DATE '05; Vol. II). https://doi.org/10.1109/DATE.2005.46
Ozturk, O. ; Saputra, H. ; Kandemir, Mahmut ; Kolcu, I. / Access pattern-based code compression for memory-constrained embedded systems. Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. pp. 882-887 (Proceedings -Design, Automation and Test in Europe, DATE '05).
@inproceedings{9d53868be6bf4819bd141e8b4c4f1296,
title = "Access pattern-based code compression for memory-constrained embedded systems",
abstract = "As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into account, that is, the same compression/decompression strategy is used irrespective of the application being optimized. This paper presents a code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts.",
author = "O. Ozturk and H. Saputra and Mahmut Kandemir and I. Kolcu",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/DATE.2005.46",
language = "English (US)",
isbn = "0769522882",
series = "Proceedings -Design, Automation and Test in Europe, DATE '05",
pages = "882--887",
booktitle = "Proceedings - Design, Automation and Test in Europe, DATE '05",

}

Ozturk, O, Saputra, H, Kandemir, M & Kolcu, I 2005, Access pattern-based code compression for memory-constrained embedded systems. in Proceedings - Design, Automation and Test in Europe, DATE '05., 1395694, Proceedings -Design, Automation and Test in Europe, DATE '05, vol. II, pp. 882-887, Design, Automation and Test in Europe, DATE '05, Munich, Germany, 3/7/05. https://doi.org/10.1109/DATE.2005.46

Access pattern-based code compression for memory-constrained embedded systems. / Ozturk, O.; Saputra, H.; Kandemir, Mahmut; Kolcu, I.

Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. p. 882-887 1395694 (Proceedings -Design, Automation and Test in Europe, DATE '05; Vol. II).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Access pattern-based code compression for memory-constrained embedded systems

AU - Ozturk, O.

AU - Saputra, H.

AU - Kandemir, Mahmut

AU - Kolcu, I.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into account, that is, the same compression/decompression strategy is used irrespective of the application being optimized. This paper presents a code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts.

AB - As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into account, that is, the same compression/decompression strategy is used irrespective of the application being optimized. This paper presents a code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts.

UR - http://www.scopus.com/inward/record.url?scp=33646929786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646929786&partnerID=8YFLogxK

U2 - 10.1109/DATE.2005.46

DO - 10.1109/DATE.2005.46

M3 - Conference contribution

SN - 0769522882

SN - 9780769522883

T3 - Proceedings -Design, Automation and Test in Europe, DATE '05

SP - 882

EP - 887

BT - Proceedings - Design, Automation and Test in Europe, DATE '05

ER -

Ozturk O, Saputra H, Kandemir M, Kolcu I. Access pattern-based code compression for memory-constrained embedded systems. In Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. p. 882-887. 1395694. (Proceedings -Design, Automation and Test in Europe, DATE '05). https://doi.org/10.1109/DATE.2005.46