Using indexed data structures for program specialization

Jung Gyu Park, Myong Soon Park

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

3 Citations (Scopus)

Abstract

Given a program and values of static (fixed) inputs, program specialization generates an optimized version of the program that only requires dynamic (run-time) inputs. It has been an useful tool for such areas as operating systems, multimedia applications, and scientific applications. However, the size of specialized code may grow up exponentially which makes program specialization impractical for many applications. In this paper, we present a mechanism to address this problem by using indexed data structures. Unlike traditional program specialization, which encodes the result of specialization only into run-time code, our method encodes the values of multi-valued static expressions into indexed data structures and single-valued static expressions into run-time code. Because the sizes of the indexed data structures are much smaller than that of program code, we can overcome the size problem of program specialization. With a preliminary implementation for Java, we achieved improvement in performance up to a factor of 3 with very low memory and space requirements and overheads.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation
Pages61-69
Number of pages9
EditionSEP.
Publication statusPublished - 2002 Dec 1
EventAsian Symposium on Partial Evaluation and Semantics - Based Program Manipulation - Aizu, Japan
Duration: 2002 Sep 122002 Sep 14

Other

OtherAsian Symposium on Partial Evaluation and Semantics - Based Program Manipulation
CountryJapan
CityAizu
Period02/9/1202/9/14

Fingerprint

Data structures
Data storage equipment

Keywords

  • Automated software engineering
  • Optimization
  • Partial evaluation
  • Program specialization
  • Staged computation

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Park, J. G., & Park, M. S. (2002). Using indexed data structures for program specialization. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (SEP. ed., pp. 61-69)

Using indexed data structures for program specialization. / Park, Jung Gyu; Park, Myong Soon.

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SEP. ed. 2002. p. 61-69.

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

Park, JG & Park, MS 2002, Using indexed data structures for program specialization. in Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SEP. edn, pp. 61-69, Asian Symposium on Partial Evaluation and Semantics - Based Program Manipulation, Aizu, Japan, 02/9/12.
Park JG, Park MS. Using indexed data structures for program specialization. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SEP. ed. 2002. p. 61-69
Park, Jung Gyu ; Park, Myong Soon. / Using indexed data structures for program specialization. Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SEP. ed. 2002. pp. 61-69
@inproceedings{106470830f6e4ae8959390cd9a2d0f6a,
title = "Using indexed data structures for program specialization",
abstract = "Given a program and values of static (fixed) inputs, program specialization generates an optimized version of the program that only requires dynamic (run-time) inputs. It has been an useful tool for such areas as operating systems, multimedia applications, and scientific applications. However, the size of specialized code may grow up exponentially which makes program specialization impractical for many applications. In this paper, we present a mechanism to address this problem by using indexed data structures. Unlike traditional program specialization, which encodes the result of specialization only into run-time code, our method encodes the values of multi-valued static expressions into indexed data structures and single-valued static expressions into run-time code. Because the sizes of the indexed data structures are much smaller than that of program code, we can overcome the size problem of program specialization. With a preliminary implementation for Java, we achieved improvement in performance up to a factor of 3 with very low memory and space requirements and overheads.",
keywords = "Automated software engineering, Optimization, Partial evaluation, Program specialization, Staged computation",
author = "Park, {Jung Gyu} and Park, {Myong Soon}",
year = "2002",
month = "12",
day = "1",
language = "English",
pages = "61--69",
booktitle = "Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation",
edition = "SEP.",

}

TY - GEN

T1 - Using indexed data structures for program specialization

AU - Park, Jung Gyu

AU - Park, Myong Soon

PY - 2002/12/1

Y1 - 2002/12/1

N2 - Given a program and values of static (fixed) inputs, program specialization generates an optimized version of the program that only requires dynamic (run-time) inputs. It has been an useful tool for such areas as operating systems, multimedia applications, and scientific applications. However, the size of specialized code may grow up exponentially which makes program specialization impractical for many applications. In this paper, we present a mechanism to address this problem by using indexed data structures. Unlike traditional program specialization, which encodes the result of specialization only into run-time code, our method encodes the values of multi-valued static expressions into indexed data structures and single-valued static expressions into run-time code. Because the sizes of the indexed data structures are much smaller than that of program code, we can overcome the size problem of program specialization. With a preliminary implementation for Java, we achieved improvement in performance up to a factor of 3 with very low memory and space requirements and overheads.

AB - Given a program and values of static (fixed) inputs, program specialization generates an optimized version of the program that only requires dynamic (run-time) inputs. It has been an useful tool for such areas as operating systems, multimedia applications, and scientific applications. However, the size of specialized code may grow up exponentially which makes program specialization impractical for many applications. In this paper, we present a mechanism to address this problem by using indexed data structures. Unlike traditional program specialization, which encodes the result of specialization only into run-time code, our method encodes the values of multi-valued static expressions into indexed data structures and single-valued static expressions into run-time code. Because the sizes of the indexed data structures are much smaller than that of program code, we can overcome the size problem of program specialization. With a preliminary implementation for Java, we achieved improvement in performance up to a factor of 3 with very low memory and space requirements and overheads.

KW - Automated software engineering

KW - Optimization

KW - Partial evaluation

KW - Program specialization

KW - Staged computation

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

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

M3 - Conference contribution

AN - SCOPUS:0036954429

SP - 61

EP - 69

BT - Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

ER -