Resource-bounded partial evaluation

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

10 Scopus citations

Abstract

Most partial evaluators do not take the availability of machine-level resources, such as registers or cache, into consideration when making their specialization decisions. The resulting resource contention can lead to severe performance degradation-causing, in extreme cases, the specialized code to run slower than the unspe-cialized code. In this paper we consider how resource considerations can be incorporated within a partial eval-uaior. We develop an abstract formulation of the problem, show that optimal resource-bounded partial evaluation is NP-complete, and discuss simple heuristics that can be used to address the problem in practice.

Original languageEnglish (US)
Title of host publicationProceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997
PublisherAssociation for Computing Machinery
Pages179-192
Number of pages14
ISBN (Print)0897919173, 9780897919173
DOIs
StatePublished - Jan 1 1997
Event1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997 - Amsterdam, Netherlands
Duration: Jun 12 1997Jun 13 1997

Publication series

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

Conference

Conference1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997
CountryNetherlands
CityAmsterdam
Period6/12/976/13/97

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Resource-bounded partial evaluation'. Together they form a unique fingerprint.

Cite this