Studying storage-recomputation tradeoffs in memory-constrained embedded processing

Mahmut Kandemir, Feihui Li, Guilin Chen, Guangyu Chen, Ozcan Ozturk

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

5 Citations (Scopus)

Abstract

Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we witness an unprecedented proliferation of embedded/mobile applications. Most of the environments that execute these applications have severe power, performance, and memory space constraints that need to be accounted for. In particular, memory limitations can present serious challenges to embedded software designers. The current solutions to this problem include sophisticated packaging techniques and code optimizations for effective memory utilization. While the first solution is not scalable, the second one is restricted by intrinsic data dependences in the code that prevent code restructuring. In this paper, we explore an alternate approach for reducing memory space requirements of embedded applications. The idea is to re-compute the result of a code block (potentially multiple times) instead of storing it in memory and performing a memory operation whenever needed. The main benefit of this approach is that it reduces memory space requirements, that is, no memory space is reserved for storing the result of the code block in question.

Original languageEnglish (US)
Title of host publicationProceedings - Design, Automation and Test in Europe, DATE '05
Pages1026-1031
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

Data storage equipment
Processing
Block codes
Embedded software
Packaging

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Kandemir, M., Li, F., Chen, G., Chen, G., & Ozturk, O. (2005). Studying storage-recomputation tradeoffs in memory-constrained embedded processing. In Proceedings - Design, Automation and Test in Europe, DATE '05 (pp. 1026-1031). [1395725] (Proceedings -Design, Automation and Test in Europe, DATE '05; Vol. II). https://doi.org/10.1109/DATE.2005.285
Kandemir, Mahmut ; Li, Feihui ; Chen, Guilin ; Chen, Guangyu ; Ozturk, Ozcan. / Studying storage-recomputation tradeoffs in memory-constrained embedded processing. Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. pp. 1026-1031 (Proceedings -Design, Automation and Test in Europe, DATE '05).
@inproceedings{6624fc6f07fc4760aebee4228a360f22,
title = "Studying storage-recomputation tradeoffs in memory-constrained embedded processing",
abstract = "Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we witness an unprecedented proliferation of embedded/mobile applications. Most of the environments that execute these applications have severe power, performance, and memory space constraints that need to be accounted for. In particular, memory limitations can present serious challenges to embedded software designers. The current solutions to this problem include sophisticated packaging techniques and code optimizations for effective memory utilization. While the first solution is not scalable, the second one is restricted by intrinsic data dependences in the code that prevent code restructuring. In this paper, we explore an alternate approach for reducing memory space requirements of embedded applications. The idea is to re-compute the result of a code block (potentially multiple times) instead of storing it in memory and performing a memory operation whenever needed. The main benefit of this approach is that it reduces memory space requirements, that is, no memory space is reserved for storing the result of the code block in question.",
author = "Mahmut Kandemir and Feihui Li and Guilin Chen and Guangyu Chen and Ozcan Ozturk",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/DATE.2005.285",
language = "English (US)",
isbn = "0769522882",
series = "Proceedings -Design, Automation and Test in Europe, DATE '05",
pages = "1026--1031",
booktitle = "Proceedings - Design, Automation and Test in Europe, DATE '05",

}

Kandemir, M, Li, F, Chen, G, Chen, G & Ozturk, O 2005, Studying storage-recomputation tradeoffs in memory-constrained embedded processing. in Proceedings - Design, Automation and Test in Europe, DATE '05., 1395725, Proceedings -Design, Automation and Test in Europe, DATE '05, vol. II, pp. 1026-1031, Design, Automation and Test in Europe, DATE '05, Munich, Germany, 3/7/05. https://doi.org/10.1109/DATE.2005.285

Studying storage-recomputation tradeoffs in memory-constrained embedded processing. / Kandemir, Mahmut; Li, Feihui; Chen, Guilin; Chen, Guangyu; Ozturk, Ozcan.

Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. p. 1026-1031 1395725 (Proceedings -Design, Automation and Test in Europe, DATE '05; Vol. II).

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

TY - GEN

T1 - Studying storage-recomputation tradeoffs in memory-constrained embedded processing

AU - Kandemir, Mahmut

AU - Li, Feihui

AU - Chen, Guilin

AU - Chen, Guangyu

AU - Ozturk, Ozcan

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we witness an unprecedented proliferation of embedded/mobile applications. Most of the environments that execute these applications have severe power, performance, and memory space constraints that need to be accounted for. In particular, memory limitations can present serious challenges to embedded software designers. The current solutions to this problem include sophisticated packaging techniques and code optimizations for effective memory utilization. While the first solution is not scalable, the second one is restricted by intrinsic data dependences in the code that prevent code restructuring. In this paper, we explore an alternate approach for reducing memory space requirements of embedded applications. The idea is to re-compute the result of a code block (potentially multiple times) instead of storing it in memory and performing a memory operation whenever needed. The main benefit of this approach is that it reduces memory space requirements, that is, no memory space is reserved for storing the result of the code block in question.

AB - Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we witness an unprecedented proliferation of embedded/mobile applications. Most of the environments that execute these applications have severe power, performance, and memory space constraints that need to be accounted for. In particular, memory limitations can present serious challenges to embedded software designers. The current solutions to this problem include sophisticated packaging techniques and code optimizations for effective memory utilization. While the first solution is not scalable, the second one is restricted by intrinsic data dependences in the code that prevent code restructuring. In this paper, we explore an alternate approach for reducing memory space requirements of embedded applications. The idea is to re-compute the result of a code block (potentially multiple times) instead of storing it in memory and performing a memory operation whenever needed. The main benefit of this approach is that it reduces memory space requirements, that is, no memory space is reserved for storing the result of the code block in question.

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

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

U2 - 10.1109/DATE.2005.285

DO - 10.1109/DATE.2005.285

M3 - Conference contribution

SN - 0769522882

SN - 9780769522883

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

SP - 1026

EP - 1031

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

ER -

Kandemir M, Li F, Chen G, Chen G, Ozturk O. Studying storage-recomputation tradeoffs in memory-constrained embedded processing. In Proceedings - Design, Automation and Test in Europe, DATE '05. 2005. p. 1026-1031. 1395725. (Proceedings -Design, Automation and Test in Europe, DATE '05). https://doi.org/10.1109/DATE.2005.285