Exploiting parallelism in memory operations for code optimization

Yunheung Paek, Junsik Choi, Jinoo Joung, Junseo Lee, Seonwook Kim

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

Code size reduction is ever becoming more important for compilers targeting embedded processors because these processors are often severely limited by storage constraints and thus the reduced code size can have a positively significant impact on their performance. Various code size reduction techniques have different motivations and a variety of application contexts utilizing special hardware features of their target processors. In this work, we propose a novel technique that fully utilizes a set of hardware instructions, called the multiple load/store (MLS) or parallel load/store (PLS), that are specially featured for reducing code size by minimizing the number of memory operations in the code. To take advantage of this feature, many microprocessors support the MLS instructions, whereas no existing compilers fully exploit the potential benefit of these instructions but only use them for some limited cases. This is mainly because optimizing memory accesses with MLS instructions for general cases is an NP-hard problem that necessitates complex assignments of registers and memory offsets for variables in a stack frame. Our technique uses a couple of heuristics to efficiently handle this problem in a polynomial time bound.

Original languageEnglish
Pages (from-to)132-148
Number of pages17
JournalLecture Notes in Computer Science
Volume3602
DOIs
Publication statusPublished - 2005
Event17th International Workshop on Languages and Compilers for High Performance Computing, LCPC 2004 - West Lafayette, IN, United States
Duration: 2004 Sep 222004 Sep 24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Exploiting parallelism in memory operations for code optimization'. Together they form a unique fingerprint.

  • Cite this