2005
DOI: 10.1007/s10766-004-1459-8
|View full text |Cite
|
Sign up to set email alerts
|

A Polynomial-Time Algorithm for Memory Space Reduction

Abstract: Reducing memory space requirement is important to many applications. For data-intensive applications, it may help avoid executing the program out-ofcore. For high-performance computing, memory space reduction may improve the cache hit rate as well as performance. For embedded systems, it can reduce the memory requirement, the memory latency and the energy consumption. This paper investigates program transformations which a compiler can use to reduce the memory space required for storing program data. In partic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Song et al [2004] proposed an aggressive array contraction and studied its impact on memory system performance. Song et al [2005] used an integer programming for modeling the problem of combining loop shifting, loop fusion, and array contraction. Lefebvre et al [1988] and Quillere and Rajopadhye [2000] proposed a memory reduction based on a multiprojection.…”
Section: Related Workmentioning
confidence: 99%
“…Song et al [2004] proposed an aggressive array contraction and studied its impact on memory system performance. Song et al [2005] used an integer programming for modeling the problem of combining loop shifting, loop fusion, and array contraction. Lefebvre et al [1988] and Quillere and Rajopadhye [2000] proposed a memory reduction based on a multiprojection.…”
Section: Related Workmentioning
confidence: 99%